The Countable Admissible Ordinal Equivalence Relation
Abstract
Let Fω1 be the countable admissible ordinal equivalence relation defined on ω 2 by x \ Fω1 \ y if and only if ω1x = ω1y. 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.