Abstract
We study the strength of some combinatorial principles weaker than Ramsey theorem for pairs over RCA0. First, we prove that Rainbow Ramsey theorem for pairs does not imply Thin Set theorem for pairs. Furthermore, we get some other related results on reverse mathematics using the same method. For instance, Rainbow Ramsey theorem for pairs is strictly weaker than Erdős-Moser theorem under RCA0.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Frontiers of mathematics in China : selected papers from Chinese universities
Paper Title
Journal
Date
