On a subrecursive hierarchy and primitive recursive degrees
HTML articles powered by AMS MathViewer
- by Paul Axt
- Trans. Amer. Math. Soc. 92 (1959), 85-105
- DOI: https://doi.org/10.1090/S0002-9947-1959-0126377-3
- PDF | Request permission
References
- Stephen Cole Kleene, Introduction to metamathematics, D. Van Nostrand Co., Inc., New York, N. Y., 1952. MR 0051790
- S. C. Kleene, Arithmetical predicates and function quantifiers, Trans. Amer. Math. Soc. 79 (1955), 312–340. MR 70594, DOI 10.1090/S0002-9947-1955-0070594-4
- S. C. Kleene, On the forms of the predicates in the theory of constructive ordinals. II, Amer. J. Math. 77 (1955), 405–428. MR 70595, DOI 10.2307/2372632
- S. C. Kleene, Extension of an effectively generated class of functions by enumeration, Colloq. Math. 6 (1958), 67–78. MR 118672, DOI 10.4064/cm-6-1-67-78
- S. C. Kleene and Emil L. Post, The upper semi-lattice of degrees of recursive unsolvability, Ann. of Math. (2) 59 (1954), 379–407. MR 61078, DOI 10.2307/1969708
- Rózsa Péter, Rekursive Funktionen, Akademischer Verlag, Budapest, 1951 (German). MR 0044467
Bibliographic Information
- © Copyright 1959 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 92 (1959), 85-105
- MSC: Primary 02.70
- DOI: https://doi.org/10.1090/S0002-9947-1959-0126377-3
- MathSciNet review: 0126377