On the Equimorphism Types of Linear Orderings

DOI10.2178/bsl/1174668219zbMath1129.03024MaRDI QIDQ3594486

Antonio Montalbán

Publication date: 8 August 2007

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

Full work available at URL: https://semanticscholar.org/paper/11178946cdeb403dcedb9cc3c9b9e84dff189943

zbMATH Keywords

reverse mathematics; computability; linear orderings; quasi-orderings; Fraisse; Jullien; signed tree

Mathematics Subject Classification ID

06A05: Total orders

03D80: Applications of computability and recursion theory

03F35: Second- and higher-order arithmetic and fragments

Related Items

Isomorphism relations on computable structures, Binary subtrees with few labeled paths, On Müller context-free grammars, Countably complementable linear orderings, On Fraïssé's conjecture for linear orders of finite Hausdorff rank, Necessary use of induction in a reversal, On Σ¹ ₁ equivalence relations over the natural numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degrees of orderings not isomorphic to recursive linear orderings
• Stability of recursive structures in arithmetical degrees
• Set theory. An introduction to independence proofs
• Proof-theoretic investigations on Kruskal's theorem
• Model theory and algebra. A memorial tribute to Abraham Robinson
• Computability-theoretic and proof-theoretic aspects of partial and linear orderings
• Computable structures and the hyperarithmetical hierarchy
• On Fraissé's order type conjecture
• An order type decomposition theorem
• On the strength of Ramsey's theorem for pairs
• Hierarchies of number-theoretic predicates
• Recursive well-orderings
• Forcing with tagged trees
• Hierarchies of Boolean algebras
• Up to equimorphism, hyperarithmetic is recursive