Date: 2009-07-29 17:55:43Mathematics Theory of computation PA degree Computable function Reverse mathematics Model theory Forcing Combinatory logic Primitive recursive function Computability theory Mathematical logic Theoretical computer science | | 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 ListSource URL: www.math.uiuc.eduDownload Document from Source Website File Size: 211,93 KBShare Document on Facebook
|