Up to equimorphism, hyperarithmetic is recursive

DOI10.2178/jsl/1120224717zbMath1089.03036OpenAlexW1981473293MaRDI QIDQ5718664

Antonio Montalbán

Publication date: 16 January 2006

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1120224717

zbMATH Keywords

recursive presentabilityHausdorff rankrecursive linear orderingequimorphism typeshyperarithmetic linear ordering

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Theory of numerations, effectively presented structures (03D45)

Related Items

Equivalence between Fraïssé's conjecture and Jullien's theorem ⋮ Open Questions in Reverse Mathematics ⋮ Bi‐embeddability spectra and bases of spectra ⋮ Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting) ⋮ MASS PROBLEMS AND HYPERARITHMETICITY ⋮ Computable bi-embeddable categoricity ⋮ On the Equimorphism Types of Linear Orderings ⋮ Ranked structures and arithmetic transfinite recursion ⋮ Laver and set theory ⋮ Degrees of bi-embeddable categoricity of equivalence structures ⋮ On bi-embeddable categoricity of algebraic structures ⋮ INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS ⋮ Degrees of bi-embeddable categoricity ⋮ ANALYTIC EQUIVALENCE RELATIONS SATISFYING HYPERARITHMETIC-IS-RECURSIVE ⋮ THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS ⋮ ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS

Cites Work

• Degrees of orderings not isomorphic to recursive linear orderings
• The metamathematics of scattered linear orderings
• Computability-theoretic and proof-theoretic aspects of partial and linear orderings
• Computable structures and the hyperarithmetical hierarchy
• On Fraissé's order type conjecture
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item