On the Equimorphism Types of Linear Orderings
From MaRDI portal
Publication:3594486
DOI10.2178/BSL/1174668219zbMATH Open1129.03024OpenAlexW1996647670MaRDI QIDQ3594486FDOQ3594486
Authors: Antonio Montalbán 
Publication date: 8 August 2007
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/11178946cdeb403dcedb9cc3c9b9e84dff189943
Recommendations
- Equivalence between Fraïssé's conjecture and Jullien's theorem
- Up to equimorphism, hyperarithmetic is recursive
- On Fraïssé's conjecture for linear orders of finite Hausdorff rank
- On computable self-embeddings of computable linear orderings
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings
Total orders (06A05) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35)
Cites Work
- Set theory. An introduction to independence proofs
- Title not available (Why is that?)
- Computable structures and the hyperarithmetical hierarchy
- On Fraissé's order type conjecture
- Title not available (Why is that?)
- On the strength of Ramsey's theorem for pairs
- Title not available (Why is that?)
- Proof-theoretic investigations on Kruskal's theorem
- Hierarchies of Boolean algebras
- Forcing with tagged trees
- Model theory and algebra. A memorial tribute to Abraham Robinson
- Degrees of orderings not isomorphic to recursive linear orderings
- Hierarchies of number-theoretic predicates
- Title not available (Why is that?)
- Recursive well-orderings
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings
- Stability of recursive structures in arithmetical degrees
- An order type decomposition theorem
- Up to equimorphism, hyperarithmetic is recursive
Cited In (22)
- Embeddings between well-orderings: computability-theoretic reductions
- Analytic equivalence relations satisfying hyperarithmetic-is-recursive
- INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
- On Ehrenfeucht-Fraïssé equivalence of linear orderings
- Computable bi-embeddable categoricity
- Isomorphism relations on computable structures
- Equimorphy: the case of chains
- Degrees of bi-embeddable categoricity of equivalence structures
- Countably complementable linear orderings
- Equivalence between Fraïssé's conjecture and Jullien's theorem
- On bi-embeddable categoricity of algebraic structures
- Classes of structures with no intermediate isomorphism problems
- Necessary use of \(\Sigma ^1_{1}\) induction in a reversal
- On Müller context-free grammars
- Degree-invariant, analytic equivalence relations without perfectly many classes
- Binary subtrees with few labeled paths
- On Σ1 1 equivalence relations over the natural numbers
- On Fraïssé's conjecture for linear orders of finite Hausdorff rank
- Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
- Up to equimorphism, hyperarithmetic is recursive
- Title not available (Why is that?)
- Fraïssé's conjecture in \(\Pi_1^1\)-comprehension
This page was built for publication: On the Equimorphism Types of Linear Orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3594486)
