We prove upper and lower bounds on the effective content and logical strength for a variety of natural restrictions of Hindman’s Finite Sums Theorem. For example, we show that Hindman’s Theorem for sums of length at most 2 and 4 colors implies ACA0. An emerging leitmotiv is that the known lower bounds for Hindman’s Theorem and for its restriction to sums of at most 2 elements are already valid for a number of restricted versions which have simple proofs and better computability- and proof-theoretic upper bounds than the known upper bound for the full version of the theorem. We highlight the role of a sparsity-like condition on the solution set, which we call apartness.
CITATION STYLE
Carlucci, L., Kołodziejczyk, L. A., Lepore, F., & Zdanowski, K. (2017). New bounds on the strength of some restrictions of Hindman’s theorem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10307 LNCS, pp. 210–220). Springer Verlag. https://doi.org/10.1007/978-3-319-58741-7_21
Mendeley helps you to discover research relevant for your work.