Partial Orders and Immunity in Reverse Mathematics
From MaRDI portal
Publication:3188275
DOI10.1007/978-3-319-40189-8_36zbMath1476.03005arXiv1607.04506OpenAlexW2473588762MaRDI QIDQ3188275
Publication date: 17 August 2016
Published in: Pursuit of the Universal (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.04506
Partial orders, general (06A06) Combinatorics of partially ordered sets (06A07) Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Second- and higher-order arithmetic and fragments (03F35)
Related Items (6)
RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS ⋮ THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS ⋮ The Reverse Mathematics of wqos and bqos ⋮ Thin set theorems and cone avoidance ⋮ Constructing sequences one step at a time ⋮ COH, SRT 2 2 , and multiple functionals
Cites Work
- Unnamed Item
- Reverse mathematical bounds for the termination theorem
- The weakness of being cohesive, thin or free in reverse mathematics
- On the strength of Ramsey's theorem
- The strength of infinitary Ramseyan principles can be accessed by their densities
- On the strength of Ramsey's theorem for pairs
- Independence of Ramsey theorem variants using $\varepsilon _0$
- Iterative Forcing and Hyperimmunity in Reverse Mathematics
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs
- Ramsey's theorem and cone avoidance
- The strength of the rainbow Ramsey Theorem
- On the logical strengths of partial solutions to mathematical problems
- On the Ramseyan Factorization Theorem
- OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS
- SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS
- Cone avoiding closed sets
- Ramsey's theorem and recursion theory
This page was built for publication: Partial Orders and Immunity in Reverse Mathematics