[1]
Berardi, S. and Steila, S., Ramsey Theorem for pairs as a classical principle in intuitionistic arithmetic, 19th International Conference on Types for Proofs and Programs(Types 2013) (Matthes, R. and Schubert, A., editors), Leibniz International Proceedings in Informatics (LIPIcs), vol. 26, Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, 2014, pp. 64–83.

[2]
Brattka, V., Effective Borel measurability and reducibility of functions. Mathematical Logic Quarterly, vol. 51 (2005), no. 1, pp. 19–44.

[3]
Brattka, V., de Brecht, M., and Pauly, A., Closed choice and a uniform low basis theorem. Annals of Pure and Applied Logic, vol. 163 (2012), pp. 986–1008.

[4]
Brattka, V. and Gherardi, G., Effective choice and boundedness principles in computable analysis. The Bulletin of Symbolic Logic, vol. 17 (2011), no. 1, pp. 73–117.

[5]
Brattka, V. and Gherardi, G., Weihrauch degrees, omniscience principles and weak computability, this Journal, vol. 76 (2011), no. 1, pp. 143–176.

[6]
Brattka, V., Gherardi, G., and Hölzl, R., Probabilistic computability and choice. Information and Computation, vol. 242 (2015), pp. 249–286.

[7]
Brattka, V., Gherardi, G., and Marcone, A., The Bolzano-Weierstrass theorem is the jump of weak Kőnig’s lemma. Annals of Pure and Applied Logic, vol. 163 (2012), pp. 623–655.

[8]
Brattka, V., Hendtlass, M., and Kreuzer, A. P., On the uniform computational content of computability theory.Theory of Computing Systems (2017), arXiv:1501.00433.

[9]
Brattka, V., Hertling, P., and Weihrauch, K., A tutorial on computable analysis, New Computational Paradigms: Changing Conceptions of What is Computable (Barry Cooper, S., Löwe, B., and Sorbi, A., editors), Springer, New York, 2008, pp. 425–491.

[10]
Brattka, V., Le Roux, S., Miller, J. S., and Pauly, A., Connected choice and the Brouwer fixed point theorem, preprint, 2016, arXiv 1206.4809.

[11]
Brattka, V. and Pauly, A., On the algebraic structure of Weihrauch degrees, preprint, 2016, arXiv 1604.08348.

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

[13]
Cholak, P. A., Jockusch, C. G., and Slaman, T. A., Corrigendum to: “On the strength of Ramsey’s theorem for pairs”, this Journal, vol. 74 (2009), no. 4, pp. 1438–1439.

[14]
Chong, C. T., Lempp, S., and Yang, Y., 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.
[15]
Chong, C. T., Slaman, T. A., and Yang, Y., The metamathematics of stable Ramsey’s theorem for pairs. Journal of the American Mathematical Society, vol. 27 (2014), no. 3, pp. 863–892.

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

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

[18]
Dzhafarov, D. D., Strong reductions between combinatorial principles, this Journal, vol. 81 (2016), no. 4, pp. 1405–1431.

[19]
Erdős, P., Hajnal, A., Máté, A., and Rado, R., Combinatorial Set Theory:Partition Relations for Cardinals, Studies in Logic and the Foundations of Mathematics, vol. 106, North-Holland Publishing Co., Amsterdam, 1984.

[20]
Gherardi, G. and Marcone, A., How incomputable is the separable Hahn-Banach theorem?
Notre Dame Journal of Formal Logic, vol. 50 (2009), no. 4, pp. 393–425.

[21]
Hájek, P. and Pudlák, P., Metamathematics of First-Order Arithmetic, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1993.

[22]
Hirschfeldt, D. R., Slicing the Truth, on the Computable and Reverse Mathematics of Combinatorial Principles, Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore, vol. 28, World Scientific, Singapore, 2015.

[23]
Hirschfeldt, D. R. and Jockusch, C. G., On notions of computability-theoretic reduction between
${\rm{\Pi }}_2^1$
principles. Journal of Mathematical Logic, vol. 16 (2016), no. 1, pp. 1650002, 59.
[24]
Hirschfeldt, D. R., Jockusch, C. G. Jr., Kjos-Hanssen, B., Lempp, S., and Slaman, T. A., The strength of some combinatorial principles related to Ramsey’s theorem for pairs, Computational Prospects of Infinity. Part II. Presented Talks (Chong, C., Feng, Q., Slaman, T. A., Woodin, W. H., and Yang, Y., editors), Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore, vol. 15, World Scientific Publishing, Hackensack, NJ, 2008, pp. 143–161.

[25]
Hirst, J. L., Combinatorics in subsystems of second order arithmetic, Ph.D. thesis, The Pennsylvania State University, State College, PA, 1987.

[26]
Jockusch, C. G. Jr., Ramsey’s theorem and recursion theory, this Journal, vol. 37 (1972), pp. 268–280.

[27]
Kechris, A. S., Classical Descriptive Set Theory, Graduate Texts in Mathematics, vol. 156, Springer, Berlin, 1995.

[28]
Kreuzer, A. and Kohlenbach, U., Ramsey’s theorem for pairs and provably recursive functions. Notre Dame Journal of Formal Logic, vol. 50 (2009), no. 4, pp. 427–444 (2010).

[29]
Kreuzer, A. P. and Kohlenbach, U., Term extraction and Ramsey’s theorem for pairs, this Journal, vol. 77 (2012), no. 3, pp. 853–895.

[30]
Liu, J.,
$RT_2^2$
*does not imply WKL*
_{0}, this Journal, vol. 77 (2012), no. 2, pp. 609–620.
[31]
Liu, L., Cone avoiding closed sets. Transactions of the American Mathematical Society, vol. 367 (2015), no. 3, pp. 1609–1630.

[32]
Patey, L., The weakness of being cohesive, thin or free in reverse mathematics. Israel Journal of Mathematics, vol. 216 (2016), pp. 905–955.

[33]
Pauly, A., How incomputable is finding Nash equilibria?
Journal of Universal Computer Science, vol. 16 (2010), no. 18, pp. 2686–2710.

[34]
Rakotoniaina, T., On the computational strength of Ramsey’s theorem, Ph.D. thesis, Department of Mathematics and Applied Mathematics, University of Cape Town, Rondebosch, South Africa, 2015.

[35]
Ramsey, F. P., On a Problem of Formal Logic. Proceedings of the London Mathematical Society, vol. S2–30 (1930), no. 1, p. 264.

[36]
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, Special Issue: Models of arithmetic.

[37]
Simpson, S. G., Subsystems of Second Order Arithmetic, second ed., Perspectives in Logic, Association for Symbolic Logic, Cambridge University Press, Poughkeepsie, 2009.

[38]
Specker, E., Ramsey’s Theorem does not hold in recursive set theory, Logic Colloquium (Proceedings of the Summer School and Colloquium, Manchester, 1969) (Gandy, R. O. and Yates, C. M. E., editors), North-Holland, Amsterdam, 1971, pp. 439–442.

[39]
Weihrauch, K., Computable Analysis, Springer, Berlin, 2000.