Skip to main content
SpringerLink
Log in

Continuous versus Borel reductions

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

We present some natural examples of countable Borel equivalence relations E, F with E ≤ B  F such that there does not exist a continuous reduction from E to F.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Champetier C.: L’espace des groupes de type fini. Topology 39, 657–680 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Cooper S.B.: Minimal degrees and the jump operator. J. Symb. Logic 38, 249–271 (1973)

    Article  MATH  Google Scholar 

  3. Dougherty R., Jackson S., Kechris A.S.: The structure of hyperfinite Borel equivalence relations. Trans. Am. Math. Soc. 341, 193–225 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dougherty, R., Kechris, A.S.: How many turing degrees are there? In: Computability Theory and its Applications (Boulder, CO, 1999). Contemp. Math. 257, 83–94, Am. Math. Soc. (2000)

  5. Feldman J., Moore C.C.: Ergodic equivalence relations, cohomology and von Neumann algebras, I. Trans. Am. Math. Soc. 234, 289–324 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kanovei, V.: Borel Equivalence Relations: Structure and Classification, vol. 44. University Lecture Series, American Mathematical Society, Providence (2008)

  7. Kechris, A.S.: “AD+Uniformization” is equivalent to “Half \({AD_\mathbb{R}}\)”. In: Cabal Seminar 81–85, Lecture Notes in Math, vol. 1333, pp. 98–102. Springer, Berlin (1988)

  8. Kechris, A.S., Moschovakis, Y.N. (eds.): Cabal Seminar 76–77, vol. 689. Lecture Notes in Math, Springer, Berlin (1978)

  9. Lyndon R.C., Schupp P.E.: Combinatorial Group Theory. Springer, Berlin (1977)

    MATH  Google Scholar 

  10. Rogers H. Jr.: Theory of Recursive Functions and Effective Computability 2nd edn. MIT Press, Cambridge (1987)

    Google Scholar 

  11. Slaman, T.A., Steel, J.R.: Definable functions on degrees. In: Cabal Seminar 81–85, vol. 1333, pp. 37–55. Lecture Notes in Math, Springer, Berlin (1988)

  12. Thomas S.: Popa superrigidity and countable Borel equivalence relations. Ann. Pure Appl. Logic 158, 175–189 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  13. Thomas, S.: Martin’s conjecture and strong ergodicity. Arch. Math. Logic. doi:10.1007/s00153-009-0148-0 (2008)

  14. Thomas S., Velickovic B.: On the complexity of the isomorphism relation for finitely generated groups. J. Algebra 217, 352–373 (1999)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Department, Rutgers University, 110 Frelinghuysen Road, Piscataway, NJ, 08854-8019, USA

    Simon Thomas

Authors
  1. Simon Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Simon Thomas.

Additional information

Research partially supported by NSF Grant DMS 0600940.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Thomas, S. Continuous versus Borel reductions. Arch. Math. Logic 48, 761–770 (2009). https://doi.org/10.1007/s00153-009-0149-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-009-0149-z

Keywords

Mathematics Subject Classification (2000)

Search

Navigation