On Fraïssé’s conjecture for linear orders of finite Hausdorff rank

&
Annals of Pure and Applied Logic 160 (3):355-367 (2009)
  Copy   BIBTEX

Abstract

We prove that the maximal order type of the wqo of linear orders of finite Hausdorff rank under embeddability is φ2, the first fixed point of the ε-function. We then show that Fraïssé’s conjecture restricted to linear orders of finite Hausdorff rank is provable in +“φ2 is well-ordered” and, over , implies +“φ2 is well-ordered”

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2009.01.007

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 107,248

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The complexity of Scott sentences of scattered linear orders.Rachael Alvir & Dino Rossegger - 2020 - Journal of Symbolic Logic 85 (3):1079-1101.
Equivalence between Fraïssé’s conjecture and Jullien’s theorem.Antonio Montalbán - 2006 - Annals of Pure and Applied Logic 139 (1):1-42.
Up to Equimorphism, Hyperarithmetic Is Recursive.Antonio Montalbán - 2005 - Journal of Symbolic Logic 70 (2):360 - 378.
Restriction respectueuse et reconstruction Des chaines et Des relations infinites.Jean Guillaume Hagendorf & J. G. Hagendorf - 1992 - Mathematical Logic Quarterly 38 (1):457-490.
On linearly ordered structures of finite rank.Alf Onshuus & Charles Steinhorn - 2009 - Journal of Mathematical Logic 9 (2):201-239.
Weak Well Orders and Fraïssé’s Conjecture.Anton Freund & Davide Manca - forthcoming - Journal of Symbolic Logic:1-16.
Coset-minimal groups.Oleg Belegradek, Viktor Verbovskiy & Frank O. Wagner - 2003 - Annals of Pure and Applied Logic 121 (2-3):113-143.
On the quasi-ordering of borel linear orders under embeddability.Alain Louveau & Jean Saint-Raymond - 1990 - Journal of Symbolic Logic 55 (2):537-560.
Non-primitive recursive decidability of products of modal logics with expanding domains.David Gabelaia, Agi Kurucz, Frank Wolter & Michael Zakharyaschev - 2006 - Annals of Pure and Applied Logic 142 (1):245-268.
Elementary Properties of the Finite Ranks.Anuj Dawar, Kees Doets, Steven Lindell & Scott Weinstein - 1998 - Mathematical Logic Quarterly 44 (3):349-353.

Analytics

Added to PP
2013-12-22

Downloads
25 (#1,016,285)

6 months
6 (#856,063)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Open questions in reverse mathematics.Antonio Montalbán - 2011 - Bulletin of Symbolic Logic 17 (3):431-454.
The veblen functions for computability theorists.Alberto Marcone & Antonio Montalbán - 2011 - Journal of Symbolic Logic 76 (2):575 - 602.
Reverse mathematics: the playground of logic.Richard A. Shore - 2010 - Bulletin of Symbolic Logic 16 (3):378-402.
Fraïssé’s conjecture in [math]-comprehension.Antonio Montalbán - 2017 - Journal of Mathematical Logic 17 (2):1750006.

View all 6 citations / Add more citations

References found in this work

Proof-theoretic investigations on Kruskal's theorem.Michael Rathjen & Andreas Weiermann - 1993 - Annals of Pure and Applied Logic 60 (1):49-88.
Ordinal numbers and the Hilbert basis theorem.Stephen G. Simpson - 1988 - Journal of Symbolic Logic 53 (3):961-974.
On the equimorphism types of linear orderings.Antonio Montalbán - 2007 - Bulletin of Symbolic Logic 13 (1):71-99.

View all 9 references / Add more references