Separating principles below Ramsey's theorem for pairs

, &
Journal of Mathematical Logic 13 (2):1350007 (2013)
  Copy   BIBTEX

Abstract

In recent years, there has been a substantial amount of work in reverse mathematics concerning natural mathematical principles that are provable from RT, Ramsey's Theorem for Pairs. These principles tend to fall outside of the "big five" systems of reverse mathematics and a complicated picture of subsystems below RT has emerged. In this paper, we answer two open questions concerning these subsystems, specifically that ADS is not equivalent to CAC and that EM is not equivalent to RT.

Categories

Keywords

Reprint years

DOI

10.1142/s0219061313500074

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,139

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Five papers on reverse mathematics and Ramsey-theoretic principles - C. T. Chong, Theodore A. Slaman, and Yue Yang, The metamathematics of Stable Ramsey’s Theorem for Pairs. Journal of the American Mathematical Society, vol. 27 (2014), no. 3, pp. 863–892. - Manuel Lerman, Reed Solomon, and Henry Towsner, Separating principles below Ramsey’s Theorem for Pairs. Journal of Mathematical Logic, vol. 13 (2013), no. 2, 1350007, 44 pp. - Jiayi Liu, $RT2^^2$ does not imply WKL 0. Journal of Symbolic Logic, vol. 77 (2012), no. 2, pp. 609–620. - Lu Liu, Cone avoiding closed sets. Transactions of the American Mathematical Society, vol. 367 (2015), no. 3, pp. 1609–1630. - Wei Wang, Some logically weak Ramseyan theorems_. Advances in Mathematics, vol. 261 (2014), pp. 1–25. [REVIEW]Denis R. Hirschfeldt - 2016 - Bulletin of Symbolic Logic 22 (4):526-530.
Combinatorial principles weaker than Ramsey's Theorem for pairs.Denis R. Hirschfeldt & Richard A. Shore - 2007 - Journal of Symbolic Logic 72 (1):171-206.
Nonstandard models in recursion theory and reverse mathematics.C. T. Chong, Wei Li & Yue Yang - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
Review of Denis R. Hirschfeldt, Slicing the Truth: On the Computability Theoretic and Reverse Mathematical Analysis of Combinatorial Principles. [REVIEW]Benedict Eastaugh - 2017 - Studia Logica 105 (4):873-879.
Stable Ramsey's Theorem and Measure.Damir D. Dzhafarov - 2011 - Notre Dame Journal of Formal Logic 52 (1):95-112.
Ramsey's Theorem for Pairs and Provably Recursive Functions.Alexander Kreuzer & Ulrich Kohlenbach - 2009 - Notre Dame Journal of Formal Logic 50 (4):427-444.
The polarized Ramsey’s theorem.Damir D. Dzhafarov & Jeffry L. Hirst - 2009 - Archive for Mathematical Logic 48 (2):141-157.
The Thin Set Theorem for Pairs Implies DNR.Brian Rice - 2015 - Notre Dame Journal of Formal Logic 56 (4):595-601.

Analytics

Added to PP
2014-01-23

Downloads
37 (#611,759)

6 months
18 (#163,977)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Degrees bounding principles and universal instances in reverse mathematics.Ludovic Patey - 2015 - Annals of Pure and Applied Logic 166 (11):1165-1185.

View all 16 citations / Add more citations

References found in this work

Primitive Recursion and the Chain Antichain Principle.Alexander P. Kreuzer - 2012 - Notre Dame Journal of Formal Logic 53 (2):245-265.

Add more references