Classes of recursively enumerable sets and their decision problems
HTML articles powered by AMS MathViewer
- by H. G. Rice
- Trans. Amer. Math. Soc. 74 (1953), 358-366
- DOI: https://doi.org/10.1090/S0002-9947-1953-0053041-6
- PDF | Request permission
References
- Alonzo Church, An Unsolvable Problem of Elementary Number Theory, Amer. J. Math. 58 (1936), no. 2, 345–363. MR 1507159, DOI 10.2307/2371045
- 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, General recursive functions of natural numbers, Math. Ann. 112 (1936), no. 1, 727–742. MR 1513071, DOI 10.1007/BF01565439 —, On notation for ordinal numbers, J. Symbolic Logic vol. 3 (1938) pp. 150-155.
- 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
- Andrzej Mostowski, On definable sets of positive integers, Fund. Math. 34 (1947), 81–112. MR 21923, DOI 10.4064/fm-34-1-81-112
- Emil L. Post, Recursively enumerable sets of positive integers and their decision problems, Bull. Amer. Math. Soc. 50 (1944), 284–316. MR 10514, DOI 10.1090/S0002-9904-1944-08111-1 J. B. Rosser, Extensions of some theorems of Gödel and Church, J. Symbolic Logic vol. 1 (1936) pp. 87-91.
Bibliographic Information
- © Copyright 1953 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 74 (1953), 358-366
- MSC: Primary 02.0X
- DOI: https://doi.org/10.1090/S0002-9947-1953-0053041-6
- MathSciNet review: 0053041