Publisher： Cambridge University Press
E-ISSN： 1943-5886|74|4|1438-1439
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.74, Iss.4, 2009-12, pp. : 1438-1439
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
On the strength of Ramsey's theorem for pairs
The Journal of Symbolic Logic, Vol. 66, Iss. 1, 2001-03 ,pp. :
Access to resources
Recommend
The strength of the rainbow Ramsey Theorem
The Journal of Symbolic Logic, Vol. 74, Iss. 4, 2009-12 ,pp. :
Term extraction and Ramsey's theorem for pairs
The Journal of Symbolic Logic, Vol. 77, Iss. 3, 2012-09 ,pp. :
Combinatorial principles weaker than Ramsey's Theorem for pairs
The Journal of Symbolic Logic, Vol. 72, Iss. 1, 2007-03 ,pp. :
THE STRENGTH OF RAMSEY’S THEOREM FOR COLORING RELATIVELY LARGE SETS
The Journal of Symbolic Logic, Vol. 79, Iss. 1, 2014-04 ,pp. :