Isomorphism types of index sets of partial recursive functions
HTML articles powered by AMS MathViewer
- by Louise Hay PDF
- Proc. Amer. Math. Soc. 17 (1966), 106-110 Request permission
References
- J. C. E. Dekker and J. Myhill, Some theorems on classes of recursively enumerable sets, Trans. Amer. Math. Soc. 89 (1958), 25–59. MR 97310, DOI 10.1090/S0002-9947-1958-0097310-7
- Louise Hay, On creative sets and indices of partial recursive functions, Trans. Amer. Math. Soc. 120 (1965), 359–367. MR 195724, DOI 10.1090/S0002-9947-1965-0195724-1
- Stephen Cole Kleene, Introduction to metamathematics, D. Van Nostrand Co., Inc., New York, N. Y., 1952. MR 0051790
- John Myhill, Creative sets, Z. Math. Logik Grundlagen Math. 1 (1955), 97–108. MR 71379, DOI 10.1002/malq.19550010205
- Hartley Rogers Jr., Gödel numberings of partial recursive functions, J. Symbolic Logic 23 (1958), 331–341. MR 103821, DOI 10.2307/2964292
- Norman Shapiro, Degrees of computability, Trans. Amer. Math. Soc. 82 (1956), 281–299. MR 85187, DOI 10.1090/S0002-9947-1956-0085187-3
- Raymond M. Smullyan, Theory of formal systems, Annals of Mathematics Studies, No. 47, Princeton University Press, Princeton, N.J., 1961. MR 0121300
Additional Information
- © Copyright 1966 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 17 (1966), 106-110
- MSC: Primary 02.70
- DOI: https://doi.org/10.1090/S0002-9939-1966-0186541-3
- MathSciNet review: 0186541