The Decision Problem for Exponential Diophantine Equations

, &
Journal of Symbolic Logic 35 (1):151-152 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271205

Other Versions

No versions found

Links

PhilArchive



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

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

Martin Davis, Hilary Putnam, and Julia Robinson. The decision problem for exponential diophantine equations. Annals of mathematics, second series vol. 74 , pp. 425–436. [REVIEW]Hartley Rogers - 1970 - Journal of Symbolic Logic 35 (1):151-152.
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.
Julia Robinson. The undecidability of exponential Diophantine equations. Logic, methodology and philosophy of science, Proceedings of the 1960 International Congress, edited by Ernest Nagel, Patrick Suppes, and Alfred Tarski, Stanford University Press, Stanford, Calif., 1962, pp. 12–13. [REVIEW]R. A. DiPaola & Frederic B. Fitch - 1970 - Journal of Symbolic Logic 35 (1):152-152.
Martin Davis and Hilary Putnam. Reductions of Hilbert's tenth problem. The Journal of symbolic logic, vol. 23 no. 2 , pp. 183–187.Julia Robinson - 1972 - Journal of Symbolic Logic 37 (3):601.
The exponential diophantine problem for.Mihai Prunescu - 2020 - Journal of Symbolic Logic 85 (2):671-672.
Conjunctions of exponential diophantine equations over $${\mathbb {Q}}$$.Mihai Prunescu - forthcoming - Archive for Mathematical Logic:1-6.
The Undecidability of Exponential Diophantine Equations.Hartley Rogers & Julia Robinson - 1970 - Journal of Symbolic Logic 35 (1):152.
Martin Davis and Hilary Putnam. A computing procedure for quantification theory. Journal of the Association for Computing Machinery, vol. 7 , pp. 201–215. [REVIEW]J. A. Robinson - 1966 - Journal of Symbolic Logic 31 (1):125-126.
Julia Robinson. Unsolvable diophantine problems. Proceedings of the American Mathematical Society, vol. 22 , pp. 534–538. [REVIEW]Robert A. DiPaola - 1972 - Journal of Symbolic Logic 37 (3):603-604.
Julia Robinson. Diophantine decision problems. Studies in number theory, edited by W. J. LeVeque, Studies in mathematics, vol. 6, The Mathematical Association of America, Washington, D.C., distributed by Prentice-Hall, Inc., Englewood Cuffs, New Jersey, 1969, pp. 76–116. [REVIEW]H. B. Enderton - 1972 - Journal of Symbolic Logic 37 (3):603.

Analytics

Added to PP
2015-02-05

Downloads
68 (#331,009)

6 months
10 (#359,270)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On the provability logic of bounded arithmetic.Rineke Verbrugge & Alessandro Berarducci - 1991 - Annals of Pure and Applied Logic 61 (1-2):75-93.
Typed lambda calculus.Henk P. Barendregt, Wil Dekkers & Richard Statman - 1977 - In Jon Barwise, Handbook of mathematical logic. New York: North-Holland. pp. 1091--1132.
Two undecidable problems of analysis.Bruno Scarpellini - 2003 - Minds and Machines 13 (1):49-77.

View all 12 citations / Add more citations

References found in this work

No references found.

Add more references