Ordinal Definability and Recursion Theory

Buy print or eBook[Opens in a new window] The Cabal Seminar, Volume III

Published online by Cambridge University Press:
**
05 December 2015
**

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. 521 - 535Publisher: Cambridge University PressPrint publication year: 2016

[Aan74]

Inductive definitions and their closure ordinals, in Fenstad and Hinman [FH74], pp. 207–220.[Acz72] 1972.

Stage comparison theorems and game playing with inductive definitions, unpublished notes, [Acz75] Proceedings of the Third Scandinavian Logic Symposium (Stig Kanger, editor), Studies in Logic and the Foundations of Mathematics, vol. 82, North-Holland, 1975, pp. 1–14.Google Scholar

Games, quantifiers and inductive definitions, [Add59] Some consequences of the axiom of constructibility, Fundamenta Mathematicae, vol. 46 (1959), pp. 337–357.Google Scholar

[AM68] Some consequences of the axiom of definable determinateness, Proceedings of the National Academy of Sciences of the United States of America, (1968), no. 59, pp. 708–712.Google Scholar

and [ACH01] Conjugacy equivalence relation on subgroups, Fundamenta Mathematicae, vol. 167 (2001), no. 3, pp. 189–212.Google Scholar

, , and [Bal86] Between strong and superstrong, The Journal of Symbolic Logic, vol. 51 (1986), no. 3, pp. 547–559.

[Bar76] Admissible sets and structures, Springer-Verlag, 1976.

[BGM71] The Journal of Symbolic Logic, vol. 36 (1971), pp. 108–120.

, , and The next admissible set, [BMS84] AMS-IMS-SIAM joint summer research conference held in Boulder, Colo., June 19–25, 1983, Contemporary Mathematics, vol. 31, Amer. Math. Soc., Providence, RI, 1984.Google Scholar

, , and Axiomatic set theory. Proceedings of the [Bec]

Pointclass jumps, Manuscript.[Bec78]

Partially playful universes, this volume, originally published in Kechris and Moschovakis [Cabal i], pp. 55–90.[Bec80] Thin collections of sets of projective ordinals and analogs of L, Annals of Mathematical Logic, vol. 19 (1980), pp. 205–241.Google Scholar

[Bec81] AD and the supercompactness of ℵ1, The Journal of Symbolic Logic, vol. 46 (1981), pp. 822–841.Google Scholar

[Bec88] A characterization of jump operators, The Journal of Symbolic Logic, vol. 53 (1988), no. 3, pp. 708–728.Google Scholar

[BK84]

and Sets of ordinals constructible from trees and the third Victoria Delfino problem, in Baumgartner et al. [BMS84], pp. 13–29.[BM81]

and Measurable cardinals in playful models, this volume, originally published in Kechris et al. [Cabal ii], pp. 203–214.[BJ07] Advances in logic, Contemporary Mathematics, vol. 425, American Mathematical Society, Providence, RI, 2007, pp. 113–126.Google Scholar

and Borel boundedness and the lattice rounding property, [BM75] Remarks on invariant descriptive set theory, Fundamenta Mathematicae, vol. 90 (1975), pp. 53–75.Google Scholar

and [CWY10] The strength of the projective Martin conjecture, Fundamenta Mathematicae, vol. 207 (2010), no. 1, pp. 21–27.Google Scholar

, , and [CY09] AΠ11 -uniformization principle for reals, Transactions of the American Mathematical Society, vol. 361 (2009), no. 8, pp. 4233–4245.Google Scholar

and [Coo73] Minimal degrees and the jump operator, The Journal of Symbolic Logic, vol. 38 (1973), pp. 249–271.Google Scholar

[Coo96] Computability, enumerability, unsolvability, London Mathematical Society Lecture Note Series, vol. 224, Cambridge University Press, Cambridge, 1996, pp. 81–92.Google Scholar

A characterisation of the jumps of minimal degrees below 0', [CLY05] Properly Σ2 minimal degrees and 0'' complementation, Mathematical Logic Quarterly, vol. 51 (2005), no. 3, pp. 274–276.Google Scholar

, , and [Cra85] 1985.

Explicit formulas for the jump of Q-degrees, Ph.D. thesis, California Institute of Technology, [Dod80] 1980.

Strong cardinals, unpublished, [DJ81] Annals of Mathematical Logic, vol. 20 (1981), no. 1, pp. 43–75.

and The core model, [DJK94] The structure of hyperfinite Borel equivalence relations, Transactions of the American Mathematical Society, vol. 341 (1994), no. 1, pp. 193–225.Google Scholar

, , and [DK00] Computability theory and its applications (Boulder, CO, 1999), Contemporary Mathematics, vol. 257, American Mathematical Society, Providence, RI, 2000, pp. 83–94.Google Scholar

and How many Turing degrees are there?, [DS97] There is no degree invariant half-jump, Proceedings of the American Mathematical Society, vol. 125 (1997), no. 10, pp. 3033–3037.Google Scholar

