Degrees of computability
HTML articles powered by AMS MathViewer
- by Norman Shapiro PDF
- Trans. Amer. Math. Soc. 82 (1956), 281-299 Request permission
References
- Alonzo Church, The Calculi of Lambda-Conversion, Annals of Mathematics Studies, No. 6, Princeton University Press, Princeton, N. J., 1941. MR 0005274
- Alonzo Church, An Unsolvable Problem of Elementary Number Theory, Amer. J. Math. 58 (1936), no. 2, 345–363. MR 1507159, DOI 10.2307/2371045 Martin Davis, On the theory of recursive unsolvability, unpublished. G. H. Hardy and E. M. Wright, Introduction to the theory of numbers, Oxford, Oxford Press, 1945.
- Stephen Cole Kleene, Introduction to metamathematics, D. Van Nostrand Co., Inc., New York, N. Y., 1952. MR 0051790
- Werner Markwald, Zur Theorie der konstruktiven Wohlordnungen, Math. Ann. 127 (1954), 135–149 (German). MR 61076, DOI 10.1007/BF01361115
- 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
- H. G. Rice, Classes of recursively enumerable sets and their decision problems, Trans. Amer. Math. Soc. 74 (1953), 358–366. MR 53041, DOI 10.1090/S0002-9947-1953-0053041-6
- H. G. Rice, Recursive real numbers, Proc. Amer. Math. Soc. 5 (1954), 784–791. MR 63328, DOI 10.1090/S0002-9939-1954-0063328-5
- Alfred Tarski, A decision method for elementary algebra and geometry, University of California Press, Berkeley-Los Angeles, Calif., 1951. 2nd ed. MR 0044472 Alan M. Turing, Systems of logic based on ordinals, Proc. London Math. Soc. (2) vol. 45 (1939) pp. 161-228. —, On computable numbers with an application to the Entscheidungsproblem, Proc. London Math. Soc. (2) vol. 42 (1936) pp. 230-265.
Additional Information
- © Copyright 1956 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 82 (1956), 281-299
- MSC: Primary 02.0X
- DOI: https://doi.org/10.1090/S0002-9947-1956-0085187-3
- MathSciNet review: 0085187