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 theore

First Page		Document Content
Date: 2013-09-25 08:51:12 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		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 theore Add to Reading List Source URL: www.mathematik.tu-darmstadt.de Download Document from Source Website File Size: 751,81 KB Share Document on Facebook

	A MODEL OF SECOND-ORDER ARITHMETIC SATISFYING AC BUT NOT DC SY-DAVID FRIEDMAN AND VICTORIA GITMAN Abstract. We show that there is a β-model of second-order arithmetic in which the choice scheme holds, but the dependent DocID: 1uyPX - View Document
	Introduction Descriptive Set Theory in SOA Collapsing a model of ZFC Sharps # Collapsing a model of ZFC DocID: 1qsyF - View Document
	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 theore DocID: 1okaY - View Document
	BROWN’S LEMMA IN SECOND-ORDER ARITHMETIC EMANUELE FRITTAION Abstract. We show that Brown’s lemma is equivalent to IΣ02 over RCA∗0 . We also show that (the infinite) van der Waerden’s theorem is equivalent to BΣ DocID: 1ofdc - View Document
	Investigations of Subsystems of Second Order Arithmetic and Set Theory in Strength between Π11 -CA and ∆12 -CA + BI: Part I Michael Rathjen Department of Pure Mathematics University of Leeds DocID: 1nSUJ - View Document