[1]Mirzaevich Arslanov, Marat, *Some generalizations of a fixed-point theorem*. Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, (1981), no. 5, pp. 9–16.

[2]Bienvenu, Laurent, Patey, Ludovic, and Shafer, Paul, *On the logical strengths of partial solutions to mathematical problems*, submitted, available at http://arxiv.org/abs/1411.5874, 2015. [3]Bovykin, Andrey and Weiermann, Andreas, *The strength of infinitary ramseyan principles can be accessed by their densities*, 2005, preprint.

[4]Cai, Mingzhong, Greenberg, Noam, and McInerney, Michael, *DNR and incomparable Turing degrees*, 2015, to appear.

[5]Cholak, Peter, Downey, Rod, and Igusa, Greg, *Any FIP real computes a 1-generic*, 2015, preprint.

[6]Cholak, Peter A., Dzhafarov, Damir D., Hirst, Jeffry L., and Slaman, Theodore A., *Generics for computable Mathias forcing*. Annals of Pure and Applied Logic, vol. 165 (2014), no. 9, pp. 1418–1428.

[7]Cholak, Peter A., Giusto, Mariagnese, Hirst, Jeffry L., and Jockusch, Carl G. Jr, *Free sets and reverse mathematics*. Reverse Mathematics, vol. 21 (2001), pp. 104–119.

[8]Cholak, Peter A., Jockusch, Carl G., and Slaman, Theodore A., *On the strength of Ramsey’s theorem for pairs*. The Journal of Symbolic Logic, vol. 66 (2001), no. 01, pp. 1–55.

[9]Chong, C., Lempp, Steffen, and Yang, Yue, *On the role of the collection principle for* ${\rm{\Sigma }}_2^0$*-formulas in second-order reverse mathematics*. Proceedings of the American Mathematical Society, vol. 138 (2010), no. 3, pp. 1093–1100. [10]Chong, C. T., Li, Wei, and Yang, Yue, *Nonstandard models in recursion theory and reverse mathematics*, this Bulletin, vol. 20 (2014), no. 2, pp. 170–200.

[11]Chong, Chitat, Slaman, Theodore, and Yang, Yue, *The metamathematics of stable Ramsey’s theorem for pairs*. Journal of the American Mathematical Society, vol. 27 (2014), no. 3, pp. 863–892.

[12]Csima, Barbara F. and Mileti, Joseph R., *The strength of the rainbow Ramsey theorem*. The Journal of Symbolic Logic, vol. 74 (2009), no. 4, pp. 1310–1324.

[13]Dorais, François G., Dzhafarov, Damir D., Hirst, Jeffry L., Mileti, Joseph R., and Shafer, Paul, *On uniform relationships between combinatorial problems*, 2012, preprint.

[14]Downey, Rod, Diamondstone, David, Greenberg, Noam, and Turetsky, Daniel, *The finite intersection principle and genericity*, *Mathematical Proceedings of the Cambridge Philosophical Society*, to appear, available at time of writing at http://homepages.ecs.vuw.ac.nz/∼downey/publications/FIP_paper.pdf, 2012. [15]Downey, Rod, Hirschfeldt, Denis R., Lempp, Steffen, and Solomon, Reed, *A* ${\rm{\Delta }}_2^0$*set with no infinite low subset in either it or its complement*. The Journal of Symbolic Logic, vol. 66 (2001), no. 3, pp. 1371–1381. [16]Dzhafarov, Damir D., *Strong reductions between combinatorial principles*, submitted.

[17]Dzhafarov, Damir D., *Cohesive avoidance and strong reductions*. Proceedings of the American Mathematical Society, vol. 143 (2015), no 2, pp. 869–876.

[18]Dzhafarov, Damir D. and Hirst, Jeffry L., *The polarized Ramsey’s theorem*. Archive for Mathematical Logic, vol. 48 (2009), no. 2, pp. 141–157.

