Recursive real numbers
HTML articles powered by AMS MathViewer
- by H. G. Rice
- Proc. Amer. Math. Soc. 5 (1954), 784-791
- DOI: https://doi.org/10.1090/S0002-9939-1954-0063328-5
- PDF | Request permission
References
- Stephen Cole Kleene, Introduction to metamathematics, D. Van Nostrand Co., Inc., New York, N. Y., 1952. MR 0051790
- Raphael M. Robinson, Arithmetical definability of field elements, J. Symbolic Logic 16 (1951), 125–126. MR 42357, DOI 10.2307/2266685
- P. C. Rosenbloom, An elementary constructive proof of the fundamental theorem of algebra, Amer. Math. Monthly 52 (1945), 562–570. MR 14507, DOI 10.2307/2306105
- Ernst Specker, Nicht konstruktiv beweisbare Sätze der Analysis, J. Symbolic Logic 14 (1949), 145–158 (German). MR 31447, DOI 10.2307/2267043 A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proc. London Math. Soc. (2) vol. 42 (1936-37) pp. 230-265.
Bibliographic Information
- © Copyright 1954 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 5 (1954), 784-791
- MSC: Primary 02.0X
- DOI: https://doi.org/10.1090/S0002-9939-1954-0063328-5
- MathSciNet review: 0063328