and [Dra74] Set theory: An introduction to large cardinals, Studies in Logic and the Foundations of Mathematics, vol. 76, North-Holland, 1974.Google Scholar

[DuB90] The equivalence of determinancy and iterated sharps, The Journal of Symbolic Logic, vol. 55 (1990), no. 2, pp. 502–525.Google Scholar

[Eps75] Minimal degrees of unsolvability and the full approximation construction, vol. 3, Memoirs of the American Mathematical Society, no. 162, American Mathematical Society, 1975. [Eps79] Degrees of unsolvability: Structure and theory, Lecture Notes, vol. 759, Springer, 1979.Google Scholar

[Far]

Accepted for publication in GroupsThe extender algebra and Σ21 -absoluteness, to appear.[FM77] Ergodic equivalence relations, cohomology, and von Neumann algebras. I, Transactions of the American Mathematical Society, vol. 234 (1977), no. 2, pp. 289–324.Google Scholar

and [FH74] Generalized recursion theory. Proceedings of the 1972 Oslo symposium, Studies in Logic and the Foundations of Mathematics, vol. 79, North-Holland, 1974.Google Scholar

and [FMS88] Martin's maximum, saturated ideals and nonregular ultrafilters. I, Annals of Mathematics, vol. 127 (1988), no. 1, pp. 1–47.Google Scholar

, , and [Gan60] Proof of Mostowski's conjecture, Bulletin de l'Académie Polonaise des Sciences, vol. 8 (1960), pp. 571–575.Google Scholar

, , and [Gan67] General recursive functionals of finite type and hierarchies of functions, Annales de la Faculté des Sciences de l'Université de Clermont. Série Mathématiques, vol. 35 (1967), no. 4, pp. 5–24.Google Scholar

, , and [Gre78] Determinacy and the existence of large measurable cardinals, Ph.D. thesis, University of California, Berkeley, 1978.Google Scholar

[GN84] Effective cofinalities and admissibility in E-recursion, Fundamenta Mathematicae, vol. 123 (1984), no. 3, pp. 151–161.Google Scholar

and [Gri71] Inductive definitions and computability, Transactions of the American Mathematical Society, vol. 158 (1971), pp. 309–317.Google Scholar

[GH76] Characterizing C3 (the largest countable Π13 set), Proceedings of the American Mathematical Society, vol. 57 (1976), no. 1, pp. 127–129.Google Scholar

and [Har73] 1973.

Contributions to recursion theory in higher types, Ph.D. thesis, MIT, [Har75] 1975.

Monotone quantifers and inductive definablity, unpublished, April [Har78] Analytic determinacy and 0#, The Journal of Symbolic Logic, vol. 43 (1978), no. 4, pp. 685–693.Google Scholar

[HK75] On characterizing Spector classes, The Journal of Symbolic Logic, vol. 40 (1975), no. 1, pp. 19–24.Google Scholar

and [HK81] On the determinacy of games on ordinals, Annals of Mathematical Logic, vol. 20 (1981), pp. 109–154.Google Scholar

and [HKS78] A generalized Kleene-Moschovakis theorem, Proceedings of the American Mathematical Society, vol. 68 (1978), no. 2, pp. 209–213.Google Scholar

, , and [HS79] Logic Colloquium ’78 (Mons, 1978), Studies in Logic and the Foundations of Mathematics, vol. 97, North-Holland, Amsterdam, 1979, pp. 247–264.Google Scholar

and Equivalence relations, projective and beyond, [Har66] Some applications of recursive pseudo-well orderings, Ph.D. thesis, Stanford University, 1966.Google Scholar

[HS91] Jump embeddings in the Turing degrees, The Journal of Symbolic Logic, vol. 56 (1991), no. 2, pp. 563–591.Google Scholar

and [Hjo96] Variations of the Martin-Solovay tree, The Journal of Symbolic Logic, vol. 61 (1996), no. 1, pp. 40–51.Google Scholar

[Hjo01] A boundedness lemma for iterations, The Journal of Symbolic Logic, vol. 66 (2001), no. 3, pp. 1058–1072.Google Scholar

[Hug69] Initial segments of Turing degrees, Proceedings of the London Mathematical Society. Third Series, vol. 19 (1969), pp. 1–16.Google Scholar

[Jac08]

Suslin cardinals, partition properties, homogeneity. Introduction to Part II, in Kechris et al. [Cabal I], pp. 273–313.[JKL02] Countable Borel equivalence relations, Journal of Mathematical Logic, vol. 2 (2002), no. 1, pp. 1–80.Google Scholar

, , and [Jec71] Lectures in set theory, with particular emphasis on the method of forcing, Lecture Notes in Mathematics, Vol. 217, Springer-Verlag, Berlin, 1971.Google Scholar

[Joc69A] The degrees of bi-immune sets, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 15 (1969), pp. 135–140.Google Scholar

