Continuous versus Borel reductions

Archive for Mathematical Logic 48 (8):761-770 (2009)
  Copy   BIBTEX

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

Categories

Keywords

Reprint years

DOI

10.1007/s00153-009-0149-z

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Infinite Time Decidable Equivalence Relation Theory.Samuel Coskey & Joel David Hamkins - 2011 - Notre Dame Journal of Formal Logic 52 (2):203-228.
Borel equivalence relations which are highly unfree.Greg Hjorth - 2008 - Journal of Symbolic Logic 73 (4):1271-1277.
Cofinal families of Borel equivalence relations and quasiorders.Christian Rosendal - 2005 - Journal of Symbolic Logic 70 (4):1325-1340.
Borel structures and borel theories.Greg Hjorth & André Nies - 2011 - Journal of Symbolic Logic 76 (2):461 - 476.
Martin’s conjecture and strong ergodicity.Simon Thomas - 2009 - Archive for Mathematical Logic 48 (8):749-759.
On Borel equivalence relations in generalized Baire space.Sy-David Friedman & Tapani Hyttinen - 2012 - Archive for Mathematical Logic 51 (3-4):299-304.
Actions of non-compact and non-locally compact polish groups.Sławomir Solecki - 2000 - Journal of Symbolic Logic 65 (4):1881-1894.
Borel and baire reducibility.Harvey Friedman - manuscript
Analytic equivalence relations and bi-embeddability.Sy-David Friedman & Luca Motto Ros - 2011 - Journal of Symbolic Logic 76 (1):243 - 266.
Borel reductions and cub games in generalised descriptive set theory.Vadim Kulikov - 2013 - Journal of Symbolic Logic 78 (2):439-458.
The Borel Complexity of Isomorphism for Theories with Many Types.David Marker - 2007 - Notre Dame Journal of Formal Logic 48 (1):93-97.
Bi-Borel Reducibility of Essentially Countable Borel Equivalence Relations.Greg Hjorth - 2005 - Journal of Symbolic Logic 70 (3):979 - 992.
The relation of recursive isomorphism for countable structures.Riccardo Camerlo - 2002 - Journal of Symbolic Logic 67 (2):879-895.
We announce two new dichotomy theorems for Borel equivalence rela-tions, and present the results in context by giving an overview of related recent developments. § 1. Introduction. For X a Polish (ie, separable, completely metrizable) space and E a Borel equivalence relation on X, a (complete) classification. [REVIEW]Greg Hjorth & Alexander S. Kechris - 1997 - Bulletin of Symbolic Logic 3 (3):329-346.

Analytics

Added to PP
2013-11-23

Downloads
38 (#409,607)

6 months
4 (#790,687)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

A descriptive Main Gap Theorem.Francesco Mangraviti & Luca Motto Ros - 2020 - Journal of Mathematical Logic 21 (1):2050025.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Minimal degrees and the jump operator.S. B. Cooper - 1973 - Journal of Symbolic Logic 38 (2):249-271.
Martin’s conjecture and strong ergodicity.Simon Thomas - 2009 - Archive for Mathematical Logic 48 (8):749-759.
Popa superrigidity and countable Borel equivalence relations.Simon Thomas - 2009 - Annals of Pure and Applied Logic 158 (3):175-189.

View all 6 references / Add more references