Paper detail

The Countable Admissible Ordinal Equivalence Relation

Let $F_{ω_1}$ be the countable admissible ordinal equivalence relation defined on ${}^ω2$ by $x \ F_{ω_1} \ y$ if and only if $ω_1^x = ω_1^y$. It will be shown that $F_{ω_1}$ is classifiable by countable structures and must be classified by structures of high Scott rank. If $E$ and $F$ are equivalence relations, then $E$ is almost Borel reducible to $F$ if and only if there is a Borel reduction of $E$ to $F$, except possibly on countably many $E$-classes. Let $E_{ω_1}$ denote the equivalence of order types of reals coding well-orderings. It will be shown that in the constructible universe $L$ and set generic extensions of $L$, $E_{ω_1}$ is not almost Borel reducible to $F_{ω_1}$, although a result of Zapletal implies such an almost Borel reduction exists if there is a measurable cardinal. Lastly, it will be shown that the isomorphism relation induced by a counterexample to Vaught's conjecture cannot be Borel reducible to $F_{ω_1}$ in $L$ and set generic extensions of $L$. This shows the consistency of a negative answer to a question of Sy-David Friedman.