2000 character limit reached
Conservation of Ramsey's theorem for pairs and well-foundedness (2402.11616v2)
Published 18 Feb 2024 in math.LO
Abstract: In this article, we prove that Ramsey's theorem for pairs and two colors is $\Pi1_1$-conservative over~$\mathsf{RCA}_0 + \mathsf{B}\Sigma0_2 + \mathsf{WF}(\epsilon_0)$ and over~$\mathsf{RCA}_0 + \mathsf{B}\Sigma0_2 + \bigcup_n \mathsf{WF}(\omega\omega_n)$. These results improve theorems from Chong, Slaman and Yang and Ko{\l}odziejczyk and Yokoyama and belong to a long line of research towards the characterization of the first-order part of Ramsey's theorem for pairs.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.