Abstract
We prove that for every Borel equivalence relation , either is Borel reducible to , or the family of Borel equivalence relations incompatible with has cofinal essential complexity. It follows that if is a Borel equivalence relation and is a family of Borel equivalence relations of non-cofinal essential complexity which together satisfy the dichotomy that for every Borel equivalence relation , either or is Borel reducible to , then consists solely of smooth equivalence relations, thus the dichotomy is equivalent to a known theorem.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.