Reverse mathematics and a Ramsey-type König's Lemma
From MaRDI portal
Publication:4899173
DOI10.2178/jsl.7704120zbMath1259.03022arXiv1111.2526WikidataQ124918191 ScholiaQ124918191MaRDI QIDQ4899173
Publication date: 7 January 2013
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.2526
03B30: Foundations of classical theories (including reverse mathematics)
03F35: Second- and higher-order arithmetic and fragments
Related Items
On the logical strengths of partial solutions to mathematical problems, COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS, A packed Ramsey’s theorem and computability theory, OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS, Primitive recursive reverse mathematics, The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem, Degrees bounding principles and universal instances in reverse mathematics, Ordinals and graph decompositions, Ramsey-type graph coloring and diagonal non-computability, The proof-theoretic strength of Ramsey's theorem for pairs and two colors, Pigeons do not jump high, Separating principles below
Cites Work
- Unnamed Item
- Stable Ramsey's theorem and measure
- On the strength of Ramsey's theorem
- On the strength of Ramsey's theorem for pairs
- A Δ20 set with no infinite low subset in either it or its complement
- On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics
- Effective presentability of Boolean algebras of Cantor-Bendixson rank 1
- A cohesive set which is not high