THE STRENGTH OF SOME COMBINATORIAL PRINCIPLES RELATED TO RAMSEY’S THEOREM FOR PAIRS DENIS R. HIRSCHFELDT, CARL G. JOCKUSCH, JR., BJØRN KJOS-HANSSEN, STEFFEN LEMPP, AND THEODORE A. SLAMAN Abstract. We study the reverse - Computable model theory - Document - PDFSEARCH.IO

First Page	Meta Content
	THE STRENGTH OF SOME COMBINATORIAL PRINCIPLES RELATED TO RAMSEY’S THEOREM FOR PAIRS DENIS R. HIRSCHFELDT, CARL G. JOCKUSCH, JR., BJØRN KJOS-HANSSEN, STEFFEN LEMPP, AND THEODORE A. SLAMAN Abstract. We study the reverse Add to Reading List Document Date: 2009-07-29 17:55:43 Open Document File Size: 211,93 KB Share Result on Facebook Facility National University of Singapore / Stable Ramsey’s Theorem / S stable / / Organization National Science Foundation / National University of Singapore / Institute for Mathematical Sciences / / Person CARL G. JOCKUSCH / JR. / THEODORE A. SLAMAN / STEFFEN LEMPP / DENIS R. HIRSCHFELDT / Linda Lawton / / Position author / first author / second author / / ProvinceOrState Pennsylvania / / SocialTag Mathematics Theory of computation PA degree Computable function Reverse mathematics Model theory Forcing Combinatory logic Primitive recursive function Computability theory

THE STRENGTH OF SOME COMBINATORIAL PRINCIPLES RELATED TO RAMSEY’S THEOREM FOR PAIRS DENIS R. HIRSCHFELDT, CARL G. JOCKUSCH, JR., BJØRN KJOS-HANSSEN, STEFFEN LEMPP, AND THEODORE A. SLAMAN Abstract. We study the reverseAdd to Reading List