RAMSEY’S THEOREM AND CONE AVOIDANCE DAMIR D. DZHAFAROV AND CARL G. JOCKUSCH, JR. Abstract. It was shown by Cholak, Jockusch, and Slaman that every computable 2-coloring of pairs admits an infinite low2 homogeneous set - Ramsey problem - Document - PDFSEARCH.IO

First Page	Meta Content
	RAMSEY’S THEOREM AND CONE AVOIDANCE DAMIR D. DZHAFAROV AND CARL G. JOCKUSCH, JR. Abstract. It was shown by Cholak, Jockusch, and Slaman that every computable 2-coloring of pairs admits an infinite low2 homogeneous set Add to Reading List Document Date: 2009-07-29 17:59:20 Open Document File Size: 261,87 KB Share Result on Facebook Event Person Communication and Meetings / / Person Steffen Lempp / D. DZHAFAROV / CARL G. JOCKUSCH / JR. / Joseph Mileti / Robert Soare / Denis Hirschfeldt / Linda Lawton / / Position second author / / ProvinceOrState Indiana / / SocialTag Logic Theory of computation Congruence lattice problem Mathematics Computability theory Forcing

RAMSEY’S THEOREM AND CONE AVOIDANCE DAMIR D. DZHAFAROV AND CARL G. JOCKUSCH, JR. Abstract. It was shown by Cholak, Jockusch, and Slaman that every computable 2-coloring of pairs admits an infinite low2 homogeneous set Add to Reading List