Popa superrigidity and countable Borel equivalence relations

Annals of Pure and Applied Logic 158 (3):175-189 (2009)
  Copy   BIBTEX

Abstract

We present some applications of Popa’s Superrigidity Theorem to the theory of countable Borel equivalence relations. In particular, we show that the universal countable Borel equivalence relation E∞ is not essentially free

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2007.08.003

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,758

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

Superrigidity and countable Borel equivalence relations.Simon Thomas - 2003 - Annals of Pure and Applied Logic 120 (1-3):237-262.
Continuous versus Borel reductions.Simon Thomas - 2009 - Archive for Mathematical Logic 48 (8):761-770.
Borel equivalence relations which are highly unfree.Greg Hjorth - 2008 - Journal of Symbolic Logic 73 (4):1271-1277.
The relation of recursive isomorphism for countable structures.Riccardo Camerlo - 2002 - Journal of Symbolic Logic 67 (2):879-895.
Infinite Time Decidable Equivalence Relation Theory.Samuel Coskey & Joel David Hamkins - 2011 - Notre Dame Journal of Formal Logic 52 (2):203-228.
Cofinal families of Borel equivalence relations and quasiorders.Christian Rosendal - 2005 - Journal of Symbolic Logic 70 (4):1325-1340.
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.
Bi-Borel Reducibility of Essentially Countable Borel Equivalence Relations.Greg Hjorth - 2005 - Journal of Symbolic Logic 70 (3):979 - 992.
On Borel equivalence relations in generalized Baire space.Sy-David Friedman & Tapani Hyttinen - 2012 - Archive for Mathematical Logic 51 (3-4):299-304.
Property τ and countable borel equivalence relations.Simon Thomas - 2007 - Journal of Mathematical Logic 7 (1):1-34.
The Borel Complexity of Isomorphism for Theories with Many Types.David Marker - 2007 - Notre Dame Journal of Formal Logic 48 (1):93-97.
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.

Analytics

Added to PP
2013-12-22

Downloads
19 (#818,671)

6 months
4 (#846,927)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Superrigidity and countable Borel equivalence relations.Simon Thomas - 2003 - Annals of Pure and Applied Logic 120 (1-3):237-262.
Martin’s conjecture and strong ergodicity.Simon Thomas - 2009 - Archive for Mathematical Logic 48 (8):749-759.
Uniformity, universality, and computability theory.Andrew S. Marks - 2017 - Journal of Mathematical Logic 17 (1):1750003.
Continuous versus Borel reductions.Simon Thomas - 2009 - Archive for Mathematical Logic 48 (8):761-770.
Equivalence of generics.Iian B. Smythe - 2022 - Archive for Mathematical Logic 61 (5):795-812.

Add more citations

References found in this work

Countable borel equivalence relations.S. Jackson, A. S. Kechris & A. Louveau - 2002 - Journal of Mathematical Logic 2 (01):1-80.
Superrigidity and countable Borel equivalence relations.Simon Thomas - 2003 - Annals of Pure and Applied Logic 120 (1-3):237-262.
Borel equivalence relations which are highly unfree.Greg Hjorth - 2008 - Journal of Symbolic Logic 73 (4):1271-1277.

Add more references