The countable admissible ordinal equivalence relation

DOI10.1016/J.APAL.2016.12.002MaRDI QIDQ2400501zbMATH OpenOpenAlexFDO

Publication date 29 August 2017

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

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

Borel reducibility Vaught's conjecture admissible sets Scott rank constructibility

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)

Abstract: Let

F_{o m e g a_{1}}

be the countable admissible ordinal equivalence relation defined on

^{o} m e g a 2

by

x F_{o m e g a_{1}} y

if and only if

o m e g a_{1}^{x} = o m e g a_{1}^{y}

. It will be shown that

F_{o m e g 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_{o m e g 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_{o m e g a_{1}}

is not almost Borel reducible to

F_{o m e g 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_{o m e g 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.

Recommendations

Cites work

Cited in

(2)

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)