Reducing ordinal recursion
HTML articles powered by AMS MathViewer
- by C. F. Kent
- Proc. Amer. Math. Soc. 22 (1969), 690-696
- DOI: https://doi.org/10.1090/S0002-9939-1969-0265156-5
- PDF | Request permission
References
- D. Anderson, Nested ordinal recursive functions and a subrecursive hierarchy, Ph. D. Thesis, Duke University, Durham, N. C., 1961.
- Stephen Cole Kleene, Introduction to metamathematics, D. Van Nostrand Co., Inc., New York, 1952. MR 51790
- Shih-chao Liu, A theorem on general recursive functions, Proc. Amer. Math. Soc. 11 (1960), 184–187. MR 130175, DOI 10.1090/S0002-9939-1960-0130175-8 J. Myhill, A stumbling block in constructive mathematics, J. Symbolic Logic 18 (1953), 190-191.
- Rózsa Péter, Rekursive Funktionen, Akademischer Verlag, Budapest, 1951 (German). MR 44467
- N. A. Routledge, Ordinal recursion, Proc. Cambridge Philos. Soc. 49 (1953), 175–182. MR 53046, DOI 10.1017/s0305004100028255
- W. W. Tait, Nested recursion, Math. Ann. 143 (1961), 236–250. MR 124214, DOI 10.1007/BF01342980
Bibliographic Information
- © Copyright 1969 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 22 (1969), 690-696
- MSC: Primary 02.70
- DOI: https://doi.org/10.1090/S0002-9939-1969-0265156-5
- MathSciNet review: 0265156