English

The Countable Admissible Ordinal Equivalence Relation

Logic 2016-02-01 v1

Abstract

Let Fω1F_{\omega_1} be the countable admissible ordinal equivalence relation defined on ω2{}^\omega 2 by x Fω1 yx \ F_{\omega_1} \ y if and only if ω1x=ω1y\omega_1^x = \omega_1^y. It will be shown that Fω1F_{\omega_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_{\omega_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_{\omega_1} is not almost Borel reducible to Fω1F_{\omega_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_{\omega_1} in LL and set generic extensions of LL. This shows the consistency of a negative answer to a question of Sy-David Friedman.

Keywords

Cite

@article{arxiv.1601.07924,
  title  = {The Countable Admissible Ordinal Equivalence Relation},
  author = {William Chan},
  journal= {arXiv preprint arXiv:1601.07924},
  year   = {2016}
}
R2 v1 2026-06-22T12:38:56.275Z