Abstract first order computability. I, II
HTML articles powered by AMS MathViewer
- by Yiannis N. Moschovakis
- Trans. Amer. Math. Soc. 138 (1969), 427-464
- DOI: https://doi.org/10.1090/S0002-9947-1969-0244045-0
- PDF | Request permission
References
- R. Fraïssé, Une notion de récursivité relative, Infinitistic methods, Proc. Sympos. Foundations of Math., 1959, New York, 1961, pp. 323-328.
- R. O. Gandy, Proof of Mostowski’s conjecture, Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. 8 (1960), 571–575 (English, with Russian summary). MR 126383 R. O. Gandy, General recursive functionals of finite type and hierarchies of functions, mimeographed copy of paper presented at the Symposium on Mathematical Logic, University of Clermont-Ferrand, June 1962.
- Stephen Cole Kleene, Introduction to metamathematics, D. Van Nostrand Co., Inc., New York, N. Y., 1952. MR 0051790
- 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, Recursive functionals and quantifiers of finite types. I, Trans. Amer. Math. Soc. 91 (1959), 1–52. MR 102480, DOI 10.1090/S0002-9947-1959-0102480-9
- S. C. Kleene, Recursive functionals and quantifiers of finite types. II, Trans. Amer. Math. Soc. 108 (1963), 106–142. MR 153557, DOI 10.1090/S0002-9947-1963-0153557-4
- G. Kreisel, Model-theoretic invariants: Applications to recursive and hyperarithmetic operations, Theory of Models (Proc. 1963 Internat. Sympos. Berkeley), North-Holland, Amsterdam, 1965, pp. 190–205. MR 0199107
- G. Kreisel and Gerald E. Sacks, Metarecursive sets, J. Symbolic Logic 30 (1965), 318–338. MR 213233, DOI 10.2307/2269621 Saul Kripke, Transfinite recursions on admissible ordinals. I, II and Admissible ordinals and the analytic hierarchy, Abstracts of papers presented at the April 1964 meeting of the Assoc. for Symbolic Logic in New York, J. Symbolic Logic 29 (1964), 161-162.
- Daniel Lacombe, Deux généralisations de la notion de récursivité, C. R. Acad. Sci. Paris 258 (1964), 3141–3143 (French). MR 160718
- Daniel Lacombe, Deux généralisations de la notion de récursivité relative, C. R. Acad. Sci. Paris 258 (1964), 3410–3413 (French). MR 160719 W. M. Lambert, A notion of effectiveness in arbitrary structures, (to appear).
- Azriel Lévy, A hierarchy of formulas in set theory, Mem. Amer. Math. Soc. 57 (1965), 76. MR 189983
- M. Machover, The theory of transfinite recursion, Bull. Amer. Math. Soc. 67 (1961), 575–578. MR 142448, DOI 10.1090/S0002-9904-1961-10696-4
- R. Montague, Recursion theory as a branch of model theory, Logic, Methodology and Philos. Sci. III (Proc. Third Internat. Congr., Amsterdam, 1967) North-Holland, Amsterdam, 1968, pp. 63–86. MR 0272624
- Yiannis N. Moschovakis, Hyperanalytic predicates, Trans. Amer. Math. Soc. 129 (1967), 249–282. MR 236010, DOI 10.1090/S0002-9947-1967-0236010-2 —, Generalization of the theory of recursive and hyperarithmetic relations, (in preparation). —, Post’s theorem in the analytic hierarchy, (in preparation). R. Platek, Foundations of recursion theory, Ph.D. Thesis, Stanford Univ., Stanford, Calif., 1966.
- Clifford Spector, Recursive well-orderings, J. Symbolic Logic 20 (1955), 151–163. MR 74347, DOI 10.2307/2266902
- C. Spector, Hyperarithmetical quantifiers, Fund. Math. 48 (1959/60), 313–320. MR 120147, DOI 10.4064/fm-48-3-313-320
- Gaisi Takeuti, On the recursive functions of ordinal numbers, J. Math. Soc. Japan 12 (1960), 119–128. MR 124207, DOI 10.2969/jmsj/01220119
- Hao Wang, Alternative proof of a theorem of Kleene, J. Symbolic Logic 23 (1958), 250. MR 103820, DOI 10.2307/2964282
Bibliographic Information
- © Copyright 1969 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 138 (1969), 427-464
- MSC: Primary 02.70
- DOI: https://doi.org/10.1090/S0002-9947-1969-0244045-0
- MathSciNet review: 0244045