[Joc69B] Relationships betwewen reducibilities, Transactions of the American Mathematical Society, vol. 142 (1969), pp. 229–237.Google Scholar

[Joc72] Ramsey's theorem and recursion theory, The Journal of Symbolic Logic, vol. 37 (1972), pp. 268–280.Google Scholar

[Joc77] Simple proofs of some theorems on high degrees, Canadian Journal of Mathematics, vol. 29 (1977), pp. 1072–1080.Google Scholar

[JP78] Double jumps of minimal degrees, The Journal of Symbolic Logic, vol. 43 (1978), pp. 715–724.Google Scholar

and [JP81] Automorphism bases for the degrees of unsolvability, Israel Journal of Mathematics, vol. 40 (1981), no. 2, pp. 150–164.Google Scholar

and [JS85] REA operators, r.e. degrees, and minimal covers, Proceedings of Symposia in Pure Mathematics, vol. 42 (1985), pp. 3–11.Google Scholar

and [JS75] A degree-theoretic definition of the ramified analytic hierarchy, Annals of Mathematical Logic, vol. 10 (1975), pp. 1–32.Google Scholar

and [JS72A]

and Degrees of members of Π01 classes, Pacific Journal of Mathematics, vol. 40 (1972), pp. 605– 616.[JS72B] classes and degrees of theories, Transactions of the American Mathematical Society, vol. 173 (1972), pp. 33–56.Google Scholar

and Π01[JJW92] Set theory of the continuum, MSRI publications, vol. 26, Springer-Verlag, 1992.Google Scholar

, , and and

[Kec72] 1972.

Projective ordinals and countable analytical sets, Ph.D. thesis, UCLA, [Kec73A] 1973, M.I.T.

Lecture notes on descriptive set theory, [Kec73B] Measure and category in effective descriptive set theory, Annals of Mathematical Logic, vol. 5 (1973), no. 4, pp. 337–384.Google Scholar

[Kec73C] 1973.

The structure of envelopes: a survey of recursion theory in higher types, M.I.T. Logic Seminar notes, [Kec75A] Countable ordinals and the analytical hierarchy. I, Pacific Journal of Mathematics, vol. 60 (1975), no. 1, pp. 223–227.Google Scholar

[Kec75B] The theory of countable analytical sets, Transactions of the American Mathematical Society, vol. 202 (1975), pp. 259–297.Google Scholar

[Kec76] 1976.

Uncountable ordinals and the analytical hierarchy, circulated notes, July [Kec77] On a notion of smallness for subsets of the Baire space, Transactions of the American Mathematical Society, vol. 229 (1977), pp. 191–207.Google Scholar

[Kec78A]

AD and projective ordinals, in Kechris and Moschovakis [Cabal i], pp. 91–132, reprinted in [Cabal II], pp. 304–345.[Kec78B] Countable ordinals and the analytical hierarchy. II, Annals of Mathematical Logic, vol. 15 (1978), no. 3, pp. 193–223.Google Scholar

[Kec78C]

On Spector classes, this volume, originally published in Kechris and Moschovakis [Cabal i], pp. 245–277.[Kec80] The Kleene Symposium (Proc. Sympos., Univ. Wisconsin, Madison, Wis., 1978) ( , , and , editors), Stud. Logic Foundations Math., vol. 101, North-Holland, Amsterdam, 1980, pp. 149–166.Google Scholar

Recent advances in the theory of higher level projective sets, [Kec81]

Homogeneous trees and projective scales, in Kechris et al. [Cabal ii], pp. 33–74, reprinted in [Cabal II], pp. 270–303.[Kec84] The axiom of determinancy implies dependent choices in L(ℝ), The Journal of Symbolic Logic, vol. 49 (1984), no. 1, pp. 161–173.Google Scholar

[Kec91] Amenable equivalence relations and Turing degrees, The Journal of Symbolic Logic, vol. 56 (1991), no. 1, pp. 182–194.Google Scholar

[Kec92]

The structure of Borel equivalence relations in Polish spaces, in Judah et al. [JJW92], pp. 89–102.[Kec95] Classical descriptive set theory, Graduate Texts in Mathematics, vol. 156, Springer, 1995.Google Scholar

[KKMW81]

, , , and The axiom of determinacy, strong partition properties, and nonsingular measures, in Kechris et al. [Cabal ii], pp. 75–99, reprinted in [Cabal I], pp. 333–354.[Cabal I] Games, scales, and Suslin cardinals: the Cabal seminar, volume I, Lecture Notes in Logic, vol. 31, Cambridge University Press, 2008.Google Scholar

, , and [Cabal II] Wadge degrees and projective ordinals: the Cabal seminar, volume II, Lecture Notes in Logic, vol. 37, Cambridge University Press, 2012.Google Scholar

, , and [KM78] On the theory of Π13 sets of reals, Bulletin of the American Mathematical Society, vol. 84 (1978), no. 1, pp. 149–151.Google Scholar

