1. Cholak, P. A.,C. G. Jockusch, andT. A. Slaman, On the strength of Ramsey’s theorem for pairs,The Journal of Symbolic Logic 66(1): 1–55, 2001.

   Article  Google Scholar 

2. Chong, C. T.,T. A. Slaman, andY. Yang, The inductive strength of Ramsey’s theorem for pairs,Advances in Mathematics 308: 121–141, 2017.

   Article  Google Scholar 

3. Hirst, J. L.,Combinatorics in Subsystems of Second Order Arithmetic. Ph.D. thesis, Pennsylvania State University, 1987.

4. Jockusch, C. G., Ramsey’s theorem and recursion theory,The Journal of Symbolic Logic 37(2): 268–280, 1972.

   Article  Google Scholar 

5. Jockusch, C. G., andR. I. Soare,\(\Pi ^0_1\) classes and degrees of theories,Transactions of the American Mathematical Society 361: 5805–5837, 1972.

   Google Scholar 

6. Liu, J.,\({{\sf RT}}^2_2\),The Journal of Symbolic Logic 77(2): 609–620, 2012.

   Article  Google Scholar 

7. Patey, L., andK. Yokoyama, The proof-theoretic strength of Ramsey’s theorem for pairs and two colors, 2016.arXiv:1601.00050v3

8. Seetapun, D., andT. A. Slaman, On the Strength of Ramsey’s Theorem,Notre Dame Journal of Formal Logic 36(4): 570–582, 1995.

   Article  Google Scholar 

9. Simpson, S. G.,Subsystems of Second Order Arithmetic, 2nd edn., Cambridge University Press, Cambridge, 2009.

   Book  Google Scholar 

10. Specker, E., Ramsey’s Theorem does not hold in recursive set theory, in R. O. Gandy, and C. M. E. Yates, (eds.),Logic Colloquium ’69, vol. 61 ofStudies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1971, pp. 439–442.

Download references