Up to equimorphism, hyperarithmetic is recursive

DOI10.2178/JSL/1120224717MaRDI QIDQ5718664zbMATH OpenOpenAlexFDO

Authors 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

equimorphism typesHausdorff rankhyperarithmetic linear orderingrecursive linear orderingrecursive presentability

Mathematics Subject Classification ID

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

Recommendations

• On the Equimorphism Types of Linear Orderings
• Finite condensations of recursive linear orders
• Linear Order Types of Nonrecursive Presentability
• Equimorphism invariants for scattered linear orderings
• Degrees of orderings not isomorphic to recursive linear orderings

Cites work

• Computability-theoretic and proof-theoretic aspects of partial and linear orderings
• Computable structures and the hyperarithmetical hierarchy
• Degrees of orderings not isomorphic to recursive linear orderings
• scientific article; zbMATH DE number 3767656 (Why is no real title available?)
• scientific article; zbMATH DE number 194101 (Why is no real title available?)
• scientific article; zbMATH DE number 1226875 (Why is no real title available?)
• scientific article; zbMATH DE number 1302869 (Why is no real title available?)
• scientific article; zbMATH DE number 1426369 (Why is no real title available?)
• On Fraissé's order type conjecture
• The metamathematics of scattered linear orderings

Cited in

(18)

• Computable bi-embeddable categoricity
• On bi-embeddable categoricity of algebraic structures
• Degrees of bi-embeddable categoricity of equivalence structures
• Equivalence between Fraïssé's conjecture and Jullien's theorem
• Equimorphy: the case of chains
• Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting)
• Open questions in reverse mathematics
• MASS PROBLEMS AND HYPERARITHMETICITY
• On the Equimorphism Types of Linear Orderings
• Degrees of bi-embeddable categoricity
• Ordinal analysis of partial combinatory algebras
• Bi‐embeddability spectra and bases of spectra
• Analytic equivalence relations satisfying hyperarithmetic-is-recursive
• Ranked structures and arithmetic transfinite recursion
• INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
• THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS
• Interrelations between the length, the structure and the cardinality of a chain
• Laver and set theory

This page was built for publication: Up to equimorphism, hyperarithmetic is recursive

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