The strength of the tree theorem for pairs in reverse mathematics

Ludovic Patey 1, 2
2 PI.R2 - Design, study and implementation of languages for proofs and programs
Inria de Paris, CNRS - Centre National de la Recherche Scientifique, UPD7 - Université Paris Diderot - Paris 7, PPS - Preuves, Programmes et Systèmes
Abstract : 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.
Document type :
Journal articles
Liste complète des métadonnées
Contributor : Ludovic Patey <>
Submitted on : Friday, October 5, 2018 - 11:15:48 AM
Last modification on : Friday, January 4, 2019 - 5:33:38 PM
Document(s) archivé(s) le : Sunday, January 6, 2019 - 2:03:29 PM


Files produced by the author(s)




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



Record views


Files downloads