The strength of the tree theorem for pairs in reverse mathematics - Université Paris Cité Accéder directement au contenu
Article Dans Une Revue The Journal of Symbolic Logic Année : 2016

The strength of the tree theorem for pairs in reverse mathematics

Résumé

No natural principle is currently known to be strictly between the arithmetic comprehension axiom (ACA0) and Ramsey's theorem for pairs (RT 2 2) in reverse mathematics. The tree theorem for pairs (TT 2 2) is however a good candidate. The tree theorem states that for every finite coloring over tuples of comparable nodes in the full binary tree, there is a monochromatic subtree isomorphic to the full tree. The principle TT 2 2 is known to lie between ACA0 and RT 2 2 over RCA0, but its exact strength remains open. In this paper, we prove that RT 2 2 together with weak König's lemma (WKL0) does not imply TT 2 2 , thereby answering a question of Montálban. This separation is a case in point of the method of Lerman, Solomon and Towsner for designing a computability-theoretic property which discriminates between two statements in reverse mathematics. We therefore put the emphasis on the different steps leading to this separation in order to serve as a tutorial for separating principles in reverse mathematics.
Fichier principal
Vignette du fichier
tree-theorem.pdf (347.47 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01888614 , version 1 (05-10-2018)

Identifiants

Citer

Ludovic Patey. The strength of the tree theorem for pairs in reverse mathematics. The Journal of Symbolic Logic, 2016, 81 (04), pp.1481 - 1499. ⟨10.1017/jsl.2015.80⟩. ⟨hal-01888614⟩
58 Consultations
86 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More