Recursive functions over well ordered partial orderings
HTML articles powered by AMS MathViewer
- by Hartley Rogers
- Proc. Amer. Math. Soc. 10 (1959), 847-853
- DOI: https://doi.org/10.1090/S0002-9939-1959-0111685-8
- PDF | Request permission
References
- 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 S. Kleene, On notation for ordinal numbers, J. Symb. Logic vol. 3 (1938) pp. 150-155.
- 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
- S. C. Kleene, Hierarchies of number-theoretic predicates, Bull. Amer. Math. Soc. 61 (1955), 193–213. MR 70593, DOI 10.1090/S0002-9904-1955-09896-3 E. Zermelo, Grundlagen einer allgemeinen Theorie der mathematischen Satzsysteme, Fund. Math. vol. 25 (1935) pp. 136-146.
Bibliographic Information
- © Copyright 1959 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 10 (1959), 847-853
- MSC: Primary 02.00
- DOI: https://doi.org/10.1090/S0002-9939-1959-0111685-8
- MathSciNet review: 0111685