[19]Dzhafarov, Damir D. and Jockusch, Carl G., *Ramsey’s theorem and cone avoidance*. The Journal of Symbolic Logic, vol. 74 (2009), no. 2, pp. 557–578.

[20]Dzhafarov, Damir D. and Mummert, Carl, *On the strength of the finite intersection principle*. Israel Journal of Mathematics, vol. 196 (2013), no. 1, pp. 345–361.

[21]Flood, Stephen, *Reverse mathematics and a Ramsey-type König’s lemma*. The Journal of Symbolic Logic, vol. 77 (2012), no. 4, pp. 1272–1280.

[24]Friedman, Harvey M., *Boolean Relation Theory and Incompleteness*, Lecture Notes in Logic, 2013, to appear, available at http://www.math.ohio-state.edu/. [25]Greenberg, Noam and Miller, Joseph S., *Lowness for Kurtz randomness*. The Journal of Symbolic Logic, vol. 74 (2009), no. 2, pp. 665–678.

[26]Hirschfeldt, Denis R., Slicing the Truth, Lecture Notes Series, vol. 28, Institute for Mathematical Sciences, National University of Singapore, vol. 28, World Scientific Publishing, Hackensack, NJ, 2015.

[27]Hirschfeldt, Denis R. and Jockusch, Carl G., *On notions of computability theoretic reduction between* ${\rm{\Pi }}_2^1$*principles*, to appear. [28]Hirschfeldt, Denis R., Jockusch, Carl G., Kjos-Hanssen, Bjørn, Lempp, Steffen, and Slaman, Theodore A., *The strength of some combinatorial principles related to Ramsey’s theorem for pairs*, *Computational Prospects of Infinity, Part II: Presented Talks, World Scientific Press, Singapore*, (2008), pp. 143–161.

[29]Hirschfeldt, Denis R. and Shore, Richard A., *Combinatorial principles weaker than Ramsey’s theorem for pairs*. The Journal of Symbolic Logic, vol. 72 (2007), no. 1, pp. 171–206.

[30]Hirschfeldt, Denis R., Shore, Richard A., and Slaman, Theodore A., *The atomic model theorem and type omitting*. Transactions of the American Mathematical Society, vol. 361 (2009), no. 11, pp. 5805–5837.

[31]Hirst, Jeffry L., *Marriage theorems and reverse mathematics*, Logic and Computation (Pittsburgh, PA, 1987), Contemporaty Mathematics, vol. 106, American Mathematical Society, Providence, RI, 1990, pp. 181–196.

[32]Jockusch, Carl G., *Ramsey’s theorem and recursion theory*. The Journal of Symbolic Logic, vol. 37 (1972), no. 2, pp. 268–280.

[33]Jockusch, Carl G., *Degrees of functions with no fixed points*. Studies in Logic and the Foundations of Mathematics, vol. 126 (1989), p. 191–201.

[34]Jockusch, Carl G., Lerman, Manuel, Soare, Robert I., and Solovay, Robert M., *Recursively enumerable sets modulo iterated jumps and extensions of Arslanov’s completeness criterion*. The Journal of Symbolic Logic, vol. 54 (1989), no. 4, pp. 1288–1323.

[35]Jockusch, Carl. G. and Soare, Robert I., *Degrees of members of* ${\rm{\Pi }}_1^0$*classes*. Pacific Journal of Mathematics, vol. 40 (1972), pp. 605–616. [36]Jockusch, Carl. G. and Soare, Robert I., ${\rm{\Pi }}_1^0$*classes and degrees of theories*. Transactions of the American Mathematical Society, vol. 173 (1972), pp. 33–56. [37]Jockusch, Carl G. and Stephan, Frank, *A cohesive set which is not high*. Mathematical Logic Quarterly, vol. 39 (1993), no. 1, pp. 515–530.

