Cappable CEA sets and Ramsey's theorem

DOI10.1142/9789814360548_0007MaRDI QIDQ4922663zbMATH OpenOpenAlexFDO

Authors Asher M. Kach, Manuel Lerman, Reed Solomon

Publication date 3 June 2013

Published in Proceedings of the 11th Asian Logic Conference (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789814360548_0007

zbMATH Keywords

computable stable coloring of pairsRamsey's theorem for pairsreverse mathematicsTuring degrees

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Set-theoretic model theory (03C55) Computable structure theory, computable model theory (03C57) Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Recommendations

• Separating principles below Ramsey's theorem for pairs
• scientific article; zbMATH DE number 7377981
• Effective versions of Ramsey's Theorem: Avoiding the cone above 0′
• On the strength of Ramsey's theorem
• On the strength of Ramsey's theorem for pairs

Cited in

(2)

• Ramsey's theorem and cone avoidance
• The strength of the rainbow Ramsey Theorem

This page was built for publication: Cappable CEA sets and Ramsey's theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922663)