Author:
Corduan Jared,Groszek Marcia
Reference19 articles.
1. [1] Cholak, P., C. Jockusch, and T. Slaman, “On the strength of Ramsey’s theorem for pairs,” Journal of Symbolic Logic, vol. 66 (2001), pp. 1–55.
2. [2] Chong, C. T., T. Slaman, and Yue Yang, “$\Pi_{1}^{1}$-conservation of combinatorial principles weaker than Ramsey’s theorem for pairs,” Advances in Mathematics, vol. 230 (2012), pp. 1060–1077.
3. [3] Chubb, J., J. Hirst, and T. McNicholl, “Reverse mathematics, computability, and partitions of trees,” Journal of Symbolic Logic, vol. 74 (2009), pp. 201–215.
4. [4] Corduan, J., “Coloring posets and reverse mathematics,” Ph.D. dissertation, Dartmouth College, Hanover, N.H., 2011.
5. [5] Corduan, J., M. Groszek, and J. Mileti, “Reverse mathematics and Ramsey’s property for trees,” Journal of Symbolic Logic, vol. 75(2010), pp. 945–954.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献