[38]Kang, Xiaojun, *Combinatorial principles between* $\mathop {RRT}\nolimits_2^2$*and* $\mathop {RT}\nolimits_2^2$. Frontiers of Mathematics in China, vol. 9 (2014), no. 6, pp. 1309–1323. [39]Kjos-Hanssen, Bjørn, *Infinite subsets of random sets of integers*. Mathematics Research Letters, vol. 16 (2009), pp. 103–110.

[40]Kreuzer, Alexander P., *Primitive recursion and the chain antichain principle*. Notre Dame Journal of Formal Logic, vol. 53 (2012), no. 2, pp. 245–265.

[41]Kucera, Antonın, *Measure,* ${\rm{\Pi }}_1^0$*classes and complete extensions of PA*. Lecture Notes in Mathematics, vol. 1141 (1985), pp. 245–259. [42]Lerman, Manuel, Solomon, Reed, and Towsner, Henry, *Separating principles below Ramsey’s theorem for pairs*. Journal of Mathematical Logic, vol. 13 (2013), no. 2, p. 1350007.

[43]Liu, Lu, $\mathop {RT}\nolimits_2^2$*does not imply WKL* _{0}. The Journal of Symbolic Logic, vol. 77 (2012), no. 2, pp. 609–620. [44]Liu, Lu, *Cone avoiding closed sets*. Transactions of the American Mathematical Society, vol. 367 (2015), no. 3, pp. 1609–1630.

[45]Mileti, Joseph R., Partition theorems and computability theory, Ph.D. Thesis, Carnegie Mellon University, Pennsylvania, 2004.

[46]Miller, Joseph S., *Assorted results in and about effective randomness*, in preparation.

[47]Montalbán, Antonio, *Open questions in reverse mathematics*. The Bulletin of Symbolic Logic, vol. 17 (2011), no. 3, pp. 431–454.

[51]Patey, Ludovic, *Degrees bounding principles and universal instances in reverse mathematics*. Annals of Pure and Applied Logic, vol. 166 (2015), no. 11, pp. 1165–1185.

[52]Patey, Ludovic, *Iterative forcing and hyperimmunity in reverse mathematics*, Evolving Computability (Beckmann, Arnold, Mitrana, Victor, and Soskova, Mariya, editors), Lecture Notes in Computer Science, vol. 9136, Springer International Publishing, 2015, pp. 291–301.

[53]Patey, Ludovic, *Ramsey-type graph coloring and diagonal non-computability*. Archive for Mathematical Logic, vol. 54 (2015), no. 7–8, pp. 899–914.

[57]Rakotoniaina, Tahina, *The computational strength of Ramsey’s theorem*, Ph.D Thesis, University of Cape Town, 2015, to appear.

[58]Seetapun, David and Slaman, Theodore A., *On the strength of Ramsey’s theorem*. Notre Dame Journal of Formal Logic, vol. 36 (1995), no. 4, pp. 570–582.

[59]Shoenfield, Joseph R., *On degrees of unsolvability*. Annals of Mathematics, vol. 69 (1959), no. 3, pp. 644–653.

[60]Simpson, Stephen G., Subsystems of Second Order Arithmetic, Cambridge University Press, Cambridge, 2009.

[61]Van Lambalgen, Michiel, *The axiomatization of randomness*. The Journal of Symbolic Logic, vol. 55 (1990), no. 3, pp. 1143–1167.

[62]Wang, Wei, *Some reverse mathematics of rainbow Ramsey theorems*, unpublished.

[63]Wang, Wei, *Cohesive sets and rainbows*. Annals of Pure and Applied Logic, vol. 165 (2014), no. 2, pp. 389–408.

[65]Wang, Wei, *Some logically weak ramseyan theorems*. Advances in Mathematics, vol. 261 (2014), pp. 1–25.

[66]Yu, Liang, *Lowness for genericity*. Archive for Mathematical Logic, vol. 45 (2006), no. 2, pp. 233–238.