Title: Open questions about Ramsey-type statements in reverse mathematics
Abstract: Ramsey's theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set H such that all n-element subsets of H have the same color. The strength of consequences of Ramsey's theorem has been extensively studied in reverse mathematics and under various reducibilities, namely, computable reducibility and uniform reducibility. Our understanding of the combinatorics of Ramsey's theorem and its consequences has been greatly improved over the past decades. In this paper, we state some questions which naturally arose during this study. The inability to answer those questions reveals some gaps in our understanding of the combinatorics of Ramsey's theorem.
Publication Year: 2015
Publication Date: 2015-06-15
Language: en
Type: preprint
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot