Book contents
- Frontmatter
- Contents
- Preface
- Original Numbering
- PART V HOD AND ITS LOCAL VERSIONS
- PART VI RECURSION THEORY
- Recursion theoretic papers. Introduction to Part VI
- On recursion in E and semi-Spector classes
- On Spector classes
- Trees and degrees
- Definable functions on degrees
- Π12 monotone inductive definitions
- Martin's conjecture, arithmetic equivalence, and countable Borel equivalence relations
- Bibliography
- References
On recursion in E and semi-Spector classes
from PART VI - RECURSION THEORY
Published online by Cambridge University Press: 05 December 2015
Book contents
- Frontmatter
- Contents
- Preface
- Original Numbering
- PART V HOD AND ITS LOCAL VERSIONS
- PART VI RECURSION THEORY
- Recursion theoretic papers. Introduction to Part VI
- On recursion in E and semi-Spector classes
- On Spector classes
- Trees and degrees
- Definable functions on degrees
- Π12 monotone inductive definitions
- Martin's conjecture, arithmetic equivalence, and countable Borel equivalence relations
- Bibliography
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Ordinal Definability and Recursion TheoryThe Cabal Seminar, Volume III, pp. 355 - 389Publisher: Cambridge University PressPrint publication year: 2016
References
[Acz72] Stage comparison theorems and game playing with inductive definitions, unpublished notes, 1972.
[BGM71] , , and The next admissible set, The Journal of Symbolic Logic, vol. 36 (1971), pp. 108–120.Google Scholar
[FH74] and Generalized recursion theory. Proceedings of the 1972 Oslo symposium, Studies in Logic and the Foundations of Mathematics, vol. 79, North-Holland, 1974.Google Scholar
[Gan60] Proof of Mostowski's conjecture, Bulletin de l'Académie Polonaise des Sciences, vol. 8 (1960), pp. 571–575.Google Scholar
[Gri71] Inductive definitions and computability, Transactions of the American Mathematical Society, vol. 158 (1971), pp. 309–317.Google Scholar
[HKS78] , , and A generalized Kleene-Moschovakis theorem, Proceedings of the American Mathematical Society, vol. 68 (1978), no. 2, pp. 209–213.Google Scholar
[Kec73C] The structure of envelopes: a survey of recursion theory in higher types, M.I.T. Logic Seminar notes, 1973.
[KM77] and Recursion in higher types, Handbook of mathematical logic(, editor), North- Holland, 1977, pp. 681–737.
[Kle59A] Quantification of number theoretic functions, Compositio Mathematica, vol. 14 (1959), pp. 23–40.Google Scholar
[Kle59B] Recursive functionals and quantifiers of finite types. I, Transactions of the American Mathematical Society, vol. 91 (1959), pp. 1–52.Google Scholar
[Kol78B] Recursion and induction in a quantifier, Ph.D. thesis, University of California, Los Angeles, 1978.Google Scholar
[Kol79] Recursion in a quantifier vs. elementary induction, The Journal of Symbolic Logic, vol. 44 (1979), no. 2, pp. 235–259.Google Scholar
[Kre61] Set theoretic problems suggested by the notion of potential totality, Infinitistic methods. proceedings of the symposium on foundations of mathematics. Warsaw, 2–9 September 1959, Pergamon, 1961, pp. 103–140.Google Scholar
[Mos69A] Abstract computability and invariant definability, The Journal of Symbolic Logic, vol. 34 (1969), pp. 605–633.Google Scholar
[Mos69B] Abstract first order computability II, Transactions of the American Mathematical Society, vol. 138 (1969), pp. 464–504.Google Scholar
[Mos70B] The Suslin-Kleene theorem for countable structures, Duke Mathematical Journal, vol. 37 (1970), no. 2, pp. 341–352.Google Scholar
[Mos74B] On nonmonotone inductive definability, Fundamenta Mathematicae, vol. 82 (1974), pp. 39–83.Google Scholar
[Mos74C] Structural characterizations of classes of relations, in Fenstad and Hinman [FH74], pp. 53–79.
[Mos77] On the basic notions in the theory of induction, Logic, foundations of mathematics and computability theory (Proceedings of the Fifth International Congress of Logic, Methodology and Philosophy of Science, University of Western Ontario, London, Ontario, 1975), Part I, University of Western Ontario Series in Philosophy of Science, vol. 9, Reidel, Dordrecht, 1977, pp. 207–236.Google Scholar
[Ric71] Recursively Mahlo ordinals and inductive definitions, Logic Colloquium ’69 ( and , editors), North-Holland, 1971, pp. 273–288.Google Scholar
[RA74] and Inductive definitions and reflecting properties of admissible ordinals, in Fenstad and Hinman [FH74], pp. 301–381.
[Spe60] Hyperarithmetical quantifiers, Fundamenta Mathematicae, vol. 48 (1960), pp. 313–320.Google Scholar
[Spe61] Inductively defined sets of natural numbers, Infinitistic methods, Pergamon, 1961, pp. 97–102.Google Scholar