Hostname: page-component-5c6d5d7d68-wp2c8 Total loading time: 0 Render date: 2024-09-01T16:13:55.497Z Has data issue: false hasContentIssue false

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 (1982), pp. 51–60. - James P. Jones. Universal diophantine equation. The journal of symbolic logic, vol. 47 (1982), 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 (1984), pp. 818–829.

Review products

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 (1982), pp. 51–60.

James P. Jones. Universal diophantine equation. The journal of symbolic logic, vol. 47 (1982), 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.

Published online by Cambridge University Press:  12 March 2014

Abstract

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Reviews
Copyright
Copyright © Association for Symbolic Logic 1986

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)