Dichotomy Theorems for Families of Non-Cofinal Essential Complexity

preprint2014arXivOpen access

Abstract

We prove that for every Borel equivalence relation EE, either EE is Borel reducible to E_0\mathbb{E}\_0, or the family of Borel equivalence relations incompatible with EE has cofinal essential complexity. It follows that if FF is a Borel equivalence relation and F\cal F is a family of Borel equivalence relations of non-cofinal essential complexity which together satisfy the dichotomy that for every Borel equivalence relation EE, either E∈FE\in {\cal F} or FF is Borel reducible to EE, then F\cal F consists solely of smooth equivalence relations, thus the dichotomy is equivalent to a known theorem.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.