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
Recursion theoretic papers. Introduction to Part VI
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. 349 - 354Publisher: Cambridge University PressPrint publication year: 2016
References
[Coo96] A characterisation of the jumps of minimal degrees below 0′, Computability, enumerability, unsolvability, London Mathematical Society Lecture Note Series, vol. 224, Cambridge University Press, Cambridge, 1996, pp. 81–92.Google Scholar
[CLY05] , , and Properly Σ2 minimal degrees and 0” complementation, Mathematical Logic Quarterly, vol. 51 (2005), no. 3, pp. 274–276.Google Scholar
[GN84] and Effective cofinalities and admissibility in E-recursion, Fundamenta Mathematicae, vol. 123 (1984), no. 3, pp. 151–161.Google Scholar
[Kec78C] On Spector classes, this volume, originally published in Kechris and Moschovakis [Cabal i], pp. 245–277.
[Cabal ii] , , and Cabal seminar 77–79, Lecture Notes in Mathematics, no. 839, Berlin, Springer, 1981.Google Scholar
[Cabal iv] , , and Cabal seminar 81–85, Lecture Notes in Mathematics, no. 1333, Berlin, Springer, 1988.Google Scholar
[Cabal i] and Cabal seminar 76–77, Lecture Notes in Mathematics, no. 689, Berlin, Springer, 1978.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
[Kle63] Recursive functionals and quantifiers of finite types. II, Transactions of the American Mathematical Society, vol. 108 (1963), pp. 106–142.Google Scholar
[Kol78A] On recursion in E and semi-Spector classes, this volume, originally published in Kechris and Moschovakis [Cabal i], pp. 209–243.
[LL76] and Countable initial segments of the degrees of unsolvability, The Journal of Symbolic Logic, vol. 41 (1976), no. 2, pp. 289–300.Google Scholar
[Ler83] Degrees of unsolvability, Perspectives in Mathematical Logic, Springer-Verlag, 1983.Google Scholar
[MSS11] , , and Martin's conjecture, arithmetic equivalence, and countable Borel equivalence relations, Preprint, 2011.
[Mar81] Π12 monotone inductive definitions, this volume, originally published in Kechris et al. [Cabal ii], pp. 215–233.
[Mos09] Descriptive set theory, second ed., Mathematical Surveys and Monographs, vol. 155, American Mathematical Society, 2009.Google Scholar
[NS80A] and Reducibility orderings: theories, definability and automorphisms, Annals of Mathematical Logic, vol. 18 (1980), no. 1, pp. 61–89.Google Scholar
[NS80B] and Second order logic and first order theories of reducibility orderings, The Kleene Symposium (Proc. Sympos., Univ. Wisconsin, Madison, Wis., 1978) (Amsterdam) (, , and , editors), Studies in Logic and the Foundations of Mathematics, vol. 101, North-Holland, 1980, pp. 181–200.Google Scholar
[Nor78] Set recursion, Generalized recursion theory, II (Proc. Second Sympos., Univ. Oslo, Oslo, 1977), Studies in Logic and the Foundations of Mathematics, vol. 94, North-Holland, 1978, pp. 303–320.Google Scholar
[Odi81] Trees and degrees, this volume, originally published in Kechris et al. [Cabal ii], pp. 235–271.
[Odi89] Classical recursion theory, Studies in Logic and the Foundations of Mathematics, vol. 125, North-Holland, 1989.Google Scholar
[Odi99] Classical recursion theory. Vol. II, Studies in Logic and the Foundations of Mathematics, vol. 143, North-Holland, 1999.Google Scholar
[Sac90] Higher recursion theory, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1990.Google Scholar
[SS87] and Inadmissible forcing, Advances in Mathematics, vol. 66 (1987), no. 1, pp. 1–30.Google Scholar
[SS99] and Defining the Turing jump, Mathematical Research Letters, vol. 6 (1999), no. 5–6, pp. 711–722.Google Scholar
[Sim77] First-order theory of the degrees of recursive unsolvability, Annals of Mathematics, vol. 105 (1977), no. 1, pp. 121–139.Google Scholar
[Sla85] Reflection and forcing in E-recursion theory, Annals of Pure and Applied Logic, vol. 29 (1985), no. 1, pp. 79–106.Google Scholar
[Sla91] Degree structures, Proceedings of the International Congress of Mathematicians, Vol. I, II (Kyoto, 1990) (Tokyo), Mathematical Society of Japan, 1991, pp. 303–316.Google Scholar
[SS88] and Definable functions on degrees, this volume, originally published in Kechris et al. [Cabal iv], pp. 37–55.
[Spe56] On degrees of recursive unsolvability, Annals of Mathematics, vol. 65 (1956), pp. 581–592.Google Scholar
[Ste82A] A classification of jump operators, The Journal of Symbolic Logic, vol. 47 (1982), no. 2, pp. 347–358.Google Scholar