Pages that link to "Item:Q3594486"
From MaRDI portal
The following pages link to On the Equimorphism Types of Linear Orderings (Q3594486):
Displaying 20 items.
- Binary subtrees with few labeled paths (Q654001) (← links)
- On Müller context-free grammars (Q764314) (← links)
- Countably complementable linear orderings (Q878148) (← links)
- On Fraïssé's conjecture for linear orders of finite Hausdorff rank (Q1032636) (← links)
- Computable bi-embeddable categoricity (Q1731326) (← links)
- Embeddings between well-orderings: computability-theoretic reductions (Q1987213) (← links)
- On bi-embeddable categoricity of algebraic structures (Q2067511) (← links)
- Degrees of bi-embeddable categoricity of equivalence structures (Q2312081) (← links)
- Equivalence between Fraïssé's conjecture and Jullien's theorem (Q2368905) (← links)
- Equimorphy: the case of chains (Q2408076) (← links)
- Classes of structures with no intermediate isomorphism problems (Q2805027) (← links)
- Degree-invariant, analytic equivalence relations without perfectly many classes (Q2832838) (← links)
- Necessary use of induction in a reversal (Q3011120) (← links)
- On Σ<sup>1</sup> <sub>1</sub> equivalence relations over the natural numbers (Q3117786) (← links)
- On Ehrenfeucht-Fraïssé equivalence of linear orderings (Q3483267) (← links)
- Fraïssé’s conjecture in Π11-comprehension (Q4596662) (← links)
- (Q4781770) (← links)
- ANALYTIC EQUIVALENCE RELATIONS SATISFYING HYPERARITHMETIC-IS-RECURSIVE (Q5250130) (← links)
- Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem (Q5366979) (← links)
- Isomorphism relations on computable structures (Q5388722) (← links)
