Skip to main content
×
×
Home

Arithmetical problems and recursively enumerable predicates1

  • Martin Davis (a1)
Extract

It is an immediate consequence of results of Church and Gödel that there exist arithmetical recursively unsolvable problems, that is, recursively unsolvable problems of the form [M](P = Q) where P and Q are polynomials and [M] is some finite sequence of existential and universal quantifiers. A question which is immediately raised by this result is whether there exist unsolvable problems of this form where [M] is some finite sequence of existential quantifiers only. As a matter of fact this question is easily seen to be closely related to the tenth problem in the famous list proposed by Hilbert in 1900.

In this paper, we prove the existence of recursively unsolvable problems of the form

where P and Q are polynomials with non-negative integral coefficients. As a matter of fact we show that every recursively enumerable predicate is of the form (1), and conversely that every predicate of the form (1) is recursively enumerable. While our result does not yield the recursive unsolvability of Hilbert's tenth problem, it is easily seen that any considerable improvement of our result would yield this unsolvability.

The author wishes to take this opportunity to express his gratitude to Professors Alonzo Church and E. L. Post with whom he has had the privilege of discussing some of the questions involved in this paper. He also wishes to thank his friends Melvin Hausner and Jacob Schwartz who have made valuable suggestions.

Copyright
Footnotes
Hide All
1

The results of this paper are included in [2], a thesis presented to the faculty of Princeton University in candidacy for the degree Doctor of Philosophy and accepted in May, 1950. The results were announced at a meeting of the Association for Symbolic Logic in December 1949 (cf. this Journal, vol. 15 (1950), p. 77).

Footnotes
References
Hide All
[1]Church, Alonzo, An unsolvable problem of elementary number theory, American journal of mathematics, vol. 58 (1936), pp. 345363.
[2]Davis, Martin, On the theory of recursive unsolvability, cf. footnote 1.
[3]Gödel, Kurt, Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I, Monatshefte für Mathematik und Physik, vol. 38 (1931), pp. 173198.
[4]Gödel, Kurt, On undecidable propositions of formal mathematical systems, notes of lectures at the Institute for Advanced Study, 1934.
[5]Hilbert, David, Mathematische Probleme. Vortrag, gehalten auf dem internationalen Mathematiker-Kongress zu Paris 1900. Nachrichten von der K. Gesellschaft der Wissenschaften zu Göttingen, Math.-Phys. Kl. 1900, pp. 253297. Reprinted, Archiv der Mathematik und Physik, 3s. vol. I (1901), pp. 44–63, 213-237. English translation, Bulletin of the American Mathematical Society, vol. 8 (1901–1902), pp. 437–479.
[6]Kleene, S. C., General recursive functions of natural numbers, Mathematische Annalen, vol. 112 (1936), pp. 727742.
[7]Kleene, S. C., Recursive predicates and quantifiers, Transactions of the American Mathematical Society, vol. 53 (1943), pp. 4173.
[8]Mostowski, Andrzej, On definable sets of positive integers, Fundamenta mathematicae, vol. 34 (1946), pp. 81112.
[9]Mostowski, Andrzej, On a set of integers not definable by means of one-quantifier predicates, Annales de la Société Polonaise de Mathématique, vol. 21 (1948), pp. 114119.
[10]Robinson, Julia, General recursive functions, Proceedings of the American Mathematical Society, vol. 1 (1950), pp. 703718.
[11]Rosser, J. B., Extensions of some theorems of Gödel and Church, Journal of symbolic logic, vol. 1 (1936), pp. 8791.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed