Analytic equivalence relations satisfying hyperarithmetic-is-recursive

DOI10.1017/FMS.2015.5MaRDI QIDQ5250130zbMATH OpenOpenAlexFDO

Authors Antonio Montalbán

Publication date 18 May 2015

Published in Forum of Mathematics, Sigma (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

\(\Sigma_{2}^{1}\)-determinacyhyperarithmetic reals

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Descriptive set theory (03E15) Second- and higher-order arithmetic and fragments (03F35)

Abstract: We prove, in ZF+$$-determinacy, that for any analytic equivalence relation $E$, the following three statements are equivalent: (1) $E$ does not have perfectly many classes, (2) $E$ satisfies hyperarithmetic-is-recursive on a cone, and (3) relative to some oracle, for every equivalence class $[Y{]}_E$ we have that a real $X$ computes a member of the equivalence class if and only if $o{m}_1^{X}geqo{m}_1^{[Y]}$. We also show that the implication from (1) to (2) is equivalent to the existence of sharps over $ZF$.

Recommendations

• A recursion theoretic property of \(\mathbf{\Sigma ^1_1}\) equivalence relations
• Degree-invariant, analytic equivalence relations without perfectly many classes
• Glimm-Effros for coanalytic equivalence relations
• scientific article; zbMATH DE number 3875257
• Complete analytic equivalence relations

Cites work

• A computability theoretic equivalent to Vaught's conjecture
• Analytic determinacy and 0^#
• Counting the number of equivalence classes of Borel and coanalytic equivalence relations
• scientific article; zbMATH DE number 1908324 (Why is no real title available?)
• Infinitary properties of abelian torsion groups
• On Fraissé's order type conjecture
• On the Equimorphism Types of Linear Orderings
• Ranked structures and arithmetic transfinite recursion
• Recursive well-orderings
• The axiom of determinateness and reduction principles in the analytical hierarchy
• Up to equimorphism, hyperarithmetic is recursive

Cited in

(9)

• Complete analytic equivalence relations
• Degree-invariant, analytic equivalence relations without perfectly many classes
• Analytic equivalence relations and bi-embeddability
• On a question of Kalimullin
• A recursion theoretic property of \(\mathbf{\Sigma ^1_1}\) equivalence relations
• DEGREE SPECTRA OF ANALYTIC COMPLETE EQUIVALENCE RELATIONS
• Equivalence relations and determinacy
• A recursion theoretic characterization of the topological Vaught conjecture in the Zermelo-Fraenkel set theory
• Bi‐embeddability spectra and bases of spectra

This page was built for publication: Analytic equivalence relations satisfying hyperarithmetic-is-recursive

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