A recursion-theoretic characterization of the ramified analytical hierarchy
HTML articles powered by AMS MathViewer
- by Richard Boyd, Gustav Hensel and Hilary Putnam PDF
- Trans. Amer. Math. Soc. 141 (1969), 37-62 Request permission
References
- Paul J. Cohen, A minimal model for set theory, Bull. Amer. Math. Soc. 69 (1963), 537–540. MR 150036, DOI 10.1090/S0002-9904-1963-10989-1
- Martin Davis, Computability and unsolvability, McGraw-Hill Series in Information Processing and Computers, McGraw-Hill Book Co., Inc., New York-Toronto-London, 1958. MR 0124208
- H. B. Enderton, Hierarchies in recursive function theory, Trans. Amer. Math. Soc. 111 (1964), 457–471. MR 159755, DOI 10.1090/S0002-9947-1964-0159755-9 R. Gandy and H. Putnam, A minimal $\beta$-model for analysis, (to appear).
- Kurt Gödel, The Consistency of the Continuum Hypothesis, Annals of Mathematics Studies, No. 3, Princeton University Press, Princeton, N. J., 1940. MR 0002514, DOI 10.1515/9781400881635
- Gustav Hensel and Hilary Putnam, On the notational independence of various hierarchies of degrees of unsolvability, J. Symbolic Logic 30 (1965), 69–86. MR 229522, DOI 10.2307/2270584
- S. C. Kleene, Quantification of number-theoretic functions, Compositio Math. 14 (1959), 23–40. MR 103822
- 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
- Clifford Spector, Recursive well-orderings, J. Symbolic Logic 20 (1955), 151–163. MR 74347, DOI 10.2307/2266902
Additional Information
- © Copyright 1969 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 141 (1969), 37-62
- MSC: Primary 02.77
- DOI: https://doi.org/10.1090/S0002-9947-1969-0242673-X
- MathSciNet review: 0242673