Fraïssé’s conjecture in Π11-comprehension

DOI10.1142/S0219061317500064zbMath1472.03066OpenAlexW2725334790WikidataQ123292693 ScholiaQ123292693MaRDI QIDQ4596662

Antonio Montalbán

Publication date: 4 December 2017

Published in: Journal of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219061317500064

zbMATH Keywords

well-quasi-orderingFraïssé's conjecturebetter-quasi-ordering

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Total orders (06A05) Second- and higher-order arithmetic and fragments (03F35)

Related Items (4)

On the logical strength of the better quasi order with three elements ⋮ Well, Better and In-Between ⋮ The Reverse Mathematics of wqos and bqos ⋮ Embeddings between well-orderings: computability-theoretic reductions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Fraïssé's conjecture for linear orders of finite Hausdorff rank
• The Galvin-Prikry theorem and set existence axioms
• Proof-theoretic investigations on Kruskal's theorem
• Equivalence between Fraïssé's conjecture and Jullien's theorem
• On Fraissé's order type conjecture
• On the Equimorphism Types of Linear Orderings
• Happy families
• Forcing with tagged trees
• Hyperarithmetically Encodable Sets
• Foundations of BQO Theory
• Δ₃^O-determinacy, comprehension and induction
• Hierarchies of Δ⁰₂‐measurable k ‐partitions
• Reverse mathematics and the equivalence of definitions for well and better quasi-orders
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Higher set theory and mathematical practice

This page was built for publication: Fraïssé’s conjecture in Π11-comprehension