The proof-theoretic strength of Ramsey's theorem for pairs and two colors - Archive ouverte HAL Access content directly
Journal Articles Advances in Mathematics Year : 2018

The proof-theoretic strength of Ramsey's theorem for pairs and two colors

Abstract

Ramsey's theorem for n-tuples and k-colors (RT n k) asserts that every k-coloring of [N] n admits an infinite monochromatic subset. We study the proof-theoretic strength of Ramsey's theorem for pairs and two colors, namely, the set of its Π 0 1 consequences, and show that RT 2 2 is Π 0 3 conservative over IΣ 0 1. This strengthens the proof of Chong, Slaman and Yang that RT 2 2 does not imply IΣ 0 2 , and shows that RT 2 2 is finitistically reducible, in the sense of Simpson's partial realization of Hilbert's Program. Moreover, we develop general tools to simplify the proofs of Π 0 3-conservation theorems.

Domains

Logic [math.LO]
Fichier principal
Vignette du fichier
RT2con.pdf (252.49 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

Ludovic Patey, Keita Yokoyama. The proof-theoretic strength of Ramsey's theorem for pairs and two colors. Advances in Mathematics, 2018, 330, pp.1034 - 1070. ⟨10.1016/j.aim.2018.03.035⟩. ⟨hal-01888655⟩
62 View
206 Download

Altmetric

Share

Gmail Facebook X LinkedIn More