Register machine proof of the theorem on exponential diophantine representation of enumerable sets

&
Journal of Symbolic Logic 49 (3):818-829 (1984)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274135

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,169

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Verena H. Dyson, James P. Jones, and John C. Shepherdson. Some diophantine forms of Gödel's theorem. Archiv für mathematische Logik und Grundlagenforschung, vol. 22 , pp. 51–60. - James P. Jones. Universal diophantine equation. The journal of symbolic logic, vol. 47 , pp. 549–571. - J. P. Jones and Ju. V. Matijasevič. Exponential diophantine representation of recursively enumerable sets. English with French abstract. Proceedings of the Herbrand Symposium, Logic Colloquium '81, Proceedings of the Herbrand Symposium held in Marseilles, France, July 1981, edited by J. Stern, Studies in logic and the foundations of mathematics, vol. 107, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1982, pp. 159–177. - J. P. Jones and Y. V. Matijasevič. Register machine proof of the theorem on exponential diophantine representation of enumerable sets. The journal of symbolic logic, vol. 49 , pp. 818–829. [REVIEW]Martin Davis - 1986 - Journal of Symbolic Logic 51 (2):477-479.
Classification of Quantifier Prefixes Over Diophantine Equations.Some Diophantine Forms of Godel's Theorem.Universal Diophantine Equation.Exponential Diophantine Representation of Recursively Enumerable Sets.Register Machine Proof of the Theorem on Exponential Diophantine Representation of Enumerable Sets.James P. Jones, Verena H. Dyson, John C. Shepherdson & J. P. Jones - 1986 - Journal of Symbolic Logic 51 (2):477-479.
Review: Yu. V. Matijasevic, Diophantine Representation of Recursively Enumerable Predicates. [REVIEW]Alonzo Church - 1972 - Journal of Symbolic Logic 37 (3):606-607.
Review: Ju. V. Matijasevic, A. Doohovskoy, Enumerable Sets are Diophantine. [REVIEW]Julia Robinson - 1972 - Journal of Symbolic Logic 37 (3):605-606.
Review: Ju. V. Matijasevic, F. M. Goldware, Diophantine Representation of Enumerable Predicates. [REVIEW]Martin Davis - 1974 - Journal of Symbolic Logic 39 (3):605-605.
A direct method for simulating partial recursive functions by Diophantine equations.Yuri Matiyasevich - 1994 - Annals of Pure and Applied Logic 67 (1-3):325-348.
Matijasevič Ju. V.. Diophantine representation of recursively enumerable predicates. Proceedings of the Second Scandinavian Logic Symposium, edited by Fenstad J. E., Studies in logic and the foundations of mathematics, vol. 63, North-Holland Publishing Company, Amsterdam and London 1971, pp. 171–177. [REVIEW]Ann S. Ferebee - 1972 - Journal of Symbolic Logic 37 (3):606-606.
Ú. V. Matiásévič Diofantovost' péréčislimyh množéstv. Doklady Akadémii Nauk SSSR, vol. 191 , pp. 279–282. - Ju. V. Matijasevič. Enumerable sets are diophantine. English translation of the preceding by A. Doohovskoy. Soviet mathematics, vol. 11 no. 2 , pp. 354–357. See Errata, ibid., vol. 11 no. 6 , p. vi. [REVIEW]Julia Robinson - 1972 - Journal of Symbolic Logic 37 (3):605-606.

Analytics

Added to PP
2009-01-28

Downloads
94 (#230,377)

6 months
21 (#132,719)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The incompleteness of theories of games.Marcelo Tsuji, Newton C. A. Costa & Francisco A. Doria - 1998 - Journal of Philosophical Logic 27 (6):553-568.

Add more citations

References found in this work

No references found.

Add more references