Journal of Mathematical Logic 13 (2):1350007 (2013)

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.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1142/s0219061313500074
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 59,848
Through your library

References found in this work BETA

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

Add more references

Citations of this work BETA

Ramsey-Type Graph Coloring and Diagonal Non-Computability.Ludovic Patey - 2015 - Archive for Mathematical Logic 54 (7-8):899-914.
Degrees Bounding Principles and Universal Instances in Reverse Mathematics.Ludovic Patey - 2015 - Annals of Pure and Applied Logic 166 (11):1165-1185.
Reverse Mathematical Bounds for the Termination Theorem.Silvia Steila & Keita Yokoyama - 2016 - Annals of Pure and Applied Logic 167 (12):1213-1241.

View all 11 citations / Add more citations

Similar books and articles


Added to PP index

Total views
6 ( #1,083,474 of 2,432,823 )

Recent downloads (6 months)
1 ( #464,144 of 2,432,823 )

How can I increase my downloads?


My notes