THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES

We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a definable set. We prove that some consequences of Ramsey's Theorem for colorings of pairs could help in simplifying the definitions of some $\Delta^0_2$ sets, while some others could not. We also investigate some consequences of Ramsey's Theorem for colorings of longer tuples. These results of definability strength have some interesting consequences in reverse mathematics, including strengthening of known theorems in a more uniform way and also new theorems.

[1]  Wei Wang.  Rainbow Ramsey Theorem for triples is strictly weaker than the Arithmetical Comprehension Axiom , 2013, J. Symb. Log..

[2]  Ludovic Patey.  Controlling iterated jumps of solutions to combinatorial problems , 2017, Comput..

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

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

[5]  Valentina S. Harizanov.  Turing Degrees of Certain Isomorphic Images of Computable Relations , 1998, Ann. Pure Appl. Log..

[6]  Peter A. Cholak.  FREE SETS AND REVERSE MATHEMATICS , 2003 .

[7]  Denis R. Hirschfeldt,et al.  The atomic model theorem and type omitting , 2009 .

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

[9]  Denis R. Hirschfeldt,et al.  Combinatorial principles weaker than Ramsey's Theorem for pairs , 2007, J. Symb. Log..

[10]  Wei Wang.  Cohesive sets and rainbows , 2014, Ann. Pure Appl. Log..

[11]  Rodney G. Downey,et al.  Algorithmic Randomness and Complexity , 2010, Theory and Applications of Computability.

[12]  Theodore A. Slaman,et al.  On the Strength of Ramsey's Theorem , 1995, Notre Dame J. Formal Log..

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

[14]  R. Soare.  Recursively enumerable sets and degrees , 1987 .

[15]  Denis R. Hirschfeldt,et al.  Algorithmic randomness and complexity. Theory and Applications of Computability , 2012 .

[16]  Manuel Lerman,et al.  Separating Principles below Ramsey's Theorem for Pairs , 2013, J. Math. Log..

[17]  Wei Wang,et al.  Some logically weak Ramseyan theorems , 2014 .

[18]  Joseph R. Mileti,et al.  On uniform relationships between combinatorial problems , 2012, 1212.0157.

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