Combinatorial principles between \(\text{RRT}_2^2\) and \(\text{RT}_2^2\)

DOI10.1007/S11464-014-0390-6zbMath1311.03029OpenAlexW2468222923MaRDI QIDQ2258112

Xiaojun Kang

Publication date: 2 March 2015

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11464-014-0390-6

zbMATH Keywords

reverse mathematicsthin setfree setrainbow Ramsey theoremErdős-Moser 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 (3)

OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS ⋮ The weakness of the pigeonhole principle under hyperarithmetical reductions ⋮ Pigeons do not jump high

Cites Work

• Cohesive sets and rainbows
• The strength of infinitary Ramseyan principles can be accessed by their densities
• RT₂² does not imply WKL₀
• The strength of the rainbow Ramsey Theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combinatorial principles between \(\text{RRT}_2^2\) and \(\text{RT}_2^2\)