Existential definability in arithmetic
HTML articles powered by AMS MathViewer
- by Julia Robinson
- Trans. Amer. Math. Soc. 72 (1952), 437-449
- DOI: https://doi.org/10.1090/S0002-9947-1952-0048374-2
- PDF | Request permission
References
- M. Davis, Arithmetical problems and recursively enumerable predicates (abstract), Journal of Symbolic Logic vol. 15 (1950) pp. 77-78.
- Kurt Gödel, Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I, Monatsh. Math. Phys. 38 (1931), no. 1, 173–198 (German). MR 1549910, DOI 10.1007/BF01700692
- S. C. Kleene, Recursive predicates and quantifiers, Trans. Amer. Math. Soc. 53 (1943), 41–73. MR 7371, DOI 10.1090/S0002-9947-1943-0007371-8 A. Tarski, A decision method for elementary algebra and geometry, Rand Corporation, Santa Monica, Calif., 1948. Reprinted by the University of California Press, Berkeley, Calif., 1951.
Bibliographic Information
- © Copyright 1952 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 72 (1952), 437-449
- MSC: Primary 02.0X
- DOI: https://doi.org/10.1090/S0002-9947-1952-0048374-2
- MathSciNet review: 0048374