A. Peter, D. D. Cholak, J. L. Dzhafarov, T. A. Hirst, and . Slaman, Generics for computable Mathias forcing, Annals of Pure and Applied Logic, vol.165, issue.9, pp.1418-1428, 2014.

A. Peter, M. Cholak, J. L. Giusto, C. G. Hirst, and . Jockusch, Free sets and reverse mathematics, Reverse mathematics, vol.21, pp.104-119, 2001.

A. Peter, C. G. Cholak, T. A. Jockusch, and . Slaman, On the strength of Ramsey's theorem for pairs, Journal of Symbolic Logic, vol.66, issue.01, pp.1-55, 2001.

C. Chong, S. Lempp, and Y. Yang, On the role of the collection principle for ? 0 2-formulas in secondorder reverse mathematics, Proceedings of the American Mathematical Society, vol.138, issue.3, pp.1093-1100, 2010.

C. Chong, T. Slaman, and Y. Yang, The metamathematics of stable Ramsey's theorem for pairs, Journal of the American Mathematical Society, vol.27, issue.3, pp.863-892, 2014.

F. Barbara, J. R. Csima, and . Mileti, The strength of the rainbow Ramsey theorem, Journal of Symbolic Logic, vol.74, issue.04, pp.1310-1324, 2009.

R. Downey, D. R. Hirschfeldt, S. Lempp, and R. Solomon, A ? 0 2 set with no infinite low subset in either it or its complement, Journal of Symbolic Logic, vol.66, issue.3, pp.1371-1381, 2001.
DOI : 10.2307/2695113

D. Damir, J. L. Dzhafarov, and . Hirst, The polarized Ramsey's theorem. Archive for Mathematical Logic, vol.48, pp.141-157, 2009.

D. Damir, C. G. Dzhafarov, and . Jockusch, Ramsey's theorem and cone avoidance, Journal of Symbolic Logic, vol.74, issue.2, pp.557-578, 2009.

S. Flood, Reverse mathematics and a Ramsey-type König's lemma, Journal of Symbolic Logic, vol.77, issue.4, pp.1272-1280, 2012.
DOI : 10.2178/jsl.7704120
URL : http://arxiv.org/pdf/1111.2526

M. Harvey and . Friedman, Fom:53:free sets and reverse math and fom:54:recursion theory and dynamics

D. R. Hirschfeldt, Slicing the truth, On the computable and reverse mathematics of combinatorial principles, vol.28, 2015.
DOI : 10.1142/9208

D. R. Hirschfeldt, C. G. Jockusch, B. Kjos-hanssen, S. Lempp, and T. A. Slaman, The strength of some combinatorial principles related to Ramsey's theorem for pairs, Part II: Presented Talks, pp.143-161, 2008.

C. G. Jockusch, Ramsey's theorem and recursion theory, Journal of Symbolic Logic, vol.37, issue.2, pp.268-280, 1972.
DOI : 10.2307/2272972

G. Carl, R. I. Jockusch, and . Soare, ? 0 1 classes and degrees of theories, Transactions of the American Mathematical Society, vol.173, pp.33-56, 1972.

G. Carl, F. Jockusch, and . Stephan, A cohesive set which is not high, Mathematical Logic Quarterly, vol.39, issue.1, pp.515-530, 1993.

X. Kang, Combinatorial principles between RRT 2 2 and RT 2 2, Frontiers of Mathematics in China, vol.9, issue.6, pp.1309-1323, 2014.
DOI : 10.1007/s11464-014-0390-6

L. Liu, RT 2 2 does not imply WKL0, Journal of Symbolic Logic, vol.77, issue.2, pp.609-620, 2012.
DOI : 10.2178/jsl/1333566640
URL : https://www.cambridge.org/core/services/aop-cambridge-core/content/view/02D5803E33B2592CF66322D13A9D6EC0/S0022481200000761a.pdf/div-class-title-rt-span-class-sub-2-span-span-class-sup-2-span-does-not-imply-wkl-span-class-sub-0-span-div.pdf

L. Liu, Cone avoiding closed sets, Transactions of the American Mathematical Society, vol.367, issue.3, pp.1609-1630, 2015.
DOI : 10.1090/s0002-9947-2014-06049-2
URL : http://arxiv.org/pdf/1602.03777

D. A. Martin, Classes of recursively enumerable sets and degrees of unsolvability, Mathematical Logic Quarterly, vol.12, issue.1, pp.295-310, 1966.
DOI : 10.1002/malq.19660120125

J. Roy-mileti, Partition theorems and computability theory, 2004.

L. Patey, Combinatorial weaknesses of Ramseyan principles, 2015.

L. Patey, Somewhere over the rainbow Ramsey theorem for pairs, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01888807

L. Patey, Open questions about Ramsey-type statements in reverse mathematics, Bull. Symb. Log, vol.22, issue.2, pp.151-169, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01888620

L. Patey, The reverse mathematics of Ramsey-type theorems, 2016.
URL : https://hal.archives-ouvertes.fr/tel-01888675

L. Patey, The weakness of being cohesive, thin or free in reverse mathematics, Israel J. Math, vol.216, issue.2, pp.905-955, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01888606

L. Patey, Iterative forcing and hyperimmunity in reverse mathematics, Computability, vol.6, issue.3, pp.209-221, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01888601

B. Rice, Thin set for pairs implies DNR. Notre Dame J. Formal Logic

D. Seetapun and T. A. Slaman, On the strength of Ramsey's theorem, Notre Dame Journal of Formal Logic, vol.36, issue.4, pp.570-582, 1995.

G. Stephen and . Simpson, Subsystems of Second Order Arithmetic, 2009.

W. Wang, Some reverse mathematics of rainbow Ramsey theorems

W. Wang, Rainbow Ramsey theorem for triples is strictly weaker than the arithmetical comprehension axiom, Journal of Symbolic Logic, vol.78, issue.3, pp.824-836, 2013.

W. Wang, Cohesive sets and rainbows, Annals of Pure and Applied Logic, vol.165, issue.2, pp.389-408, 2014.

W. Wang, The definability strength of combinatorial principles, 2014.

W. Wang, Some logically weak Ramseyan theorems, Advances in Mathematics, vol.261, pp.1-25, 2014.