Controlling iterated jumps of solutions to combinatorial problems
From MaRDI portal
Publication:2964279
DOI10.3233/COM-160056zbMath1420.03027arXiv1509.05340OpenAlexW2964251305MaRDI QIDQ2964279
Publication date: 23 February 2017
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.05340
Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Other aspects of forcing and Boolean-valued models (03E40) Hierarchies of computability and definability (03D55)
Related Items (5)
Iterative Forcing and Hyperimmunity in Reverse Mathematics ⋮ The weakness of being cohesive, thin or free in reverse mathematics ⋮ Computing sets from all infinite subsets ⋮ \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models ⋮ The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma
Cites Work
- Unnamed Item
- Cohesive sets and rainbows
- Primitive recursion and the chain antichain principle
- Degrees bounding principles and universal instances in reverse mathematics
- On the strength of Ramsey's theorem
- Generics for computable Mathias forcing
- Some logically weak Ramseyan theorems
- On the strength of Ramsey's theorem for pairs
- Denis R. Hirschfeldt. Slicing the truth: On the computable and reverse mathematics of combinatorial principles. Lecture Note Series, Institute for Mathematical Sciences, National University of Singapore, vol. 28. World Scientific Publishing Co. Pte. Ltd., Singapore, 2015, xiv+214 pp.
- Iterative Forcing and Hyperimmunity in Reverse Mathematics
- On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics
- The strength of the rainbow Ramsey Theorem
- A cohesive set which is not high
- SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS
- Degrees in Which the Recursive Sets are Uniformly Recursive
- Ramsey's theorem and recursion theory
This page was built for publication: Controlling iterated jumps of solutions to combinatorial problems
