Cholak, P. A., Giusto, M., Hirst, J. L., and Jockusch, C. G. Jr.,
Free sets and reverse mathematics
, Reverse Mathematics 2001, Lecture Notes in Logic, vol. 21, Association for Symbolic Logic, La Jolla, CA, 2005, pp. 104–119.
Cholak, P. A., Jockusch, C. G., and Slaman, T. A., On the strength of Ramsey’s theorem for pairs, this Journal, vol. 66 (2001), no. 1, pp. 1–55.
Csima, B. and Mileti, J., The strength of the rainbow Ramsey theorem, this Journal, vol. 74 (2009), no. 4, pp. 1310–1324.
Dorais, F. G., Dzhafarov, D. D., Hirst, J. L., Mileti, J. R., and Shafer, P.,
On uniform relationships between combinatorial problems
. Transactions of the American Mathematical Society, vol. 368 (2016), no. 2, pp. 1321–1359.
Downey, R. and Hirschfeldt, D., Algorithmic Randomness and Complexity, Theory and Applications of Computability, Springer, New York, 2010.
Harizanov, V. S.,
Turing degrees of certain isomorphic images of computable relations
. Annals of Pure and Applied Logic, vol. 93 (1998), no. 1–3, pp. 103–113.
Hirschfeldt, D. R., Slicing the Truth, Lecture Notes Series. Institute for Mathematical Sciences. National University of Singapore, vol. 28, World Scientific Publishing Co. Pte. Ltd., Hackensack, NJ, 2015.
Hirschfeldt, D. R. and Shore, R. A., Combinatorial principles weaker than Ramsey’s theorem for pairs, this Journal, vol. 72 (2007), no. 1, pp. 171–206.
Hirschfeldt, D. R., Shore, R. A., and Slaman, T. A.,
The atomic model theorem and type omitting
, Transactions of the American Mathematical Society, vol. 361 (2009), no. 11, pp. 5805–5837.
Jockusch, C. G. Jr., Ramsey’s theorem and recursion theory, this Journal, vol. 37 (1972), no. 2, pp. 268–280.
Kang, X., Combinatorial principles between
Randomness and Genericty in the Degrees of Unsolvability
, Ph.D thesis, University of Illinios at Urbana-Champaign, 1981.
Lerman, M., Solomon, R., and Towsner, H.,
Separating principles below Ramsey’s theorem for pairs
. Journal of Mathematical Logic, vol. 13 (2013), no. 2, p. 1350007, 44.
Patey, L., Controlling iterated jumps of solutions to combinatorial problems,
, to appear.
Patey, L., Somewhere over the rainbow Ramsey theorem for pairs, to appear, 2015.
Seetapun, D. and Slaman, T. A.,
On the strength of Ramsey’s theorem
. Notre Dame Journal of Formal Logic, vol. 36 (1995), no. 4, pp. 570–582.
Simpson, S. G., Subsystems of Second Order Arithmetic, Perspectives in Logic, second edition, Cambridge University Press, Cambridge; Association for Symbolic Logic, Poughkeepsie, NY, 2009.
Soare, R. I., Recursively Enumerable Sets and Degrees, Perspectives in Mathematical Logic, Omega Series. Springer–Verlag, Heidelberg, 1987.
Wang, W., Rainbow Ramsey Theorem for triples is strictly weaker than the Arithmetic Comprehension Axiom, this Journal, vol. 78 (2013), no. 3, 824–836.
Cohesive sets and rainbows
. Annals of Pure and Applied Logic, vol. 165 (2014), no. 2, 389–408.
Some logically weak Ramseyan theorems
. Advances in Mathematics, vol. 261 (2014), pp. 1–25.