Some logically weak Ramseyan theorems

DOI10.1016/j.aim.2014.05.003zbMath1307.03011arXiv1303.3331OpenAlexW2111379744MaRDI QIDQ2453567

Wei Wang

Publication date: 10 June 2014

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.3331

zbMATH Keywords

reverse mathematicsRamsey's theoremthin setfree setrainbow Ramsey theorem

Mathematics Subject Classification ID

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 (19)

RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS ⋮ RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION ⋮ THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS ⋮ Iterative Forcing and Hyperimmunity in Reverse Mathematics ⋮ On the strength of Ramsey's theorem for trees ⋮ OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS ⋮ The thin set theorem for pairs implies DNR ⋮ Controlling iterated jumps of solutions to combinatorial problems ⋮ Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective ⋮ THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES ⋮ Degrees bounding principles and universal instances in reverse mathematics ⋮ On the logical strengths of partial solutions to mathematical problems ⋮ The weakness of being cohesive, thin or free in reverse mathematics ⋮ The weakness of the pigeonhole principle under hyperarithmetical reductions ⋮ On uniform relationships between combinatorial problems ⋮ Thin set theorems and cone avoidance ⋮ Pigeons do not jump high ⋮ Constructing sequences one step at a time ⋮ Thin set versions of Hindman's theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cohesive sets and rainbows
• On the strength of Ramsey's theorem
• On the strength of Ramsey's theorem for pairs
• Rainbow Ramsey Theorem for Triples is Strictly Weaker than the Arithmetical Comprehension Axiom
• RT₂² does not imply WKL₀
• The metamathematics of Stable Ramsey’s Theorem for Pairs
• 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
• Partition relations for cardinal numbers
• ∏ 0 1 Classes and Degrees of Theories
• Ramsey's theorem and recursion theory

This page was built for publication: Some logically weak Ramseyan theorems