RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION
From MaRDI portal
Publication:5070463
DOI10.1017/jsl.2020.69zbMath1505.03028arXiv1901.04388OpenAlexW3098647228MaRDI QIDQ5070463
Publication date: 12 April 2022
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.04388
Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the strength of Ramsey's theorem
- Pigeons do not jump high
- The strength of infinitary Ramseyan principles can be accessed by their densities
- Coloring trees in reverse mathematics
- Some logically weak Ramseyan theorems
- On the strength of Ramsey's theorem for pairs
- On uniform relationships between combinatorial problems
- RT22 does not imply WKL0
- On notions of computability-theoretic reduction between Π21 principles
- Iterative Forcing and Hyperimmunity in Reverse Mathematics
- Partition Theorems and Computability Theory
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- Reverse mathematics, computability, and partitions of trees
- Ramsey's theorem and cone avoidance
- The strength of the rainbow Ramsey Theorem
- Hyperarithmetically Encodable Sets
- Iterative forcing and hyperimmunity in reverse mathematics
- Thin set theorems and cone avoidance
- Bounding prime models
- OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS
- Ramsey's theorem and recursion theory
This page was built for publication: RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION
