2000 character limit reached
Dickson's lemma and weak Ramsey theory
Published 9 Dec 2015 in math.LO | (1512.02954v3)
Abstract: We explore the connections between Dickson's lemma and weak Ramsey theory. We show that a weak version of the Paris--Harrington principle for pairs in $c$ colors and miniaturized Dickson's lemma for $c$-tuples are equivalent over $\mathsf{RCA}_0{\ast}$. Furthermore, we look at a cascade of consequences for several variants of weak Ramsey's theorem.
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.