Skip to main content
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 1
  • Cited by
    This chapter has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Marks, Andrew S. 2017. Uniformity, universality, and computability theory. Journal of Mathematical Logic, Vol. 17, Issue. 01, p. 1750003.

  • Print publication year: 2016
  • Online publication date: December 2015

Martin's conjecture, arithmetic equivalence, and countable Borel equivalence relations


Introduction. There is a fascinating interplay and overlap between recursion theory and descriptive set theory. A particularly beautiful source of such interaction has been Martin's conjecture on Turing invariant functions. This longstanding open problem in recursion theory has connected to many problems in descriptive set theory, particularly in the theory of countable Borel equivalence relations.

In this paper, we shall give an overview of some work that has been done on Martin's conjecture, and applications that it has had in descriptive set theory. We will present a long unpublished result of Slaman and Steel that arithmetic equivalence is a universal countable Borel equivalence relation. This theorem has interesting corollaries for the theory of universal countable Borel equivalence relations in general. We end with some open problems, and directions for future research.

Martin's conjecture. Martin's conjecture on Turing invariant functions is one of the oldest and deepest open problems on the global structure of the Turing degrees. Inspired by Sacks’ question on the existence of a degree-invariant solution to Post's problem [Sac66], Martin made a sweeping conjecture that says in essence, the only nontrivial definable Turing invariant functions are the Turing jump and its iterates through the transfinite.

Our basic references for descriptive set theory and effective descriptive set theory are the books of Kechris [Kec95] and Sacks [Sac90]. Let T be Turing reducibility on the Cantor space ω2, and let ≡T be Turing equivalence. Given x ∈ω2, let x′ be the Turing jump of x. The Turing degree of a real x∈ω2 is the T equivalence class of x. A Turing invariant function is a function such that for all reals x, y ∈ ω2, if x ≡T y, then f(x) T f(y). The Turing invariant functions are those which induce functions on the Turing degrees.

With the axiom of choice, we can construct many pathological Turing invariant functions. Martin's conjecture is set in the context of ZF+DC+AD, where AD is the axiom of determinacy. We assume ZF+DC+AD for the rest of this section. The results we will discuss all “localize” so that the assumption of AD essentially amounts to studying definable functions assuming definable determinacy, for instance, Borel functions using Borel determinacy.

Recommend this book

Email your librarian or administrator to recommend adding this book to your organisation's collection.

Ordinal Definability and Recursion Theory
  • Online ISBN: 9781139519694
  • Book DOI:
Please enter your name
Please enter a valid email address
Who would you like to send this to *
[ACH01] Alessandro, Andretta, Riccardo, Camerlo, and Gregory, HjorthConjugacy equivalence relation on subgroups, Fundamenta Mathematicae, vol. 167 (2001), no. 3, pp. 189–212.
[Bec88] Howard S., BeckerA characterization of jump operators, The Journal of Symbolic Logic, vol. 53 (1988), no. 3, pp. 708–728.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[JKL02] Stephen, Jackson, Alexander S., Kechris, and Alain, LouveauCountable Borel equivalence relations, Journal of Mathematical Logic, vol. 2 (2002), no. 1, pp. 1–80.
[JJW92] H., Judah, W., Just, and W. Hugh, WoodinSet theory of the continuum, MSRI publications, vol. 26, Springer-Verlag, 1992.
[Kec91] Alexander S., KechrisAmenable equivalence relations and Turing degrees, The Journal of Symbolic Logic, vol. 56 (1991), no. 1, pp. 182–194.
[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.
[Cabal iv] Alexander S., Kechris, Donald A., Martin, and John R., SteelCabal seminar 81–85, Lecture Notes in Mathematics, no. 1333, Berlin, Springer, 1988.
[Cabal i] Alexander S., Kechris and Yiannis N., MoschovakisCabal seminar 76–77, Lecture Notes in Mathematics, no. 689, Berlin, Springer, 1978.
[Lac75] Alistair H., LachlanUniform enumeration operations, The Journal of Symbolic Logic, vol. 40 (1975), no. 3, pp. 401–409.
[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.
[Mar12] Andrew, MarksRecursion theory and countable Borel equivalence relations, Ph.D. thesis, Department of Mathematics, University of California, Berkeley, 2012.
[Mar14] Andrew, MarksUniformity, universality, and recursion theory, (2014), Preprint.
[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.
[Mon03] Antonio, MontalbánEmbedding jump upper semilattices into the Turing degrees, The Journal of Symbolic Logic, vol. 68 (2003), no. 3, pp. 989–1014.
[Sac66] Gerald E., SacksDegrees of unsolvability, Princeton University Press, Princeton, N.J., 1966.
[Sac90] Gerald E., SacksHigher recursion theory, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1990.
[SS99] Richard A., Shore and Theodore A., SlamanDefining the Turing jump, Mathematical Research Letters, vol. 6 (1999), no. 5–6, pp. 711–722.
[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.
[SS88] Theodore A., Slaman and John R., SteelDefinable functions on degrees, this volume, originally published in Kechris et al. [Cabal iv], pp. 37–55.
[Ste82A] John R., SteelA classification of jump operators, The Journal of Symbolic Logic, vol. 47 (1982), no. 2, pp. 347–358.
[Tho] Simon, ThomasUniversal Borel actions of countable groups, Accepted for publication in Groups, Geometry, and Dynamics.
[Tho02] Simon, ThomasSome 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.
[Tho09A] Simon, ThomasContinuous versus Borel reductions, Archive for Mathematical Logic, vol. 48 (2009), no. 8, pp. 761–770.
[Tho09B] Simon, ThomasMartin's conjecture and strong ergodicity, Archive for Mathematical Logic, vol. 48 (2009), no. 8, pp. 749–759.
[Tho09C] Simon, ThomasPopa superrigidity and countable Borel equivalence relations, Annals of Pure and Applied Logic, vol. 158 (2009), no. 3, pp. 175–189.
[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.
[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.
[Zim84] Robert J., ZimmerErgodic theory and semisimple groups, Monographs in Mathematics, vol. 81, Birkhäuser Verlag, Basel, 1984.