The countable admissible ordinal equivalence relation

DOI10.1016/J.APAL.2016.12.002zbMATH Open1422.03097arXiv1601.07924OpenAlexW2963588091MaRDI QIDQ2400501FDOQ2400501

Authors: Yanyan Li 

Publication date: 29 August 2017

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Abstract: Let $F_{omeg{a}_1}$ be the countable admissible ordinal equivalence relation defined on ${}^{o}mega2$ by $x{F}_{omeg{a}_1}y$ if and only if $omeg{a}_1^x=omeg{a}_1^y$. It will be shown that $F_{omeg{a}_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_{omeg{a}_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_{omeg{a}_1}$ is not almost Borel reducible to $F_{omeg{a}_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_{omeg{a}_1}$ in $L$ and set generic extensions of $L$. This shows the consistency of a negative answer to a question of Sy-David Friedman.

Full work available at URL: https://arxiv.org/abs/1601.07924

Recommendations

• New Directions in Descriptive Set Theory
• scientific article; zbMATH DE number 2204765
• Borel equivalence relations and classifications of countable models
• scientific article; zbMATH DE number 2236691
• An analytic equivalence relation not arising from a Polish group action

zbMATH Keywords

Borel reducibilityVaught's conjectureadmissible setsScott rankconstructibility

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Descriptive set theory (03E15) Consistency and independence results (03E35)

Cites Work

• Invariant descriptive set theory
• Model Theory
• Title not available (Why is that?)
• Forcing idealized
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recursive Pseudo-Well-Orderings
• Scott sentences and admissible sets
• Countable admissible ordinals and hyperdegrees
• An example concerning Scott heights
• Title not available (Why is that?)
• Computable trees of Scott rank ω₁^CK, and computable approximation
• Terminal notions in set theory
• The topological Vaught's conjecture and minimal counterexamples
• An analytic equivalence relation not arising from a Polish group action

Cited In (2)

• AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS
• EQUIVALENCE RELATIONS WHICH ARE BOREL SOMEWHERE

This page was built for publication: The countable admissible ordinal equivalence relation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2400501)