The Countable Admissible Ordinal Equivalence Relation

preprint2016arXivOpen access

Abstract

Let Fω1F_{ω_1} be the countable admissible ordinal equivalence relation defined on ω2{}^ω2 by x Fω1 yx \ F_{ω_1} \ y if and only if ω1x=ω1yω_1^x = ω_1^y. It will be shown that Fω1F_{ω_1} is classifiable by countable structures and must be classified by structures of high Scott rank. If EE and FF are equivalence relations, then EE is almost Borel reducible to FF if and only if there is a Borel reduction of EE to FF, except possibly on countably many EE-classes. Let Eω1E_{ω_1} denote the equivalence of order types of reals coding well-orderings. It will be shown that in the constructible universe LL and set generic extensions of LL, Eω1E_{ω_1} is not almost Borel reducible to Fω1F_{ω_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ω1F_{ω_1} in LL and set generic extensions of LL. This shows the consistency of a negative answer to a question of Sy-David Friedman.

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.