Notation systems and an effective fixed point property
HTML articles powered by AMS MathViewer
- by Willaim E. Ritter PDF
- Proc. Amer. Math. Soc. 17 (1966), 390-395 Request permission
References
- 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
- 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
- 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
- Hartley Rogers Jr., On universal functions, Proc. Amer. Math. Soc. 16 (1965), 39–44. MR 171705, DOI 10.1090/S0002-9939-1965-0171705-4
Additional Information
- © Copyright 1966 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 17 (1966), 390-395
- MSC: Primary 02.70
- DOI: https://doi.org/10.1090/S0002-9939-1966-0201297-3
- MathSciNet review: 0201297