Iterative forcing and hyperimmunity in reverse mathematics

The separation between two theorems in reverse mathematics is usually done by constructing a Turing ideal satisfying a theorem P and avoiding the solutions to a fixed instance of a theorem Q. Lerman, Solomon and Towsner introduced a forcing technique for iterating a computable non-reducibility in order to separate theorems over omega-models. In this paper, we present a modularized version of their framework in terms of preservation of hyperimmunity and show that it is powerful enough to obtain the same separations results as Wang did with his notion of preservation of definitions.

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

[2]  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.

[3]  ON COMBINATORIAL WEAKNESSES OF RAMSEYAN PRINCIPLES , 2015 .

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

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

[6]  Stephen Flood,et al.  Separating principles below WKL0 , 2016, Math. Log. Q..

[7]  Ludovic Patey,et al.  Ramsey-type graph coloring and diagonal non-computability , 2014, Arch. Math. Log..

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

[9]  R. Soare,et al.  Π⁰₁ classes and degrees of theories , 1972 .

[10]  Brian Rice.  The Thin Set Theorem for Pairs Implies DNR , 2015, Notre Dame J. Formal Log..

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

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

[13]  Ludovic Patey,et al.  Degrees bounding principles and universal instances in reverse mathematics , 2014, Ann. Pure Appl. Log..

[14]  Denis R. Hirschfeldt,et al.  On notions of computability-theoretic reduction between Π21 principles , 2016, J. Math. Log..

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

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

[17]  Frank Stephan,et al.  A Cohesive Set which is not High , 1993, Math. Log. Q..

[18]  Ludovic Patey.  The strength of the Tree Theorem for Pairs in Reverse Mathematics , 2016, J. Symb. Log..

[19]  Jeffry L. Hirst.  Denis R. Hirschfeldt. Slicing the truth: On the computable and reverse mathematics of combinatorial principles. Lecture Note Series, Institute for Mathematical Sciences, National University of Singapore, vol. 28. World Scientific Publishing Co. Pte. Ltd., Singapore, 2015, xiv+214 pp , 2015, Bull. Symb. Log..

[20]  Andrey Bovykin,et al.  The strength of infinitary Ramseyan principles can be accessed by their densities , 2017, Ann. Pure Appl. Log..

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

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

[23]  Wei Wang,et al.  THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES , 2014, The Journal of Symbolic Logic.