Skip to main content Accessibility help
×
×
Home

THE STRENGTH OF THE TREE THEOREM FOR PAIRS IN REVERSE MATHEMATICS

  • LUDOVIC PATEY (a1)

Abstract

No natural principle is currently known to be strictly between the arithmetic comprehension axiom (ACA0) and Ramsey’s theorem for pairs ( $RT_2^2$ ) in reverse mathematics. The tree theorem for pairs ( $TT_2^2$ ) is however a good candidate. The tree theorem states that for every finite coloring over tuples of comparable nodes in the full binary tree, there is a monochromatic subtree isomorphic to the full tree. The principle $TT_2^2$ is known to lie between ACA0 and $RT_2^2$ over RCA0, but its exact strength remains open. In this paper, we prove that $RT_2^2$ together with weak König’s lemma (WKL0) does not imply $TT_2^2$ , thereby answering a question of Montálban. This separation is a case in point of the method of Lerman, Solomon and Towsner for designing a computability-theoretic property which discriminates between two statements in reverse mathematics. We therefore put the emphasis on the different steps leading to this separation in order to serve as a tutorial for separating principles in reverse mathematics.

Copyright

References

Hide All
[1] Bienvenu, L., Patey, L., and Shafer, P., On the logical strengths of partial solutions to mathematical problems, 2015, submitted, available at http://arxiv.org/abs/1411.5874.
[2] 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. 01, pp. 155.
[3] Chong, C., Slaman, T., and Yang, Y., The metamathematics of stable Ramsey’s theorem for pairs . Journal of the American Mathematical Society, vol. 27 (2014), no. 3, pp. 863892.
[4] Chubb, J., Hirst, J. L., and McNicholl, T. H., Reverse mathematics, computability, and partitions of trees , this Journal, vol. 74 (2009), no. 01, pp. 201215.
[5] Corduan, J., Groszek, M. J., and Mileti, J. R., Reverse mathematics and Ramsey’s property for trees , this Journal, vol. 75 (2010), no. 03, pp. 945954.
[6] 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. 13211359.
[7] Dzhafarov, D. D., Cohesive avoidance and strong reductions . Proceedings of the American Mathematical Society, vol. 143 (2014), no. 2, pp. 869876.
[8] Dzhafarov, D. D., Hirst, J. L., and Lakins, T. J., Ramsey’s theorem for trees: The polarized tree theorem and notions of stability . Archive for Mathematical Logic, vol. 49 (2010), no. 3, pp. 399415.
[9] Dzhafarov, D. D. and Jockusch, C. G., Ramsey’s theorem and cone avoidance , this Journal, vol. 74 (2009), no. 2, pp. 557578.
[10] Flood, S., Reverse mathematics and a Ramsey-type König’s lemma , this Journal, vol. 77 (2012), no. 4, pp. 12721280.
[11] Flood, S. and Towsner, H., Separating principles below WKL 0, 2014, submitted. Available at http://arxiv.org/abs/1410.4068.
[12] Friedman, H. M., Some systems of second order arithmetic and their use , Proceedings of the International Congress of Mathematicians, vol. 1, Canadian Mathematical Society, Montreal, Vancouver, 1974, pp. 235242.
[13] Frittaion, E. and Patey, L., Coloring the rationals in reverse mathematics, 2015, submitted, available at http://arxiv.org/abs/1508.00752.
[14] Hirschfeldt, D. R., Slicing the Truth, Lecture Notes Series, Institute for Mathematical Sciences, vol. 28, National University of Singapore, World Scientific Publishing, Hackensack, NJ, 2014.
[15] Hirschfeldt, D. R. and Jockusch, C. G., On notions of computability theoretic reduction between ${\rm{\Pi }}_2^1$ principles, to appear.
[16] Jockusch, C. G., Ramsey’s theorem and recursion theory , this Journal, vol. 37 (1972), no. 2, pp. 268280.
[17] Lerman, M., Solomon, R., and Towsner, H., Separating principles below Ramsey’s theorem for pairs . Journal of Mathematical Logic, vol. 13 (2013), no. 02, p. 1350007.
[18] Liu, L., RT 2 2 does not imply WKL 0 , this Journal, vol. 77 (2012), no. 2, pp. 609620.
[19] McNicholl, T. H., The inclusion problem for generalized frequency classes, Ph.D. thesis, George Washington University, ProQuest LLC, Ann Arbor, MI, 1995.
[20] Mileti, J. R., Partition theorems and computability theory, Ph.D. thesis, Carnegie Mellon University, ProQuest LLC, Ann Arbor, MI, 2004.
[21] Montalbán, A., Open questions in reverse mathematics , this Journal, vol. 17 (2011), no. 03, pp. 431454.
[22] Patey, L., A note on “Separating principles below Ramsey’s theorem for pairs”, (2013), unpublished. Available at http://ludovicpatey.com/media/research/note-em-sts.pdf.
[23] Patey, L., 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. 291301.
[24] Patey, L., Ramsey-type graph coloring and diagonal non-computability . Archive for Mathematical Logic, vol. 54 (2015), no. 7–8, pp. 899914.
[25] Patey, L., The weakness of being cohesive, thin or free in reverse mathematics, 2015, submitted. Available at http://arxiv.org/abs/1502.03709.
[26] Patey, L., The reverse mathematics of ramsey-type theorems , Ph.D. thesis, Université Paris Diderot, 2016.
[27] 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. 570582.
[28] Shoenfield, J. R., On degrees of unsolvability , Annals of Mathematics, vol. 69 (1959), no. 03, pp. 644653.
[29] Simpson, S. G., Subsystems of Second Order Arithmetic, Cambridge University Press, Cambridge, Association for Symbolic Logic, Poughkeepsie, NY, 2009.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed