On the Equimorphism Types of Linear Orderings
From MaRDI portal
Publication:3594486
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
Cites work
- 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?)
- An order type decomposition theorem
- 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
- Forcing with tagged trees
- Hierarchies of Boolean algebras
- Hierarchies of number-theoretic predicates
- Model theory and algebra. A memorial tribute to Abraham Robinson
- On Fraissé's order type conjecture
- On the strength of Ramsey's theorem for pairs
- Proof-theoretic investigations on Kruskal's theorem
- Recursive well-orderings
- Set theory. An introduction to independence proofs
- Stability of recursive structures in arithmetical degrees
- Up to equimorphism, hyperarithmetic is recursive
Cited in
(22)- INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
- On Fraïssé's conjecture for linear orders of finite Hausdorff rank
- Computable bi-embeddable categoricity
- Necessary use of \(\Sigma ^1_{1}\) induction in a reversal
- Isomorphism relations on computable structures
- Analytic equivalence relations satisfying hyperarithmetic-is-recursive
- scientific article; zbMATH DE number 1827968 (Why is no real title available?)
- Embeddings between well-orderings: computability-theoretic reductions
- Degrees of bi-embeddable categoricity of equivalence structures
- On Müller context-free grammars
- Degree-invariant, analytic equivalence relations without perfectly many classes
- Equimorphy: the case of chains
- Classes of structures with no intermediate isomorphism problems
- Fraïssé's conjecture in \(\Pi_1^1\)-comprehension
- Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
- On bi-embeddable categoricity of algebraic structures
- Equivalence between Fraïssé's conjecture and Jullien's theorem
- On Ehrenfeucht-Fraïssé equivalence of linear orderings
- Countably complementable linear orderings
- Binary subtrees with few labeled paths
- On Σ1 1 equivalence relations over the natural numbers
- Up to equimorphism, hyperarithmetic is recursive
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)
