Iterative Forcing and Hyperimmunity in Reverse Mathematics
From MaRDI portal
Publication:3195708
DOI10.1007/978-3-319-20028-6_30zbMath1461.03011arXiv1501.07709MaRDI QIDQ3195708
Publication date: 20 October 2015
Published in: Evolving Computability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.07709
03B30: Foundations of classical theories (including reverse mathematics)
03D25: Recursively (computably) enumerable sets and degrees
03D28: Other Turing degree structures
Related Items
On the logical strengths of partial solutions to mathematical problems, RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION, Thin set theorems and cone avoidance, OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS, The weakness of being cohesive, thin or free in reverse mathematics, The proof-theoretic strength of Ramsey's theorem for pairs and two colors, Dominating the Erdős-Moser theorem in reverse mathematics, The reverse mathematics of non-decreasing subsequences, Controlling iterated jumps of solutions to combinatorial problems, THE STRENGTH OF THE TREE THEOREM FOR PAIRS IN REVERSE MATHEMATICS, Partial Orders and Immunity in Reverse Mathematics
Cites Work
- Unnamed Item
- Unnamed Item
- Degrees bounding principles and universal instances in reverse mathematics
- The weakness of being cohesive, thin or free in reverse mathematics
- Ramsey-type graph coloring and diagonal non-computability
- The thin set theorem for pairs implies DNR
- The strength of infinitary Ramseyan principles can be accessed by their densities
- Some logically weak Ramseyan theorems
- On the strength of Ramsey's theorem for pairs
- Separating principles below
- Controlling iterated jumps of solutions to combinatorial problems
- On notions of computability-theoretic reduction between Π21 principles
- Slicing the Truth
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- The atomic model theorem and type omitting
- The strength of the rainbow Ramsey Theorem
- A cohesive set which is not high
- SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS
- ∏ 0 1 Classes and Degrees of Theories
