Equivalence between Fraïssé's conjecture and Jullien's theorem
From MaRDI portal
Publication:2368905
DOI10.1016/j.apal.2005.03.001zbMath1094.03045OpenAlexW2034581612WikidataQ123152299 ScholiaQ123152299MaRDI QIDQ2368905
Publication date: 28 April 2006
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2005.03.001
Foundations of classical theories (including reverse mathematics) (03B30) Total orders (06A05) Second- and higher-order arithmetic and fragments (03F35)
Related Items
Open Questions in Reverse Mathematics, Countably complementable linear orderings, Euclidean algorithm for a class of linear orders, Fraïssé’s conjecture in Π11-comprehension, On the logical strength of the better quasi order with three elements, Some Questions in Computable Mathematics, The Reverse Mathematics of wqos and bqos, Laver and set theory, On bi-embeddable categoricity of algebraic structures, INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS, On Fraïssé's conjecture for linear orders of finite Hausdorff rank, Linear extensions of partial orders and reverse mathematics
Cites Work
- Harvey Friedman's research on the foundations of mathematics
- Theory of relations. Transl. from the French by P. Clote
- The metamathematics of scattered linear orderings
- Proof-theoretic investigations on Kruskal's theorem
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings
- Computable structures and the hyperarithmetical hierarchy
- Reverse mathematics and rank functions for directed graphs
- On Fraissé's order type conjecture
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- $ℵ_0$-categoricity of linear orderings
- Up to equimorphism, hyperarithmetic is recursive
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
