![Proof theory / Computability theory / Logic in computer science / Mathematical logic / Intuitionism / Primitive recursive functional / Dialectica interpretation / Peano axioms / Second-order arithmetic / Reverse mathematics / Combinatory logic / Primitive recursive arithmetic Proof theory / Computability theory / Logic in computer science / Mathematical logic / Intuitionism / Primitive recursive functional / Dialectica interpretation / Peano axioms / Second-order arithmetic / Reverse mathematics / Combinatory logic / Primitive recursive arithmetic](https://www.pdfsearch.io/img/788f9b6f56724078be343db8398476ae.jpg) Date: 2013-09-25 08:51:12Proof theory Computability theory Logic in computer science Mathematical logic Intuitionism Primitive recursive functional Dialectica interpretation Peano axioms Second-order arithmetic Reverse mathematics Combinatory logic Primitive recursive arithmetic | | TERM EXTRACTION AND RAMSEY’S THEOREM FOR PAIRS ALEXANDER P. KREUZER AND ULRICH KOHLENBACH Abstract. In this paper we study with proof-theoretic methods the function(al)s provably recursive relative to Ramsey’s theoreAdd to Reading ListSource URL: www.mathematik.tu-darmstadt.deDownload Document from Source Website File Size: 751,81 KBShare Document on Facebook
|