Ramsey's theorem and cone avoidance
From MaRDI portal
Publication:3630579
DOI10.2178/jsl/1243948327zbMath1166.03021OpenAlexW1984983426MaRDI QIDQ3630579
Damir D. Dzhafarov, Carl G. jun. Jockusch
Publication date: 4 June 2009
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.155.902
minimal pairRamsey's theoremcomputable 2-coloring of pairscone avoidance theoreminfinite homogeneous sets
Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Applications of computability and recursion theory (03D80) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items
Partial Orders and Immunity in Reverse Mathematics, RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS, RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION, Coloring trees in reverse mathematics, The reverse mathematics of non-decreasing subsequences, OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS, A variant of Mathias forcing that preserves \(\mathsf{ACA}_0\), The coding power of a product of partitions, Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective, Generics for computable Mathias forcing, Some logically weak Ramseyan theorems, Genericity for Mathias forcing over general Turing ideals, The weakness of the pigeonhole principle under hyperarithmetical reductions, On the indecomposability of \(\omega^n\), On uniform relationships between combinatorial problems, Pigeons do not jump high, Cohesive avoidance and strong reductions, Cone avoiding closed sets
Cites Work
- Unnamed Item
- On the strength of Ramsey's theorem
- On the strength of Ramsey's theorem for pairs
- Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
- A cohesive set which is not high
- Effective versions of Ramsey's Theorem: Avoiding the cone above 0′
- Class groups of integral group rings