and [KM16] 2016, this volume.

and On the theory of Π13sets of reals, II, [Cabal ii] Berlin, Springer, 1981.

, , and Cabal seminar 77–79, Lecture Notes in Mathematics, no. 839, [Cabal iii] Cabal seminar79–81, Lecture Notes in Mathematics, no. 1019, Berlin, Springer, 1983.Google Scholar

, , and [KMS83]

, , and Introduction to Q-theory, this volume, originally published in Kechris et al. [Cabal iii], pp. 199–282.[Cabal iv] Cabal seminar81–85, Lecture Notes in Mathematics, no. 1333, Berlin, Springer, 1988.Google Scholar

, , and [KM72] Two theorems about projective sets, Israel Journal of Mathematics, vol. 12 (1972), pp. 391– 399.

and and Recursion in higher types,

[Cabal i] Cabal seminar76–77, Lecture Notes in Mathematics, no. 689, Berlin, Springer, 1978.Google Scholar

and [KM78B]

and Notes on the theory of scales, in Cabal Seminar76–77 [Cabal i], pp. 1–53, reprinted in [Cabal I], pp. 28–74.[KS85] On the relative consistency strength of determinacy hypotheses, Transactions of the American Mathematical Society, vol. 290 (1985), no. 1, pp. 179–211.Google Scholar

and [KW80] 1980, reprinted in [Cabal I], pp. 379–397.

and Generic codes for uncountable ordinals, partition properties, and elementary embeddings, circulated manuscript, [KW83] Equivalence of partition properties and determinacy, Proceedings of the National Academy of Sciences of the United States of America, vol. 80 (1983), no. 6 i., pp. 1783–1786.Google Scholar

and [KW08]

and The equivalence of partition properties and determinacy, in Kechris et al. [Cabal I], pp. 355–378.[Ket11] Set theory and its applications, Contemporary Mathematics, vol. 533, American Mathematical Society, Providence, RI, 2011, pp. 71–105.Google Scholar

More structural consequences of AD, [Kle55A] Arithmetical predicates and function quantifiers, Transactions of the American Mathematical Society, vol. 79 (1955), pp. 312–340.Google Scholar

[Kle55B] Hierarchies of number-theoretic predicates, Bulletin of the American Mathematical Society, vol. 61 (1955), pp. 193–213.Google Scholar

[Kle55C] On the forms of the predicates in the theory of constructive ordinals. II, American Journal of Mathematics, vol. 77 (1955), pp. 405–428.Google Scholar

[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

[Kle63] Recursive functionals and quantifiers of finite types. II, Transactions of the American Mathematical Society, vol. 108 (1963), pp. 106–142.Google Scholar

[KP54] The upper-semilattice of degrees of recursive unsolvability, Annals of Mathematics, vol. 59 (1954), pp. 379–407.Google Scholar

and [KW10]

and Large cardinals from determinacy, in Kanamori and Foreman [KF10], pp. 1951–2119.[Kol78A]

On recursion in E and semi-Spector classes, this volume, originally published in Kechris and Moschovakis [Cabal i], pp. 209–243.[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] Infinitistic methods. proceedings of the symposium on foundations of mathematics. Warsaw, 2–9 September 1959, Pergamon, 1961, pp. 103–140.Google Scholar

Set theoretic problems suggested by the notion of potential totality, [Kun70] Some applications of iterated ultrapowers in set theory, Annals of Mathematical Logic, vol. 1 (1970), pp. 179–227.Google Scholar

[Kun71A] 1971.

On, circulated note, August [Kun71B] Logic Colloquium ’69 (Proc. Summer School and Colloq., Manchester, 1969) ( and , editors), North-Holland, Amsterdam, 1971, pp. 107–110.Google Scholar

On the GCH at measurable cardinals, [Lac68] Distributive initial segments of the degrees of unsolvability, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 14 (1968), pp. 457–472.Google Scholar

[Lac71] Solution to a problem of Spector, Canadian Journal of Mathematics, vol. 23 (1971), pp. 247–256.Google Scholar

[Lac75] Uniform enumeration operations, The Journal of Symbolic Logic, vol. 40 (1975), no. 3, pp. 401–409.Google Scholar

[LL76] Countable initial segments of the degrees of unsolvability, The Journal of Symbolic Logic, vol. 41 (1976), no. 2, pp. 289–300.Google Scholar

and [Lad73] A completely mitotic non recursive r.e. set, Transactions of the American Mathematical Society, vol. 184 (1973), pp. 479–507.Google Scholar

[Ler69] Some non distributive lattices as initial segments of the degrees of unsolvability, The Journal of Symbolic Logic, vol. 34 (1969), pp. 85–98.Google Scholar

[Ler71] Initial segments of the degrees of unsolvability, Annals of Mathematics, vol. 93 (1971), pp. 365–389.Google Scholar

[Ler83] Degrees of unsolvability, Perspectives in Mathematical Logic, Springer-Verlag, 1983.Google Scholar

[Lew05] New computational paradigms ( , , and , editors), Lecture Notes in Computer Science, vol. 3526, Springer, 2005, pp. 15–63.Google Scholar

On a question of Sacks – a partial solution on the positive side, [Man71] Some contrasts between degrees and the arithmetical hierarchy, The Journal of Symbolic Logic, vol. 36 (1971), pp. 301–304.Google Scholar

[Man70] Perfect subsets of definable sets of real numbers, Pacific Journal of Mathematics, vol. 35 (1970), no. 2, pp. 451–457.Google Scholar

[Mar12] Recursion theory and countable Borel equivalence relations, Ph.D. thesis, Department of Mathematics, University of California, Berkeley, 2012.Google Scholar

[Mar14] 2014), Preprint.

