Fraïssé’s conjecture in [math]-comprehension

Journal of Mathematical Logic 17 (2):1750006 (2017)
  Copy   BIBTEX

Abstract

We prove Fraïssé’s conjecture within the system of Π11-comprehension. Furthermore, we prove that Fraïssé’s conjecture follows from the Δ20-bqo-ness of 3 over the system of Arithmetic Transfinite Recursion, and that the Δ20-bqo-ness of 3 is a Π21-statement strictly weaker than Π11-comprehension.

Categories

Keywords

Reprint years

DOI

10.1142/s0219061317500064

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,612

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

Weak Well Orders and Fraïssé’s Conjecture.Anton Freund & Davide Manca - forthcoming - Journal of Symbolic Logic:1-16.
Equivalence between Fraïssé’s conjecture and Jullien’s theorem.Antonio Montalbán - 2006 - Annals of Pure and Applied Logic 139 (1):1-42.
On Fraïssé’s conjecture for linear orders of finite Hausdorff rank.Alberto Marcone & Antonio Montalbán - 2009 - Annals of Pure and Applied Logic 160 (3):355-367.
On Fraïssé's Order Type Conjecture.Richard Laver & Saharon Shelah - 1987 - Journal of Symbolic Logic 52 (2):571-574.
Embeddings between well-orderings: Computability-theoretic reductions.Jun Le Goh - 2020 - Annals of Pure and Applied Logic 171 (6):102789.
The Set of Better Quasi Orderings is ∏21.Alberto Marcone - 1995 - Mathematical Logic Quarterly 41 (3):373-383.
Determinacy of Wadge classes and subsystems of second order arithmetic.Takako Nemoto - 2009 - Mathematical Logic Quarterly 55 (2):154-176.
On a Chang Conjecture. II.Ralf-Dieter Schindler - 1998 - Archive for Mathematical Logic 37 (4):215-220.
Richard Laver. On Fraïssé's order type conjecture. Annals of mathematics, ser. 2 vol. 93 , pp. 89–111. - Richard Laver. An order type decomposition theorem. Annals of mathematics, ser. 2 vol. 98 pp. 96–119. - Richard Laver. Better-quasi-orderings and a class of trees. Studies in foundations and combinatorics, edited by Gian-Carlo Rota, Advances in mathematics supplementary studies, vol. 1, Academic Press, New York, San Francisco, and London, 1978, pp. 31–48. - Saharon Shelah. Better quasi-orders for uncountable cardinals. Israel journal of mathematics, vol. 42 , pp. 177–226. [REVIEW]Charles Landraitis - 1987 - Journal of Symbolic Logic 52 (2):571-574.
The Computational Power of ℳω.Dag Normann & Christian Rørdam - 2002 - Mathematical Logic Quarterly 48 (1):117-124.

Analytics

Added to PP
2017-08-03

Downloads
28 (#558,407)

6 months
6 (#702,272)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Embeddings between well-orderings: Computability-theoretic reductions.Jun Le Goh - 2020 - Annals of Pure and Applied Logic 171 (6):102789.
Weak Well Orders and Fraïssé’s Conjecture.Anton Freund & Davide Manca - forthcoming - Journal of Symbolic Logic:1-16.

Add more citations

References found in this work

Happy families.A. R. D. Mathias - 1977 - Annals of Mathematical Logic 12 (1):59.
Proof-theoretic investigations on Kruskal's theorem.Michael Rathjen & Andreas Weiermann - 1993 - Annals of Pure and Applied Logic 60 (1):49-88.

View all 12 references / Add more references