Rainbow Ramsey Theorem for Triples is Strictly Weaker than the Arithmetical Comprehension Axiom

DOI10.2178/JSL.7803070zbMath1300.03013arXiv1303.3327OpenAlexW2592247263WikidataQ114005164 ScholiaQ114005164MaRDI QIDQ2869903

Wei Wang

Publication date: 7 January 2014

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

ACAreverse mathematicscohesive setrainbow Ramsey theoremarithmetical comprehensioncone avoidance

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35)

Related Items (5)

Cohesive sets and rainbows ⋮ Some logically weak Ramseyan theorems ⋮ The weakness of the pigeonhole principle under hyperarithmetical reductions ⋮ On uniform relationships between combinatorial problems ⋮ Pigeons do not jump high

Cites Work

• Unnamed Item
• On the strength of Ramsey's theorem
• On the strength of Ramsey's theorem for pairs
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• Class groups of integral group rings

This page was built for publication: Rainbow Ramsey Theorem for Triples is Strictly Weaker than the Arithmetical Comprehension Axiom