New Bounds on the Strength of Some Restrictions of Hindman's Theorem

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 $\mathsf{ACA}_0$. An emerging {\em 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.

[1]  Neil Hindman,et al.  Finite Sums from Sequences Within Cells of a Partition of N , 1974, J. Comb. Theory, Ser. A.

[2]  Ludovic Patey.  The weakness of being cohesive, thin or free in reverse mathematics , 2015 .

[3]  Lorenzo Carlucci,et al.  The strength of Ramsey Theorem for coloring relatively large sets , 2012, ArXiv.

[4]  Carl G. Jockusch,et al.  Effectiveness of Hindman's Theorem for Bounded Sums , 2017, Computability and Complexity.

[5]  Carl G. Jockusch,et al.  On the strength of Ramsey's theorem for pairs , 2001, Journal of Symbolic Logic.

[6]  Imre Leader,et al.  Open Problems in Partition Regularity , 2003, Comb. Probab. Comput..

[7]  Jussi KETONENt,et al.  Rapidly growing Ramsey functions , 1981 .

[8]  Carl G. Jockusch,et al.  Ramsey's theorem and recursion theory , 1972, Journal of Symbolic Logic.

[9]  Spiros A. Argyros.  Ramsey methods in analysis , 2007 .

[10]  Petr Hájek,et al.  Metamathematics of First-Order Arithmetic , 1993, Perspectives in mathematical logic.

[11]  Stephen G. Simpson,et al.  Logical analysis of some theorems of combinatorics and topological dynamics , 1987 .

[12]  Barbara F. Csima,et al.  The reverse mathematics of Hindman's Theorem for sums of exactly two elements , 2019, Comput..

[13]  Damir D. Dzhafarov.  Cohesive avoidance and strong reductions , 2014 .

[14]  Steffen Lempp,et al.  On the role of the collection principle for Sigma^0_2-formulas in second-order reverse mathematics , 2010 .

[15]  Neil Hindman.  The existence of certain ultra-filters on and a conjecture of Graham and Rothschild , 1972 .

[16]  Vojtech Rödl,et al.  Partition theorems for systems of finite subsets of integers , 1982, Discret. Math..

[17]  Jeffry L. Hirst,et al.  The polarized Ramsey’s theorem , 2009, Arch. Math. Log..

[18]  Ludovic Patey.  SOMEWHERE OVER THE RAINBOW RAMSEY THEOREM FOR PAIRS , 2015 .

[19]  Barbara F. Csima,et al.  The strength of the rainbow Ramsey Theorem , 2009, J. Symb. Log..

[20]  Antonio Montalbán,et al.  Open Questions in Reverse Mathematics , 2011, The Bulletin of Symbolic Logic.

[21]  Ramsey Theory,et al.  Ramsey Theory , 2020, Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic.

[22]  V. Farmaki,et al.  Schreier sets in Ramsey theory , 2005, math/0510102.

[24]  J. Paris.  A Mathematical Incompleteness in Peano Arithmetic , 1977 .

[25]  Lorenzo Carlucci.  A weak variant of Hindman’s Theorem stronger than Hilbert’s Theorem , 2018, Arch. Math. Log..

[26]  Damir D. Dzhafarov,et al.  STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES , 2016, The Journal of Symbolic Logic.

[27]  C. Chong,et al.  THE METAMATHEMATICS OF STABLE RAMSEY'S THEOREM FOR PAIRS , 2014 .

[28]  Stephen G. Simpson,et al.  Subsystems of second order arithmetic , 1999, Perspectives in mathematical logic.

[29]  Andreas Blass.  SOME QUESTIONS ARISING FROM HINDMAN'S THEOREM , 2005 .

[30]  Hans Jürgen Prömel,et al.  Rapidly Growing Ramsey Functions , 2013 .

[31]  Péter Komjáth,et al.  Ultrafilters , 2008, Am. Math. Mon..

[32]  C. Chong,et al.  ON THE ROLE OF THE COLLECTION PRINCIPLE FOR Σ2-FORMULAS IN SECOND-ORDER REVERSE MATHEMATICS , 2009 .

[33]  Denis R. Hirschfeldt.  Slicing the Truth - On the Computable and Reverse Mathematics of Combinatorial Principles , 2014, Lecture Notes Series / Institute for Mathematical Sciences / National University of Singapore.

[34]  Antonio Montalb An.  OPEN QUESTIONS IN REVERSE MATHEMATICS , 2010 .

[35]  Jeffry L. Hirst.  Hilbert versus Hindman , 2012, Arch. Math. Log..

[36]  Lorenzo Carlucci,et al.  “Weak yet strong” restrictions of Hindman’s Finite Sums Theorem , 2016 .