Analytic Equivalence Relations and the Forcing Method

Bulletin of Symbolic Logic 19 (4):473-490 (2013)
  Copy   BIBTEX

Abstract

I describe several ways in which forcing arguments can be used to yield clean and conceptual proofs of nonreducibility, ergodicity and other results in the theory of analytic equivalence relations. In particular, I present simple Borel equivalence relationsE, Fsuch that a natural proof of nonreducibility ofEtoFuses the independence of the Singular Cardinal Hypothesis at ℵω.

Categories

Keywords

Reprint years

DOI

10.1017/s107989860001057x

Links

PhilArchive



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

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

Analytic equivalence relations and the forcing method.Jindřich Zapletal - 2013 - Bulletin of Symbolic Logic 19 (4):473-490.
Thin equivalence relations and effective decompositions.Greg Hjorth - 1993 - Journal of Symbolic Logic 58 (4):1153-1164.
Thin equivalence relations and inner models.Philipp Schlicht - 2014 - Annals of Pure and Applied Logic 165 (10):1577-1625.
Cofinal families of Borel equivalence relations and quasiorders.Christian Rosendal - 2005 - Journal of Symbolic Logic 70 (4):1325-1340.
Thin Equivalence Relations and Effective Decompositions.Greg Hjorth - 1994 - Journal of Symbolic Logic 59 (4):1153-1164.
The {L}aczkovich—{K}omjáth property for coanalytic equivalence relations.Su Gao, Steve Jackson & Vincent Kieftenbeld - 2010 - Journal of Symbolic Logic 75 (3):1091-1101.
Analytic equivalence relations and bi-embeddability.Sy-David Friedman & Luca Motto Ros - 2011 - Journal of Symbolic Logic 76 (1):243 - 266.
Maximal R.e. Equivalence relations.Jeffrey S. Carroll - 1990 - Journal of Symbolic Logic 55 (3):1048-1058.
Infinite Time Decidable Equivalence Relation Theory.Samuel Coskey & Joel David Hamkins - 2011 - Notre Dame Journal of Formal Logic 52 (2):203-228.
Ulm Classification of Analytic Equivalence Relations in Generic Universes.Vladimir Kanovei - 1998 - Mathematical Logic Quarterly 44 (3):287-303.
Analytic equivalence relations and bi-embeddability.Sy-David Friedman & Luca Motto Ros - 2011 - Journal of Symbolic Logic 76 (1):243-266.
? 0 N -equivalence relations.Andrea Sorbi - 1982 - Studia Logica 41 (4):351-358.
On Polynomial-Time Relation Reducibility.Su Gao & Caleb Ziegler - 2017 - Notre Dame Journal of Formal Logic 58 (2):271-285.
F σ equivalence relations and Laver forcing.Michal Doucha - 2014 - Journal of Symbolic Logic 79 (2):644-653.
On Σ1 1 equivalence relations over the natural numbers.Ekaterina B. Fokina & Sy-David Friedman - 2012 - Mathematical Logic Quarterly 58 (1-2):113-124.

Analytics

Added to PP
2019-04-25

Downloads
19 (#778,470)

6 months
6 (#504,917)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The Classification Problem for Automorphisms of C*-Algebras.Martino Lupini - 2015 - Bulletin of Symbolic Logic 21 (4):402-424.

Add more citations

References found in this work

Covering analytic sets by families of closed sets.Sławomir Solecki - 1994 - Journal of Symbolic Logic 59 (3):1022-1031.
Dominating and unbounded free sets.Slawomir Solecki & Otmar Spinas - 1999 - Journal of Symbolic Logic 64 (1):75-80.

Add more references