Skip to main content Accessibility help
×
Home
Hostname: page-component-5c569c448b-dnb4q Total loading time: 0.89 Render date: 2022-07-03T19:19:23.832Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true } hasContentIssue true

Bibliography

Published online by Cambridge University Press:  05 December 2015

Alexander S. Kechris
Affiliation:
California Institute of Technology
Benedikt Löwe
Affiliation:
Universiteit van Amsterdam
John R. Steel
Affiliation:
University of California, Berkeley
Get access

Summary

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Ordinal Definability and Recursion Theory
The Cabal Seminar, Volume III
, pp. 521 - 535
Publisher: Cambridge University Press
Print publication year: 2016

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[Aan74] Stål, AanderaaInductive definitions and their closure ordinals, in Fenstad and Hinman [FH74], pp. 207–220.
[Acz72] Peter, AczelStage comparison theorems and game playing with inductive definitions, unpublished notes, 1972.
[Acz75] Peter, AczelGames, quantifiers and inductive definitions, 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
[Add59] John W., AddisonSome consequences of the axiom of constructibility, Fundamenta Mathematicae, vol. 46 (1959), pp. 337–357.Google Scholar
[AM68] John W., Addison and Yiannis N., MoschovakisSome 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
[ACH01] Alessandro, Andretta, Riccardo, Camerlo, and Gregory, HjorthConjugacy equivalence relation on subgroups, Fundamenta Mathematicae, vol. 167 (2001), no. 3, pp. 189–212.Google Scholar
[Bal86] Stewart, BaldwinBetween strong and superstrong, The Journal of Symbolic Logic, vol. 51 (1986), no. 3, pp. 547–559.
[Bar76] Jon, BarwiseAdmissible sets and structures, Springer-Verlag, 1976.
[BGM71] K. Jon, Barwise, Robin O., Gandy, and Yiannis N., MoschovakisThe next admissible set, The Journal of Symbolic Logic, vol. 36 (1971), pp. 108–120.
[BMS84] James, Baumgartner, Donald A., Martin, and Saharon, Shelah Axiomatic set theory. Proceedings of the 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
[Bec] Howard S., Becker Pointclass jumps, Manuscript.
[Bec78] Howard S., BeckerPartially playful universes, this volume, originally published in Kechris and Moschovakis [Cabal i], pp. 55–90.
[Bec80] Howard S., BeckerThin collections of sets of projective ordinals and analogs of L, Annals of Mathematical Logic, vol. 19 (1980), pp. 205–241.Google Scholar
[Bec81] Howard S., BeckerAD and the supercompactness of ℵ1, The Journal of Symbolic Logic, vol. 46 (1981), pp. 822–841.Google Scholar
[Bec88] Howard S., BeckerA characterization of jump operators, The Journal of Symbolic Logic, vol. 53 (1988), no. 3, pp. 708–728.Google Scholar
[BK84] Howard S., Becker and Alexander S., KechrisSets of ordinals constructible from trees and the third Victoria Delfino problem, in Baumgartner et al. [BMS84], pp. 13–29.
[BM81] Howard S., Becker and Yiannis N., MoschovakisMeasurable cardinals in playful models, this volume, originally published in Kechris et al. [Cabal ii], pp. 203–214.
[BJ07] Charles M., Boykin and Stephen, JacksonBorel boundedness and the lattice rounding property, Advances in logic, Contemporary Mathematics, vol. 425, American Mathematical Society, Providence, RI, 2007, pp. 113–126.Google Scholar
[BM75] John P., Burgess and Douglas, MillerRemarks on invariant descriptive set theory, Fundamenta Mathematicae, vol. 90 (1975), pp. 53–75.Google Scholar
[CWY10] C. T., Chong, Wei, Wang, and Liang, YuThe strength of the projective Martin conjecture, Fundamenta Mathematicae, vol. 207 (2010), no. 1, pp. 21–27.Google Scholar
[CY09] C. T., Chong and Liang, YuAΠ11 -uniformization principle for reals, Transactions of the American Mathematical Society, vol. 361 (2009), no. 8, pp. 4233–4245.Google Scholar
[Coo73] S. Barry, CooperMinimal degrees and the jump operator, The Journal of Symbolic Logic, vol. 38 (1973), pp. 249–271.Google Scholar
[Coo96] S. Barry, CooperA 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] S. Barry, Cooper, Andrew E. M., Lewis, and Yue, YangProperly Σ2 minimal degrees and 0'' complementation, Mathematical Logic Quarterly, vol. 51 (2005), no. 3, pp. 274–276.Google Scholar
[Cra85] Mark, CrawshawExplicit formulas for the jump of Q-degrees, Ph.D. thesis, California Institute of Technology, 1985.
[Dod80] Anthony, DoddStrong cardinals, unpublished, 1980.
[DJ81] Anthony, Dodd and Ronald, Jensen The core model, Annals of Mathematical Logic, vol. 20 (1981), no. 1, pp. 43–75.
[DJK94] Randall, Dougherty, Stephen, Jackson, and Alexander S., KechrisThe structure of hyperfinite Borel equivalence relations, Transactions of the American Mathematical Society, vol. 341 (1994), no. 1, pp. 193–225.Google Scholar
[DK00] Randall, Dougherty and Alexander S., KechrisHow many Turing degrees are there?, Computability theory and its applications (Boulder, CO, 1999), Contemporary Mathematics, vol. 257, American Mathematical Society, Providence, RI, 2000, pp. 83–94.Google Scholar
[DS97] Rodney G., Downey and Richard A., ShoreThere is no degree invariant half-jump, Proceedings of the American Mathematical Society, vol. 125 (1997), no. 10, pp. 3033–3037.Google Scholar
[Dra74] Frank R., DrakeSet theory: An introduction to large cardinals, Studies in Logic and the Foundations of Mathematics, vol. 76, North-Holland, 1974.Google Scholar
[DuB90] Derrick Albert, DuBoseThe equivalence of determinancy and iterated sharps, The Journal of Symbolic Logic, vol. 55 (1990), no. 2, pp. 502–525.Google Scholar
[Eps75] Richard L., EpsteinMinimal degrees of unsolvability and the full approximation construction, vol. 3, Memoirs of the American Mathematical Society, no. 162, American Mathematical Society, 1975. [Eps79] Richard L., EpsteinDegrees of unsolvability: Structure and theory, Lecture Notes, vol. 759, Springer, 1979.Google Scholar
[Far] Ilijas, FarahAccepted for publication in GroupsThe extender algebra and Σ21 -absoluteness, to appear.
[FM77] Jacob, Feldman and Calvin C., MooreErgodic equivalence relations, cohomology, and von Neumann algebras. I, Transactions of the American Mathematical Society, vol. 234 (1977), no. 2, pp. 289–324.Google Scholar
[FH74] Jens Erik, Fenstad and Peter G., HinmanGeneralized recursion theory. Proceedings of the 1972 Oslo symposium, Studies in Logic and the Foundations of Mathematics, vol. 79, North-Holland, 1974.Google Scholar
[FMS88] Matthew, Foreman, Menachem, Magidor, and Saharon, ShelahMartin's maximum, saturated ideals and nonregular ultrafilters. I, Annals of Mathematics, vol. 127 (1988), no. 1, pp. 1–47.Google Scholar
[Gan60] Matthew, Foreman, Menachem, Magidor, and Saharon, ShelahProof of Mostowski's conjecture, Bulletin de l'Académie Polonaise des Sciences, vol. 8 (1960), pp. 571–575.Google Scholar
[Gan67] Matthew, Foreman, Menachem, Magidor, and Saharon, ShelahGeneral 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
[Gre78] John Townsend, GreenDeterminacy and the existence of large measurable cardinals, Ph.D. thesis, University of California, Berkeley, 1978.Google Scholar
[GN84] Edward R., Griffor and Dag, NormannEffective cofinalities and admissibility in E-recursion, Fundamenta Mathematicae, vol. 123 (1984), no. 3, pp. 151–161.Google Scholar
[Gri71] Thomas J., GrilliotInductive definitions and computability, Transactions of the American Mathematical Society, vol. 158 (1971), pp. 309–317.Google Scholar
[GH76] David, Guaspari and Leo A., HarringtonCharacterizing C3 (the largest countable Π13 set), Proceedings of the American Mathematical Society, vol. 57 (1976), no. 1, pp. 127–129.Google Scholar
[Har73] Leo A., Harrington Contributions to recursion theory in higher types, Ph.D. thesis, MIT, 1973.
[Har75] Leo A., HarringtonMonotone quantifers and inductive definablity, unpublished, April 1975.
[Har78] Leo A., HarringtonAnalytic determinacy and 0#, The Journal of Symbolic Logic, vol. 43 (1978), no. 4, pp. 685–693.Google Scholar
[HK75] Leo A., Harrington and Alexander S., KechrisOn characterizing Spector classes, The Journal of Symbolic Logic, vol. 40 (1975), no. 1, pp. 19–24.Google Scholar
[HK81] Leo A., Harrington and Alexander S., KechrisOn the determinacy of games on ordinals, Annals of Mathematical Logic, vol. 20 (1981), pp. 109–154.Google Scholar
[HKS78] Leo A., Harrington, Lefteris M., Kirousis, and John S., SchlipfA generalized Kleene-Moschovakis theorem, Proceedings of the American Mathematical Society, vol. 68 (1978), no. 2, pp. 209–213.Google Scholar
[HS79] Leo A., Harrington and Ramez-Labib, SamiEquivalence relations, projective and beyond, Logic Colloquium ’78 (Mons, 1978), Studies in Logic and the Foundations of Mathematics, vol. 97, North-Holland, Amsterdam, 1979, pp. 247–264.Google Scholar
[Har66] Joseph Arthur, HarrisonSome applications of recursive pseudo-well orderings, Ph.D. thesis, Stanford University, 1966.Google Scholar
[HS91] Peter G., Hinman and Theodore A., SlamanJump embeddings in the Turing degrees, The Journal of Symbolic Logic, vol. 56 (1991), no. 2, pp. 563–591.Google Scholar
[Hjo96] Gregory, HjorthVariations of the Martin-Solovay tree, The Journal of Symbolic Logic, vol. 61 (1996), no. 1, pp. 40–51.Google Scholar
[Hjo01] Gregory, HjorthA boundedness lemma for iterations, The Journal of Symbolic Logic, vol. 66 (2001), no. 3, pp. 1058–1072.Google Scholar
[Hug69] D. F., HugillInitial segments of Turing degrees, Proceedings of the London Mathematical Society. Third Series, vol. 19 (1969), pp. 1–16.Google Scholar
[Jac08] Stephen, JacksonSuslin cardinals, partition properties, homogeneity. Introduction to Part II, in Kechris et al. [Cabal I], pp. 273–313.
[JKL02] Stephen, Jackson, Alexander S., Kechris, and Alain, LouveauCountable Borel equivalence relations, Journal of Mathematical Logic, vol. 2 (2002), no. 1, pp. 1–80.Google Scholar
[Jec71] Thomas, JechLectures in set theory, with particular emphasis on the method of forcing, Lecture Notes in Mathematics, Vol. 217, Springer-Verlag, Berlin, 1971.Google Scholar
[Jec78] Thomas, JechSet theory, Academic Press, 1978.Google Scholar
[Joc69A] Carl G., JockuschThe degrees of bi-immune sets, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 15 (1969), pp. 135–140.Google Scholar
[Joc69B] Carl G., JockuschRelationships betwewen reducibilities, Transactions of the American Mathematical Society, vol. 142 (1969), pp. 229–237.Google Scholar
[Joc72] Carl G., JockuschRamsey's theorem and recursion theory, The Journal of Symbolic Logic, vol. 37 (1972), pp. 268–280.Google Scholar
[Joc77] Carl G., JockuschSimple proofs of some theorems on high degrees, Canadian Journal of Mathematics, vol. 29 (1977), pp. 1072–1080.Google Scholar
[JP78] Carl G., Jockusch and David B., PosnerDouble jumps of minimal degrees, The Journal of Symbolic Logic, vol. 43 (1978), pp. 715–724.Google Scholar
[JP81] Carl G., Jockusch and David B., PosnerAutomorphism bases for the degrees of unsolvability, Israel Journal of Mathematics, vol. 40 (1981), no. 2, pp. 150–164.Google Scholar
[JS85] Carl G., Jockusch and Richard A., ShoreREA operators, r.e. degrees, and minimal covers, Proceedings of Symposia in Pure Mathematics, vol. 42 (1985), pp. 3–11.Google Scholar
[JS75] Carl G., Jockusch and Stephen G., SimpsonA degree-theoretic definition of the ramified analytic hierarchy, Annals of Mathematical Logic, vol. 10 (1975), pp. 1–32.Google Scholar
[JS72A] Carl G., Jockusch and Robert I., Soare Degrees of members of Π01 classes, Pacific Journal of Mathematics, vol. 40 (1972), pp. 605– 616.
[JS72B] Carl G., Jockusch and Robert I., Soare Π01classes and degrees of theories, Transactions of the American Mathematical Society, vol. 173 (1972), pp. 33–56.Google Scholar
[JJW92] H., Judah, W., Just, and W. Hugh, WoodinSet theory of the continuum, MSRI publications, vol. 26, Springer-Verlag, 1992.Google Scholar
[KF10] Akihiro, Kanamori and Matthew, ForemanHandbook of set theory, Springer, 2010.Google Scholar
[Kec72] Alexander S., KechrisProjective ordinals and countable analytical sets, Ph.D. thesis, UCLA, 1972.
[Kec73A] Alexander S., KechrisLecture notes on descriptive set theory, 1973, M.I.T.
[Kec73B] Alexander S., KechrisMeasure and category in effective descriptive set theory, Annals of Mathematical Logic, vol. 5 (1973), no. 4, pp. 337–384.Google Scholar
[Kec73C] Alexander S., KechrisThe structure of envelopes: a survey of recursion theory in higher types, M.I.T. Logic Seminar notes, 1973.
[Kec75A] Alexander S., KechrisCountable ordinals and the analytical hierarchy. I, Pacific Journal of Mathematics, vol. 60 (1975), no. 1, pp. 223–227.Google Scholar
[Kec75B] Alexander S., KechrisThe theory of countable analytical sets, Transactions of the American Mathematical Society, vol. 202 (1975), pp. 259–297.Google Scholar
[Kec76] Alexander S., KechrisUncountable ordinals and the analytical hierarchy, circulated notes, July 1976.
[Kec77] Alexander S., KechrisOn 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] Alexander S., Kechris AD and projective ordinals, in Kechris and Moschovakis [Cabal i], pp. 91–132, reprinted in [Cabal II], pp. 304–345.
[Kec78B] Alexander S., KechrisCountable ordinals and the analytical hierarchy. II, Annals of Mathematical Logic, vol. 15 (1978), no. 3, pp. 193–223.Google Scholar
[Kec78C] Alexander S., KechrisOn Spector classes, this volume, originally published in Kechris and Moschovakis [Cabal i], pp. 245–277.
[Kec80] Alexander S., KechrisRecent advances in the theory of higher level projective sets, The Kleene Symposium (Proc. Sympos., Univ. Wisconsin, Madison, Wis., 1978) (Jon, Barwise, Kenneth, Kunen, and H. J., Keisler, editors), Stud. Logic Foundations Math., vol. 101, North-Holland, Amsterdam, 1980, pp. 149–166.Google Scholar
[Kec81] Alexander S., KechrisHomogeneous trees and projective scales, in Kechris et al. [Cabal ii], pp. 33–74, reprinted in [Cabal II], pp. 270–303.
[Kec84] Alexander S., KechrisThe axiom of determinancy implies dependent choices in L(ℝ), The Journal of Symbolic Logic, vol. 49 (1984), no. 1, pp. 161–173.Google Scholar
[Kec91] Alexander S., KechrisAmenable equivalence relations and Turing degrees, The Journal of Symbolic Logic, vol. 56 (1991), no. 1, pp. 182–194.Google Scholar
[Kec92] Alexander S., KechrisThe structure of Borel equivalence relations in Polish spaces, in Judah et al. [JJW92], pp. 89–102.
[Kec95] Alexander S., KechrisClassical descriptive set theory, Graduate Texts in Mathematics, vol. 156, Springer, 1995.Google Scholar
[KKMW81] Alexander S., Kechris, Eugene M., Kleinberg, Yiannis N., Moschovakis, and W. Hugh, WoodinThe 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] Alexander S., Kechris, Benedikt, Löwe, and John R., SteelGames, scales, and Suslin cardinals: the Cabal seminar, volume I, Lecture Notes in Logic, vol. 31, Cambridge University Press, 2008.Google Scholar
[Cabal II] Alexander S., Kechris, Benedikt, Löwe, and John R., SteelWadge degrees and projective ordinals: the Cabal seminar, volume II, Lecture Notes in Logic, vol. 37, Cambridge University Press, 2012.Google Scholar
[KM78] Alexander S., Kechris and Donald A., MartinOn the theory of Π13 sets of reals, Bulletin of the American Mathematical Society, vol. 84 (1978), no. 1, pp. 149–151.Google Scholar
[KM16] Alexander S., Kechris and Donald A., Martin On the theory of Π13sets of reals, II, 2016, this volume.
[Cabal ii] Alexander S., Kechris, Donald A., Martin, and Yiannis N., Moschovakis Cabal seminar 77–79, Lecture Notes in Mathematics, no. 839, Berlin, Springer, 1981.
[Cabal iii] Alexander S., Kechris, Donald A., Martin, and Yiannis N., MoschovakisCabal seminar79–81, Lecture Notes in Mathematics, no. 1019, Berlin, Springer, 1983.Google Scholar
[KMS83] Alexander S., Kechris, Donald A., Martin, and Robert M., SolovayIntroduction to Q-theory, this volume, originally published in Kechris et al. [Cabal iii], pp. 199–282.
[Cabal iv] Alexander S., Kechris, Donald A., Martin, and John R., SteelCabal seminar81–85, Lecture Notes in Mathematics, no. 1333, Berlin, Springer, 1988.Google Scholar
[KM72] Alexander S., Kechris and Yiannis N., MoschovakisTwo theorems about projective sets, Israel Journal of Mathematics, vol. 12 (1972), pp. 391– 399.
[KM77] Alexander S., Kechris and Yiannis N., MoschovakisRecursion in higher types, Handbook of mathematical logic (K. J., Barwise, editor), North- Holland, 1977, pp. 681–737.Google Scholar
[Cabal i] Alexander S., Kechris and Yiannis N., MoschovakisCabal seminar76–77, Lecture Notes in Mathematics, no. 689, Berlin, Springer, 1978.Google Scholar
[KM78B] Alexander S., Kechris and Yiannis N., MoschovakisNotes on the theory of scales, in Cabal Seminar76–77 [Cabal i], pp. 1–53, reprinted in [Cabal I], pp. 28–74.
[KS85] Alexander S., Kechris and Robert M., SolovayOn the relative consistency strength of determinacy hypotheses, Transactions of the American Mathematical Society, vol. 290 (1985), no. 1, pp. 179–211.Google Scholar
[KW80] Alexander S., Kechris and W. Hugh, WoodinGeneric codes for uncountable ordinals, partition properties, and elementary embeddings, circulated manuscript, 1980, reprinted in [Cabal I], pp. 379–397.
[KW83] Alexander S., Kechris and W. Hugh, WoodinEquivalence 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
[KW08] Alexander S., Kechris and W. Hugh, WoodinThe equivalence of partition properties and determinacy, in Kechris et al. [Cabal I], pp. 355–378.
[Ket11] Richard, KetchersidMore structural consequences of AD, Set theory and its applications, Contemporary Mathematics, vol. 533, American Mathematical Society, Providence, RI, 2011, pp. 71–105.Google Scholar
[Kle55A] Stephen C., KleeneArithmetical predicates and function quantifiers, Transactions of the American Mathematical Society, vol. 79 (1955), pp. 312–340.Google Scholar
[Kle55B] Stephen C., KleeneHierarchies of number-theoretic predicates, Bulletin of the American Mathematical Society, vol. 61 (1955), pp. 193–213.Google Scholar
[Kle55C] Stephen C., KleeneOn 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] Stephen C., KleeneQuantification of number theoretic functions, Compositio Mathematica, vol. 14 (1959), pp. 23–40.Google Scholar
[Kle59B] Stephen C., KleeneRecursive functionals and quantifiers of finite types. I, Transactions of the American Mathematical Society, vol. 91 (1959), pp. 1–52.Google Scholar
[Kle63] Stephen C., KleeneRecursive functionals and quantifiers of finite types. II, Transactions of the American Mathematical Society, vol. 108 (1963), pp. 106–142.Google Scholar
[KP54] Stephen C., Kleene and Emil L., PostThe upper-semilattice of degrees of recursive unsolvability, Annals of Mathematics, vol. 59 (1954), pp. 379–407.Google Scholar
[KW10] Peter, Koellner and W. Hugh, WoodinLarge cardinals from determinacy, in Kanamori and Foreman [KF10], pp. 1951–2119.
[Kol78A] Phokion G., KolaitisOn recursion in E and semi-Spector classes, this volume, originally published in Kechris and Moschovakis [Cabal i], pp. 209–243.
[Kol78B] Phokion G., KolaitisRecursion and induction in a quantifier, Ph.D. thesis, University of California, Los Angeles, 1978.Google Scholar
[Kol79] Phokion G., KolaitisRecursion in a quantifier vs. elementary induction, The Journal of Symbolic Logic, vol. 44 (1979), no. 2, pp. 235–259.Google Scholar
[Kre61] Georg, KreiselSet 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
[Kun70] Kenneth, KunenSome applications of iterated ultrapowers in set theory, Annals of Mathematical Logic, vol. 1 (1970), pp. 179–227.Google Scholar
[Kun71A] Kenneth, KunenOn, circulated note, August 1971.
[Kun71B] Kenneth, KunenOn the GCH at measurable cardinals, Logic Colloquium ’69 (Proc. Summer School and Colloq., Manchester, 1969) (R. O., Gandy and C. M. E., Yates, editors), North-Holland, Amsterdam, 1971, pp. 107–110.Google Scholar
[Lac68] Alistair H., LachlanDistributive 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] Alistair H., LachlanSolution to a problem of Spector, Canadian Journal of Mathematics, vol. 23 (1971), pp. 247–256.Google Scholar
[Lac75] Alistair H., LachlanUniform enumeration operations, The Journal of Symbolic Logic, vol. 40 (1975), no. 3, pp. 401–409.Google Scholar
[LL76] Alistair H., Lachlan and R., LebeufCountable initial segments of the degrees of unsolvability, The Journal of Symbolic Logic, vol. 41 (1976), no. 2, pp. 289–300.Google Scholar
[Lad73] Richard E., LadnerA completely mitotic non recursive r.e. set, Transactions of the American Mathematical Society, vol. 184 (1973), pp. 479–507.Google Scholar
[Ler69] Manuel, LermanSome 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] Manuel, LermanInitial segments of the degrees of unsolvability, Annals of Mathematics, vol. 93 (1971), pp. 365–389.Google Scholar
[Ler83] Manuel, LermanDegrees of unsolvability, Perspectives in Mathematical Logic, Springer-Verlag, 1983.Google Scholar
[Lew05] Andrew, LewisOn a question of Sacks – a partial solution on the positive side, New computational paradigms (S. Barry, Cooper, Benedikt, Löwe, and Leen, Torenvliet, editors), Lecture Notes in Computer Science, vol. 3526, Springer, 2005, pp. 15–63.Google Scholar
[Man71] Alfred B., ManasterSome contrasts between degrees and the arithmetical hierarchy, The Journal of Symbolic Logic, vol. 36 (1971), pp. 301–304.Google Scholar
[Man70] Richard, MansfieldPerfect subsets of definable sets of real numbers, Pacific Journal of Mathematics, vol. 35 (1970), no. 2, pp. 451–457.Google Scholar
[Mar12] Andrew, MarksRecursion theory and countable Borel equivalence relations, Ph.D. thesis, Department of Mathematics, University of California, Berkeley, 2012.Google Scholar
[Mar14] Andrew, MarksUniformity, universality, and recursion theory, (2014), Preprint.
[MSS11] Andrew, Marks, Theodore A., Slaman, and John R., SteelMartin's conjecture, arithmetic equivalence, and countable Borel equivalence relations, Preprint, 2011.
[Mar] Donald A., MartinBorel and projective games, in preparation.
[Mar68] Donald A., MartinThe 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] Donald A., MartinMeasurable cardinals and analytic games, Fundamenta Mathematicae, vol. 66 (1970), pp. 287–291.Google Scholar
[Mar73] Donald A., Martin Δ12ndeterminacy impliesn determinacy, circulated note, 1973.
[Mar75] Donald A., MartinBorel determinacy, Annals of Mathematics, vol. 102 (1975), no. 2, pp. 363–371.Google Scholar
[Mar76] Donald A., MartinProof of a conjecture of Friedman, Proceedings of the American Mathematical Society, vol. 55 (1976), no. 1, p. 129.Google Scholar
[Mar80] Donald A., MartinInfinite games, Proceedings of the International Congress of Mathematicatians, Helsinki 1978 (Helsinki) (Olli, Lehto, editor), Academia Scientiarum Fennica, 1980, pp. 269–273.Google Scholar
[Mar81] Donald A., Martin Π12monotone inductive definitions, this volume, originally published in Kechris et al. [Cabal ii], pp. 215–233.
[Mar83] Donald A., MartinThe largest countable this, that, and the other, in Kechris et al. [Cabal iii], pp. 97–106, reprinted in [Cabal I], pp. 121–129.
[Mar12] Donald A., MartinProjective sets and cardinal numbers: some questions related to the continuum problem, in Kechris et al. [Cabal II], pp. 484–508.
[MM68] Donald A., Martin and Webb, MillerThe degrees of hyperimmune sets, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 14 (1968), pp. 159–166.Google Scholar
[MMS82] Donald A., Martin, Yiannis N., Moschovakis, and John R., SteelThe extent of definable scales, Bulletin of the American Mathematical Society, vol. 6 (1982), pp. 435–440.Google Scholar
[MS69] Donald A., Martin and Robert M., SolovayA basis theorem for S13 sets of reals, Annals of Mathematics, vol. 89 (1969), pp. 138–160.Google Scholar
[MS83] Donald A., Martin and John R., SteelThe extent of scales in L(ℝ), in Kechris et al. [Cabal iii], pp. 86–96, reprinted in [Cabal I], pp. 110–120.
[MS89] Donald A., Martin and John R., SteelA proof of projective determinacy, Journal of the American Mathematical Society, vol. 2 (1989), pp. 71–125.Google Scholar
[MaS94] Donald A., Martin and John R., SteelIteration trees, Journal of the American Mathematical Society, vol. 7 (1994), no. 1, pp. 1–73.Google Scholar
[Mil81] David P., MillerHigh recursively enumerable degrees and the anticupping property, Logic Year 1979–80. Proceedings of the Logic Year and of the Conference on Mathematical Logic, November 11–13, 1979, at Storrs (M., Lerman, J. H., Schmerl, and R. I., Soare, editors), Lecture Notes in Mathematics, vol. 859, Springer, 1981, pp. 230–245.Google Scholar
[Mit74] William J., MitchellSets constructible from sequences of ultrafilters, The Journal of Symbolic Logic, vol. 39 (1974), pp. 57–66.Google Scholar
[Mit79] William J., MitchellHypermeasurable cardinals, Logic Colloquium ’78 (Mons, 1978), Studies in Logic and the Foundations of Mathematics, vol. 97, North-Holland, Amsterdam, 1979, pp. 303–316.Google Scholar
[Mit84] William J., MitchellThe 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] William J., Mitchell and John R., SteelFine structure and iteration trees, Lecture Notes in Logic, vol. 3, Springer-Verlag, Berlin, 1994.Google Scholar
[Mon03] Antonio, MontalbánEmbedding jump upper semilattices into the Turing degrees, The Journal of Symbolic Logic, vol. 68 (2003), no. 3, pp. 989–1014.Google Scholar
[Mos67] Yiannis N., MoschovakisHyperanalytic predicates, Transactions of the American Mathematical Society, vol. 129 (1967), pp. 249–282.Google Scholar
[Mos69A] Yiannis N., Moschovakis Abstract computability and invariant definability, The Journal of Symbolic Logic, vol. 34 (1969), pp. 605–633.
[Mos69B] Yiannis N., MoschovakisAbstract first order computabilityII, Transactions of the American Mathematical Society, vol. 138 (1969), pp. 464–504.Google Scholar
[Mos70A] Yiannis N., MoschovakisDeterminacy and prewellorderings of the continuum, 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 (Y., Bar-Hillel, editor), Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam-London, 1970, pp. 24–62.Google Scholar
[Mos70B] Yiannis N., MoschovakisThe Suslin-Kleene theorem for countable structures, Duke Mathematical Journal, vol. 37 (1970), no. 2, pp. 341–352.Google Scholar
[Mos71] Yiannis N., MoschovakisUniformization in a playful universe, Bulletin of the American Mathematical Society, vol. 77 (1971), pp. 731–736.Google Scholar
[Mos73] Yiannis N., MoschovakisAnalytical definability in a playful universe, Logic, methodology, and philosophy of science IV (Patrick, Suppes, Leon, Henkin, Athanase, Joja, and Gr. C., Moisil, editors), North-Holland, 1973, pp. 77–83.Google Scholar
[Mos74A] Yiannis N., MoschovakisElementary induction on abstract structures, North-Holland, 1974.Google Scholar
[Mos74B] Yiannis N., MoschovakisOn nonmonotone inductive definability, Fundamenta Mathematicae, vol. 82 (1974), pp. 39–83.Google Scholar
[Mos74C] Yiannis N., MoschovakisStructural characterizations of classes of relations, in Fenstad and Hinman [FH74], pp. 53–79.
[Mos77] Yiannis N., MoschovakisOn 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
[Mos78] Yiannis N., MoschovakisInductive scales on inductive sets, in Kechris and Moschovakis [Cabal i], pp. 185–192, reprinted in [Cabal I], pp. 94–101.
[Mos80] Yiannis N., MoschovakisDescriptive set theory, Studies in Logic and the Foundations of Mathematics, no. 100, North-Holland, Amsterdam, 1980.Google Scholar
[Mos81] Yiannis N., MoschovakisOrdinal games and playful models, this volume, originally published in Kechris et al. [Cabal ii], pp. 169–201.
[Mos83] Yiannis N., MoschovakisScales on coinductive sets, in Kechris et al. [Cabal iii], pp. 77–85, reprinted in [Cabal I], pp. 102–109.
[Mos09] Yiannis N., MoschovakisDescriptive set theory, second ed., Mathematical Surveys and Monographs, vol. 155, American Mathematical Society, 2009.Google Scholar
[Nee95] Itay, NeemanOptimal proofs of determinacy, The Bulletin of Symbolic Logic, vol. 1 (1995), no. 3, pp. 327–339.Google Scholar
[Nee00] Itay, NeemanUnravelingΠ11 sets, Annals of Pure andApplied Logic, vol. 106 (2000), no. 1-3, pp. 151–205.Google Scholar
[Nee02] Itay, NeemanOptimal proofs of determinacy II, Journal of Mathematical Logic, vol. 2 (2002), no. 2, pp. 227–258.Google Scholar
[Nee04] Itay, NeemanThe determinacy of long games, de Gruyter Series in Logic and its Applications, vol. 7, Walter de Gruyter, Berlin, 2004.Google Scholar
[Nee06] Itay, NeemanUnraveling Π11 sets, revisited, Israel Journal of Mathematics, vol. 152 (2006), pp. 181–203.Google Scholar
[Nee07] Itay, NeemanInner models and ultrafilters in L(ℝ), The Bulletin of Symbolic Logic, vol. 13 (2007), no. 1, pp. 31–53.Google Scholar
[Nee10] Itay, NeemanDeterminacy in L(ℝ), in Kanamori and Foreman [KF10], pp. 1877–1950.
[Nee16] Itay, NeemanAn inner models proof of the Kechris–Martin theorem, 2016, this volume.
[NS80A] Anil, Nerode and Richard A., ShoreReducibility orderings: theories, definability and automorphisms, Annals of Mathematical Logic, vol. 18 (1980), no. 1, pp. 61–89.Google Scholar
[NS80B] Anil, Nerode and Richard A., ShoreSecond order logic and first order theories of reducibility orderings, The Kleene Symposium (Proc. Sympos., Univ. Wisconsin, Madison, Wis., 1978) (Amsterdam) (Jon, Barwise, Kenneth, Kunen, and H. J., Keisler, editors), Studies in Logic and the Foundations of Mathematics, vol. 101, North-Holland, 1980, pp. 181–200.Google Scholar
[Nor78] Dag, NormannSet 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] Piergiorgio, Odifreddi Trees and degrees, this volume, originally published in Kechris et al. [Cabal ii], pp. 235–271.
[Odi89] Piergiorgio, OdifreddiClassical recursion theory, Studies in Logic and the Foundations of Mathematics, vol. 125, North-Holland, 1989.Google Scholar
[Odi99] Piergiorgio, OdifreddiClassical recursion theory. Vol. II, Studies in Logic and the Foundations of Mathematics, vol. 143, North-Holland, 1999.Google Scholar
[Oxt71] John C., OxtobyMeasure and category, Springer, 1971.Google Scholar
[PR81] David B., Posner and Robert W., RobinsonDegrees joining to 0', The Journal of Symbolic Logic, vol. 46 (1981), no. 4, pp. 714–722.Google Scholar
[Pos44] Emil L., PostRecursively enumerable sets of positive integers and their decision problems, Bulletin of the American Mathematical Society, vol. 50 (1944), pp. 284–316.Google Scholar
[Ric71] Wayne, RichterRecursively Mahlo ordinals and inductive definitions, Logic Colloquium ’69 (RobinO., Gandy and C. E. M., Yates, editors), North-Holland, 1971, pp. 273–288.Google Scholar
[RA74] Wayne, Richter and Peter, AczelInductive definitions and reflecting properties of admissible ordinals, in Fenstad and Hinman [FH74], pp. 301–381.
[Rog67] Hartley, RogersThe theory of recursive functions and effective computability, McGraw-Hill, 1967.Google Scholar
[Rud95] Mitchell, RudominerMouse sets definable in L(ℝ), Ph.D. thesis, University of California, Los Angeles, 1995.Google Scholar
[Sac61] Gerald E., SacksA minimal degree less than 0', Bulletin of the American Mathematical Society, vol. 67 (1961), pp. 416–419.Google Scholar
[Sac63] Gerald E., SacksDegrees of unsolvability, Annals of Mathematics Studies, vol. 55, Princeton University Press, 1963.Google Scholar
[Sac66] Gerald E., SacksDegrees of unsolvability, Princeton University Press, Princeton, N.J., 1966.Google Scholar
[Sac67] Gerald E., SacksOn a theorem of Lachlan and Martin, Proceedings of the American Mathematical Society, vol. 18 (1967), pp. 140–141.Google Scholar
[Sac71] Gerald E., SacksForcing with perfect closed sets, 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
[Sac90] Gerald E., SacksHigher recursion theory, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1990.Google Scholar
[SS87] Gerald E., Sacks and Theodore A., SlamanInadmissible forcing, Advances in Mathematics, vol. 66 (1987), no. 1, pp. 1–30.Google Scholar
[Sar09] Grigor, SargsyanA tale of hybrid mice, Ph.D. thesis, University of California, Berkeley, 2009.Google Scholar
[Sar13] Grigor, SargsyanA tale of hybrid mice, preprint, 2013.
[SS] Grigor, Sargsyan and John R., SteelCapturing by ℝ-mice, to appear.
[Sas74] Leonard P., SassoA minimal degree not realizing the least possible jump, The Journal of Symbolic Logic, vol. 39 (1974), pp. 571–573.Google Scholar
[SS] Ralf, Schindler and John R., SteelThe core model induction, to appear.
[SS09] Ralf, Schindler and John R., SteelThe self-iterability of L[E], The Journal of Symbolic Logic, vol. 74 (2009), no. 3, pp. 751– 779.Google Scholar
[Sch07] Farmer, SchlutzenbergMeasures in mice, Ph.D. thesis, University of California, Berkeley, 2007.Google Scholar
[SW90] Saharon, Shelah and W. Hugh, WoodinLarge 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
[Sho61] Joseph R., ShoenfieldThe problem of predicativity, Essays on the foundations of mathematics (Y., Bar-Hillel et al., editors), Magnes Press, Jerusalem, 1961, pp. 132–139.Google Scholar
[Sho66] Joseph R., Shoenfield A theorem on minimal degrees, The Journal of Symbolic Logic, vol. 31 (1966), pp. 539–544.
[Sho67] Joseph R., Shoenfield Mathematical logic, Addison-Wesley, 1967.
[SS99] Richard A., Shore and Theodore A., SlamanDefining the Turing jump, Mathematical Research Letters, vol. 6 (1999), no. 5–6, pp. 711– 722.Google Scholar
[Sil71A] Jack H., SilverThe consistency of the GCH with the existence of a measurable cardinal, Axiomatic set theory (Dana S., Scott, editor), Proceedings of Symposia in Pure Mathematics, vol. XIII, Part I, American Mathematical Society, 1971, pp. 391–395.Google Scholar
[Sil71B] Jack H., SilverMeasurable cardinals and Δ13 wellorderings, Annals of Mathematics, vol. 94 (1971), no. 2, pp. 414–446.Google Scholar
[Sim79] John, SimmsSemihypermeasurables and Π01 (Π11) games, Ph.D. thesis, Rockefeller University, 1979.Google Scholar
[Sim77] Stephen G., SimpsonFirst-order theory of the degrees of recursive unsolvability, Annals of Mathematics, vol. 105 (1977), no. 1, pp. 121–139.Google Scholar
[Sla85] Theodore A., SlamanReflection and forcing in E-recursion theory, Annals of Pure and Applied Logic, vol. 29 (1985), no. 1, pp. 79–106.Google Scholar
[Sla91] Theodore A., SlamanDegree structures, Proceedings of the International Congress of Mathematicians, Vol. I, II (Kyoto, 1990) (Tokyo), Mathematical Society of Japan, 1991, pp. 303–316.Google Scholar
[Sla05] Theodore A., SlamanAspects 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] Theodore A., Slaman and John R., SteelA construction degree invariant below 0, manuscript.
[SS88] Theodore A., Slaman and John R., SteelDefinable functions on degrees, this volume, originally published in Kechris et al. [Cabal iv], pp. 37–55.
[SS89] Theodore A., Slaman and John R., SteelComplementation in the Turing degrees, The Journal of Symbolic Logic, vol. 54 (1989), no. 1, pp. 160–176.Google Scholar
[Sol66] Robert M., SolovayOn the cardinality of Σ12 set of reals, Foundations of Mathematics: Symposium papers commemorating the 60th birthday of Kurt Gödel (Jack J., Bulloff, Thomas C., Holyoke, and S.W., Hahn, editors), Springer-Verlag, 1966, pp. 58–73.Google Scholar
[Sol67] Robert M., SolovayMeasurable cardinals and the axiom of determinateness, lecture notes prepared in connection with the Summer Institute of Axiomatic Set Theory held at UCLA, Summer 1967.
[Sol70] Robert M., SolovayA 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] Robert M., SolovayA Δ13 coding of the subsets of ωω, in Kechris and Moschovakis [Cabal i], pp. 133–150, reprinted in [Cabal II], pp. 346–363.
[Sol78B] Robert M., SolovayThe independence of DC from AD, in Kechris and Moschovakis [Cabal i], pp. 171–184.
[Spe71] Ernst, SpeckerRamsey's theorem does not hold in recursive set theory, Logic Colloquium ’69, North Holland, 1971, pp. 439–442.Google Scholar
[Spe56] Clifford, SpectorOn degrees of recursive unsolvability, Annals of Mathematics, vol. 65 (1956), pp. 581–592.Google Scholar
[Spe60] Clifford, SpectorHyperarithmetical quantifiers, Fundamenta Mathematicae, vol. 48 (1960), pp. 313–320.Google Scholar
[Spe61] Clifford, SpectorInductively defined sets of natural numbers, Infinitistic methods, Pergamon, 1961, pp. 97– 102.Google Scholar
[Ste82A] John R., SteelA classification of jump operators, The Journal of Symbolic Logic, vol. 47 (1982), no. 2, pp. 347–358.Google Scholar
[Ste82B] John R., SteelDeterminacy in the Mitchell models, Annals of Mathematical Logic, vol. 22 (1982), no. 2, pp. 109–125.Google Scholar
[Ste83A] John R., SteelScales in L(ℝ), in Kechris et al. [Cabal iii], pp. 107–156, reprinted in [Cabal I], pp. 130–175.
[Ste83B] John R., Steel Scales on Σ11 sets, inKechris et al. [Cabal iii], pp. 72–76, reprinted in [Cabal I], pp. 90–93.
[Ste93] John R., SteelInner models with many Woodin cardinals, Annals of Pure and Applied Logic, vol. 65 (1993), no. 2, pp. 185–209.Google Scholar
[Ste95A] John R., SteelHODL(ℝ) is a core model below T, The Bulletin of Symbolic Logic, vol. 1 (1995), no. 1, pp. 75–84.Google Scholar
[Ste95B] John R., SteelProjectively wellordered inner models, Annals of Pure and Applied Logic, vol. 74 (1995), no. 1, pp. 77–104.Google Scholar
[Ste96] John R., SteelThe core model iterability problem, Lecture Notes in Logic, no. 8, Springer-Verlag, Berlin, 1996.Google Scholar
[Ste05] John R., SteelPFA implies ADL(ℝ), The Journal of Symbolic Logic, vol. 70 (2005), no. 4, pp. 1255–1296.Google Scholar
[Ste08A] John R., SteelDerived models associated to mice, 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
[Ste08B] John R., SteelGames and scales. Introduction to Part I, in Kechris et al. [Cabal I], pp. 3–27.
[Ste08C] John R., SteelScales in K(ℝ), in Kechris et al. [Cabal I], pp. 176–208.
[Ste09] John R., SteelThe derived model theorem, Logic Colloquium 2006, Lecture Notes in Logic, vol. 19, Association for Symbolic Logic, 2009, pp. 280–327.Google Scholar
[Ste10A] John R., SteelNotes on V as a derived model, unpublished notes, 2010.
[Ste10B] John R., SteelAn outline of inner model theory, in Kanamori and Foreman [KF10], pp. 1595–1684.
[Ste16A] John R., SteelOrdinal definability in models of determinacy. Introduction to Part V, 2016, this volume.
[Ste16B] John R., SteelA theorem of Woodin on mouse sets, 2016, this volume.
[ST10] John R., Steel and Nam, Trang 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, 2010.
[SVW82] John R., Steel and Robert Van, WesepTwo consequences of determinacy consistent with choice, Transactions of the American Mathematical Society, vol. 272 (1982), no. 1, pp. 67–85.Google Scholar
[SW16] John R., Steel and W. Hugh, Woodin HOD as a core model, 2016, this volume. Simon Thomas
[Tho] John R., Steel and W. Hugh, WoodinUniversal Borel actions of countable groups, Accepted for publication in Groups, Geometry, and Dynamics.
[Tho02] John R., Steel and W. Hugh, WoodinSome applications of superrigidity to Borel equivalence relations, 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
[Tho09A] John R., Steel and W. Hugh, WoodinContinuous versus Borel reductions, Archive for Mathematical Logic, vol. 48 (2009), no. 8, pp. 761–770.Google Scholar
[Tho09B] John R., Steel and W. Hugh, WoodinMartin's conjecture and strong ergodicity, Archive for Mathematical Logic, vol. 48 (2009), no. 8, pp. 749–759.Google Scholar
[Tho09C] John R., SteelPopa superrigidity and countable Borel equivalence relations, Annals of Pure and Applied Logic, vol. 158 (2009), no. 3, pp. 175–189.Google Scholar
[Tit65] Dieter, TitgemeyerUntersuchungen ü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] B. A., TrahtenbrotOn autoreducibility, Soviet Mathematics, vol. 11 (1970), pp. 814–817, translated from Doklady Akademii Nauk SSSR, vol. 192 (1970), pp. 1224–1227.Google Scholar
[Tra12] Nam, Trang HOD in natural models of AD+, preprint, available at http://arXiv.org/abs/1201. 6128v1, 2012.
[Wei84] Benjamin, WeissMeasurable dynamics, 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
[Wil13] Trevor Miles, WilsonContributions to descriptive inner model theory, Ph.D. thesis, University of California, Berkeley, 2013.Google Scholar
[Woo83A] W. Hugh, Woodin AD and the uniqueness of the supercompact measures on Pω1 (λ), in Kechris et al. [Cabal iii], pp. 67–71.
[Woo83B] W. Hugh, WoodinSome consistency results in ZFC using AD, in Kechris et al. [Cabal iii], pp. 172–198.
[Woo88] W. Hugh, WoodinSupercompact 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] W. Hugh, WoodinA tt version of the Posner-Robinson theorem, 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
[Zhu10] Yizheng, ZhuThe 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, 2010.
[Zhu12] Yizheng, ZhuRealizing an AD+ model as a derived model of a premouse, Ph.D. thesis, National University of Singapore, 2012.Google Scholar
[Zim84] Robert J., ZimmerErgodic theory and semisimple groups, Monographs in Mathematics, vol. 81, Birkhäuser Verlag, Basel, 1984.Google Scholar

Save book to Kindle

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
  • Edited by Alexander S. Kechris, California Institute of Technology, Benedikt Löwe, Universiteit van Amsterdam, John R. Steel, University of California, Berkeley
  • Book: Ordinal Definability and Recursion Theory
  • Online publication: 05 December 2015
  • Chapter DOI: https://doi.org/10.1017/CBO9781139519694.018
Available formats
×

Save book to Dropbox

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
  • Edited by Alexander S. Kechris, California Institute of Technology, Benedikt Löwe, Universiteit van Amsterdam, John R. Steel, University of California, Berkeley
  • Book: Ordinal Definability and Recursion Theory
  • Online publication: 05 December 2015
  • Chapter DOI: https://doi.org/10.1017/CBO9781139519694.018
Available formats
×

Save book to Google Drive

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
  • Edited by Alexander S. Kechris, California Institute of Technology, Benedikt Löwe, Universiteit van Amsterdam, John R. Steel, University of California, Berkeley
  • Book: Ordinal Definability and Recursion Theory
  • Online publication: 05 December 2015
  • Chapter DOI: https://doi.org/10.1017/CBO9781139519694.018
Available formats
×