Dichotomy Theorems for Families of Non-Cofinal Essential Complexity
classification
🧮 math.LO
math.GN
keywords
borelequivalencecomplexitydichotomyessentialrelationrelationseither
read the original abstract
We prove that for every Borel equivalence relation $E$, either $E$ is Borel reducible to $\mathbb{E}\_0$, or the family of Borel equivalence relations incompatible with $E$ has cofinal essential complexity. It follows that if $F$ is a Borel equivalence relation and $\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 $E$, either $E\in {\cal F}$ or $F$ is Borel reducible to $E$, then $\cal F$ consists solely of smooth equivalence relations, thus the dichotomy is equivalent to a known theorem.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.