Robinson, J. Unsolvable diophantine problems. (English) Zbl 0182.01901 Proc. Am. Math. Soc. 22, 534-538 (1969). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 8 Documents Keywords:recursion theory, constructive mathematics × Cite Format Result Cite Review PDF Full Text: DOI References: [1] Martin Davis, Computability and unsolvability, McGraw-Hill Series in Information Processing and Computers, McGraw-Hill Book Co., Inc., New York-Toronto-London, 1958. · Zbl 0080.00902 [2] Martin Davis, Extensions and corollaries of recent work on Hilbert’s Tenth Problem., Illinois J. Math. 7 (1963), 246 – 250. · Zbl 0112.24603 [3] -, One equation to rule them all, Memorandum RM-5494-PR, The RAND Corporation, Santa Monica, Calif., 1968. · Zbl 0316.02051 [4] Martin Davis, Hilary Putnam, and Julia Robinson, The decision problem for exponential diophantine equations, Ann. of Math. (2) 74 (1961), 425 – 436. · Zbl 0111.01003 · doi:10.2307/1970289 [5] Hilary Putnam, An unsolvable problem in number theory, J. Symbolic Logic 25 (1960), 220 – 232. · Zbl 0108.00701 · doi:10.2307/2964679 [6] Julia Robinson, Existential definability in arithmetic, Trans. Amer. Math. Soc. 72 (1952), 437 – 449. · Zbl 0047.24802 [7] Julia Robinson, Diophantine decision problems, Studies in Number Theory, Math. Assoc. Amer. (distributed by Prentice-Hall, Englewood Cliffs, N.J.), 1969, pp. 76 – 116. · Zbl 0269.02018 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.