Forcing Constructions and Countable Borel Equivalence Relations

Journal of Symbolic Logic 87 (3):873-893 (2022)
  Copy   BIBTEX

Abstract

We prove a number of results about countable Borel equivalence relations with forcing constructions and arguments. These results reveal hidden regularity properties of Borel complete sections on certain orbits. As consequences they imply the nonexistence of Borel complete sections with certain features.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 104,026

External links

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

Through your library

Similar books and articles

Superrigidity and countable Borel equivalence relations.Simon Thomas - 2003 - Annals of Pure and Applied Logic 120 (1-3):237-262.
Property τ and countable borel equivalence relations.Simon Thomas - 2007 - Journal of Mathematical Logic 7 (1):1-34.
Uniformity, universality, and computability theory.Andrew S. Marks - 2017 - Journal of Mathematical Logic 17 (1):1750003.
Equivalence of generics.Iian B. Smythe - 2022 - Archive for Mathematical Logic 61 (5):795-812.
Popa superrigidity and countable Borel equivalence relations.Simon Thomas - 2009 - Annals of Pure and Applied Logic 158 (3):175-189.

Analytics

Added to PP
2022-04-08

Downloads
29 (#845,411)

6 months
2 (#1,351,201)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

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.

Add more references