Uniformity, universality, and recursion theory, ([MSS11] 2011.

, , and Martin's conjecture, arithmetic equivalence, and countable Borel equivalence relations, Preprint, [Mar]

Borel and projective games, in preparation.[Mar68] The axiom of determinateness and reduction principles in the analytical hierarchy, Bulletin of the American Mathematical Society, vol. 74 (1968), pp. 687–689.Google Scholar

[Mar70] Measurable cardinals and analytic games, Fundamenta Mathematicae, vol. 66 (1970), pp. 287–291.Google Scholar

[Mar73] 1973.

Δ12ndeterminacy impliesn determinacy, circulated note, [Mar75] Borel determinacy, Annals of Mathematics, vol. 102 (1975), no. 2, pp. 363–371.Google Scholar

[Mar76] Proof of a conjecture of Friedman, Proceedings of the American Mathematical Society, vol. 55 (1976), no. 1, p. 129.Google Scholar

[Mar80] Proceedings of the International Congress of Mathematicatians, Helsinki 1978 (Helsinki) ( , editor), Academia Scientiarum Fennica, 1980, pp. 269–273.Google Scholar

Infinite games, [Mar81]

Π12monotone inductive definitions, this volume, originally published in Kechris et al. [Cabal ii], pp. 215–233.[Mar83]

The largest countable this, that, and the other, in Kechris et al. [Cabal iii], pp. 97–106, reprinted in [Cabal I], pp. 121–129.[Mar12]

Projective sets and cardinal numbers: some questions related to the continuum problem, in Kechris et al. [Cabal II], pp. 484–508.[MM68] The degrees of hyperimmune sets, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 14 (1968), pp. 159–166.Google Scholar

and [MMS82] The extent of definable scales, Bulletin of the American Mathematical Society, vol. 6 (1982), pp. 435–440.Google Scholar

, , and [MS69] A basis theorem for S13 sets of reals, Annals of Mathematics, vol. 89 (1969), pp. 138–160.Google Scholar

and [MS83]

and The extent of scales in L(ℝ), in Kechris et al. [Cabal iii], pp. 86–96, reprinted in [Cabal I], pp. 110–120.[MS89] A proof of projective determinacy, Journal of the American Mathematical Society, vol. 2 (1989), pp. 71–125.Google Scholar

and [MaS94] Iteration trees, Journal of the American Mathematical Society, vol. 7 (1994), no. 1, pp. 1–73.Google Scholar

and [Mil81] Logic Year 1979–80. Proceedings of the Logic Year and of the Conference on Mathematical Logic, November 11–13, 1979, at Storrs ( , , and , editors), Lecture Notes in Mathematics, vol. 859, Springer, 1981, pp. 230–245.Google Scholar

High recursively enumerable degrees and the anticupping property, [Mit74] Sets constructible from sequences of ultrafilters, The Journal of Symbolic Logic, vol. 39 (1974), pp. 57–66.Google Scholar

[Mit79] Logic Colloquium ’78 (Mons, 1978), Studies in Logic and the Foundations of Mathematics, vol. 97, North-Holland, Amsterdam, 1979, pp. 303–316.Google Scholar

Hypermeasurable cardinals, [Mit84] The core model for sequences of measures. I, Mathematical Proceedings of the Cambridge Philosophical Society, vol. 95 (1984), no. 2, pp. 229–260.Google Scholar

[MiS94] Fine structure and iteration trees, Lecture Notes in Logic, vol. 3, Springer-Verlag, Berlin, 1994.Google Scholar

and [Mon03] Embedding jump upper semilattices into the Turing degrees, The Journal of Symbolic Logic, vol. 68 (2003), no. 3, pp. 989–1014.Google Scholar

[Mos67] Hyperanalytic predicates, Transactions of the American Mathematical Society, vol. 129 (1967), pp. 249–282.Google Scholar

[Mos69A]

Abstract computability and invariant definability, The Journal of Symbolic Logic, vol. 34 (1969), pp. 605–633.[Mos69B] Abstract first order computabilityII, Transactions of the American Mathematical Society, vol. 138 (1969), pp. 464–504.Google Scholar

[Mos70A] Mathematical logic and foundations of set theory. Proceedings of an international colloquium held under the auspices of the Israel Academy of Sciences and Humanities, Jerusalem, 11–14 November 1968 ( , editor), Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam-London, 1970, pp. 24–62.Google Scholar

Determinacy and prewellorderings of the continuum, [Mos70B] The Suslin-Kleene theorem for countable structures, Duke Mathematical Journal, vol. 37 (1970), no. 2, pp. 341–352.Google Scholar

[Mos71] Uniformization in a playful universe, Bulletin of the American Mathematical Society, vol. 77 (1971), pp. 731–736.Google Scholar

[Mos73] Logic, methodology, and philosophy of science IV ( , , , and , editors), North-Holland, 1973, pp. 77–83.Google Scholar

Analytical definability in a playful universe, [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] 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

On the basic notions in the theory of induction, [Mos78]

Inductive scales on inductive sets, in Kechris and Moschovakis [Cabal i], pp. 185–192, reprinted in [Cabal I], pp. 94–101.[Mos80] Descriptive set theory, Studies in Logic and the Foundations of Mathematics, no. 100, North-Holland, Amsterdam, 1980.Google Scholar

[Mos81]

Ordinal games and playful models, this volume, originally published in Kechris et al. [Cabal ii], pp. 169–201.[Mos83]

Scales on coinductive sets, in Kechris et al. [Cabal iii], pp. 77–85, reprinted in [Cabal I], pp. 102–109.[Mos09] Descriptive set theory, second ed., Mathematical Surveys and Monographs, vol. 155, American Mathematical Society, 2009.Google Scholar

[Nee95] Optimal proofs of determinacy, The Bulletin of Symbolic Logic, vol. 1 (1995), no. 3, pp. 327–339.Google Scholar

[Nee00] UnravelingΠ11 sets, Annals of Pure andApplied Logic, vol. 106 (2000), no. 1-3, pp. 151–205.Google Scholar

[Nee02] Optimal proofs of determinacy II, Journal of Mathematical Logic, vol. 2 (2002), no. 2, pp. 227–258.Google Scholar

[Nee04] The determinacy of long games, de Gruyter Series in Logic and its Applications, vol. 7, Walter de Gruyter, Berlin, 2004.Google Scholar

[Nee06] Unraveling Π11 sets, revisited, Israel Journal of Mathematics, vol. 152 (2006), pp. 181–203.Google Scholar

[Nee07] Inner models and ultrafilters in L(ℝ), The Bulletin of Symbolic Logic, vol. 13 (2007), no. 1, pp. 31–53.Google Scholar

[Nee10]

Determinacy in L(ℝ), in Kanamori and Foreman [KF10], pp. 1877–1950.[Nee16] 2016, this volume.

An inner models proof of the Kechris–Martin theorem, [NS80A] Reducibility orderings: theories, definability and automorphisms, Annals of Mathematical Logic, vol. 18 (1980), no. 1, pp. 61–89.Google Scholar

and [NS80B] 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

and Second order logic and first order theories of reducibility orderings, [Nor78] 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

Set recursion, [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

[PR81] Degrees joining to 0', The Journal of Symbolic Logic, vol. 46 (1981), no. 4, pp. 714–722.Google Scholar

and [Pos44] Recursively enumerable sets of positive integers and their decision problems, Bulletin of the American Mathematical Society, vol. 50 (1944), pp. 284–316.Google Scholar

Recursively Mahlo ordinals and inductive definitions,

[RA74]

and Inductive definitions and reflecting properties of admissible ordinals, in Fenstad and Hinman [FH74], pp. 301–381.[Rog67] The theory of recursive functions and effective computability, McGraw-Hill, 1967.Google Scholar

[Rud95] Mouse sets definable in L(ℝ), Ph.D. thesis, University of California, Los Angeles, 1995.Google Scholar

[Sac61] A minimal degree less than 0', Bulletin of the American Mathematical Society, vol. 67 (1961), pp. 416–419.Google Scholar

[Sac63] Degrees of unsolvability, Annals of Mathematics Studies, vol. 55, Princeton University Press, 1963.Google Scholar

[Sac67] On a theorem of Lachlan and Martin, Proceedings of the American Mathematical Society, vol. 18 (1967), pp. 140–141.Google Scholar

[Sac71] Axiomatic set theory (Dana S. Scott, editor), Proceedings of Symposia in Pure Mathematics, vol. XIII, Part I, American Mathematical Society, 1971, pp. 331–355.Google Scholar

Forcing with perfect closed sets, [Sac90] Higher recursion theory, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1990.Google Scholar

[SS87] Inadmissible forcing, Advances in Mathematics, vol. 66 (1987), no. 1, pp. 1–30.Google Scholar

and [Sar09] A tale of hybrid mice, Ph.D. thesis, University of California, Berkeley, 2009.Google Scholar

[Sar13] 2013.

A tale of hybrid mice, preprint, [SS]

and Capturing by ℝ-mice, to appear.[Sas74] A minimal degree not realizing the least possible jump, The Journal of Symbolic Logic, vol. 39 (1974), pp. 571–573.Google Scholar

[SS]

and The core model induction, to appear.[SS09] The self-iterability of L[E], The Journal of Symbolic Logic, vol. 74 (2009), no. 3, pp. 751– 779.Google Scholar

and [SW90] Large cardinals imply that every reasonably definable set of reals is Lebesgue measurable, Israel Journal of Mathematics, vol. 70 (1990), no. 3, pp. 381–394.Google Scholar

and [Sho61] Essays on the foundations of mathematics ( et al., editors), Magnes Press, Jerusalem, 1961, pp. 132–139.Google Scholar

The problem of predicativity, [Sho66]

A theorem on minimal degrees, The Journal of Symbolic Logic, vol. 31 (1966), pp. 539–544.[Sho67]

Mathematical logic, Addison-Wesley, 1967.[SS99] Defining the Turing jump, Mathematical Research Letters, vol. 6 (1999), no. 5–6, pp. 711– 722.Google Scholar

and [Sil71A] Axiomatic set theory ( , editor), Proceedings of Symposia in Pure Mathematics, vol. XIII, Part I, American Mathematical Society, 1971, pp. 391–395.Google Scholar

The consistency of the GCH with the existence of a measurable cardinal, [Sil71B] Measurable cardinals and Δ13 wellorderings, Annals of Mathematics, vol. 94 (1971), no. 2, pp. 414–446.Google Scholar

[Sim79] Semihypermeasurables and Π01 (Π11) games, Ph.D. thesis, Rockefeller University, 1979.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] Proceedings of the International Congress of Mathematicians, Vol. I, II (Kyoto, 1990) (Tokyo), Mathematical Society of Japan, 1991, pp. 303–316.Google Scholar

Degree structures, [Sla05] Aspects of the Turing jump, Logic Colloquium 2000, Lecture Notes in Logic, vol. 19, Association for Symbolic Logic, Urbana, IL, 2005, pp. 365–382.Google Scholar

[SS]

and A construction degree invariant below 0, manuscript.[SS88]

and Definable functions on degrees, this volume, originally published in Kechris et al. [Cabal iv], pp. 37–55.[SS89] Complementation in the Turing degrees, The Journal of Symbolic Logic, vol. 54 (1989), no. 1, pp. 160–176.Google Scholar

and [Sol66] Foundations of Mathematics: Symposium papers commemorating the 60th birthday of Kurt Gödel ( , , and , editors), Springer-Verlag, 1966, pp. 58–73.Google Scholar

On the cardinality of Σ12 set of reals, [Sol67] 1967.

Measurable cardinals and the axiom of determinateness, lecture notes prepared in connection with the Summer Institute of Axiomatic Set Theory held at UCLA, Summer [Sol70] A model of set-theory in which every set of reals is Lebesgue measurable, Annals of Mathematics, vol. 92 (1970), pp. 1–56.Google Scholar

[Sol78A]

A Δ13 coding of the subsets of ωω, in Kechris and Moschovakis [Cabal i], pp. 133–150, reprinted in [Cabal II], pp. 346–363.[Sol78B]

The independence of DC from AD, in Kechris and Moschovakis [Cabal i], pp. 171–184. Ramsey's theorem does not hold in recursive set theory,

[Spe56] On degrees of recursive unsolvability, Annals of Mathematics, vol. 65 (1956), pp. 581–592.Google Scholar

[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

[Ste82A] A classification of jump operators, The Journal of Symbolic Logic, vol. 47 (1982), no. 2, pp. 347–358.Google Scholar

[Ste82B] Determinacy in the Mitchell models, Annals of Mathematical Logic, vol. 22 (1982), no. 2, pp. 109–125.Google Scholar

[Ste83A]

Scales in L(ℝ), in Kechris et al. [Cabal iii], pp. 107–156, reprinted in [Cabal I], pp. 130–175.[Ste83B]

Scales on Σ11 sets, inKechris et al. [Cabal iii], pp. 72–76, reprinted in [Cabal I], pp. 90–93.[Ste93] Inner models with many Woodin cardinals, Annals of Pure and Applied Logic, vol. 65 (1993), no. 2, pp. 185–209.Google Scholar

[Ste95A] HODL(ℝ) is a core model below T, The Bulletin of Symbolic Logic, vol. 1 (1995), no. 1, pp. 75–84.Google Scholar

[Ste95B] Projectively wellordered inner models, Annals of Pure and Applied Logic, vol. 74 (1995), no. 1, pp. 77–104.Google Scholar

[Ste96] The core model iterability problem, Lecture Notes in Logic, no. 8, Springer-Verlag, Berlin, 1996.Google Scholar

[Ste05] PFA implies ADL(ℝ), The Journal of Symbolic Logic, vol. 70 (2005), no. 4, pp. 1255–1296.Google Scholar

[Ste08A] Computational prospects of infinity. Part I. Tutorials, Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore, vol. 14, World Scientific Publishing, 2008, pp. 105–193.Google Scholar

Derived models associated to mice, [Ste08B]

Games and scales. Introduction to Part I, in Kechris et al. [Cabal I], pp. 3–27.[Ste08C]

Scales in K(ℝ), in Kechris et al. [Cabal I], pp. 176–208.[Ste09] The derived model theorem, Logic Colloquium 2006, Lecture Notes in Logic, vol. 19, Association for Symbolic Logic, 2009, pp. 280–327.Google Scholar

[Ste10A] 2010.

Notes on V as a derived model, unpublished notes, [Ste10B]

An outline of inner model theory, in Kanamori and Foreman [KF10], pp. 1595–1684.[Ste16A] 2016, this volume.

Ordinal definability in models of determinacy. Introduction to Part V, [Ste16B] 2016, this volume.

A theorem of Woodin on mouse sets, [ST10] 2010.

and AD+, derived models, and Σ1 reflection, Notes from the firstMünster conference on hod mice and the core model induction, available at http://math.berkeley.edu/~namtrang/ AD+reflection.pdf, [SVW82] Two consequences of determinacy consistent with choice, Transactions of the American Mathematical Society, vol. 272 (1982), no. 1, pp. 67–85.Google Scholar

and [SW16]

and HOD as a core model, 2016, this volume. Simon Thomas[Tho]

and Universal Borel actions of countable groups, Accepted for publication in Groups, Geometry, and Dynamics.[Tho02] Set theory (Piscataway, NJ, 1999), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 58, American Mathematical Society, Providence, RI, 2002, pp. 129–134.Google Scholar

and Some applications of superrigidity to Borel equivalence relations, [Tho09A] Continuous versus Borel reductions, Archive for Mathematical Logic, vol. 48 (2009), no. 8, pp. 761–770.Google Scholar

and [Tho09B] Martin's conjecture and strong ergodicity, Archive for Mathematical Logic, vol. 48 (2009), no. 8, pp. 749–759.Google Scholar

and [Tho09C] Popa superrigidity and countable Borel equivalence relations, Annals of Pure and Applied Logic, vol. 158 (2009), no. 3, pp. 175–189.Google Scholar

[Tit65] Untersuchungen über die Struktur des Kleene-Postschen Halbverbandes der Grade der rekursiven Unlösbarkeit, Archiv für mathematische Logik und Grundlagenforschung, vol. 8 (1965), pp. 45–62.Google Scholar

[Tra70] On autoreducibility, Soviet Mathematics, vol. 11 (1970), pp. 814–817, translated from Doklady Akademii Nauk SSSR, vol. 192 (1970), pp. 1224–1227.Google Scholar

[Tra12] 2012.

HOD in natural models of AD+, preprint, available at http://arXiv.org/abs/1201. 6128v1, [Wei84] Conference in modern analysis and probability (New Haven, Conn., 1982), Contemporary Mathematics, vol. 26, American Mathematical Society, Providence, RI, 1984, pp. 395–421.Google Scholar

Measurable dynamics, [Wil13] Contributions to descriptive inner model theory, Ph.D. thesis, University of California, Berkeley, 2013.Google Scholar

[Woo83A]

AD and the uniqueness of the supercompact measures on Pω1 (λ), in Kechris et al. [Cabal iii], pp. 67–71.[Woo83B]

Some consistency results in ZFC using AD, in Kechris et al. [Cabal iii], pp. 172–198.[Woo88] Supercompact cardinals, sets of reals, and weakly homogeneous trees, Proceedings of the National Academy of Sciences of the United States of America, vol. 85 (1988), no. 18, pp. 6587–6591.Google Scholar

[Woo08] Computational prospects of infinity. Part II. Presented talks, Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore, vol. 15, World Scientific Publishing, 2008, pp. 355–392.Google Scholar

A tt version of the Posner-Robinson theorem, [Zhu10] 2010.

The derived model theorem II, Notes on lectures given by H. Woodin at the first Münster conference on hod mice and the core model induction, available at http://graduate.math. nus.edu.sg/~g0700513/der.pdf, [Zhu12] Realizing an AD+ model as a derived model of a premouse, Ph.D. thesis, National University of Singapore, 2012.Google Scholar

[Zim84] Ergodic theory and semisimple groups, Monographs in Mathematics, vol. 81, Birkhäuser Verlag, Basel, 1984.Google Scholar

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

- Bibliography
- Book: Ordinal Definability and Recursion Theory
- Online publication: 05 December 2015

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

- Bibliography
- Book: Ordinal Definability and Recursion Theory
- Online publication: 05 December 2015

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

- Bibliography
- Book: Ordinal Definability and Recursion Theory
- Online publication: 05 December 2015