On uniform weak K¨onig’s lemma Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade

First Page		Document Content
Date: 2012-11-16 09:11:16 Computability theory Proof theory Mathematical logic Predicate logic Logic in computer science Primitive recursive functional Reverse mathematics Primitive recursive function Primitive recursive arithmetic First-order logic Peano axioms Ordinal analysis		On uniform weak K¨onig’s lemma Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade Add to Reading List Source URL: www.mathematik.tu-darmstadt.de Download Document from Source Website File Size: 156,78 KB Share Document on Facebook

	And the Winners Are... An Axiomatic Approach to Selection from a Set DocID: 1oYwm - 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
	COLORING THE RATIONALS IN REVERSE MATHEMATICS EMANUELE FRITTAION AND LUDOVIC PATEY Abstract. Ramsey’s theorem for pairs asserts that every 2-coloring of the pairs of integers has an infinite monochromatic subset. In th DocID: 1o6FP - View Document
	PROOF MINING: A SYSTEMATIC WAY OF ANALYSING PROOFS IN MATHEMATICS ULRICH KOHLENBACH AND PAULO OLIVA Abstract. We call proof mining the process of logically analyzing proofs in mathematics with the aim of obtaining new i DocID: 1o5JD - View Document
	Herbrand’s theorem and extractive proof theory U. Kohlenbach Department of Mathematics Technische Universit¨at Darmstadt Schlossgartenstrasse 7, 64289 Darmstadt, Germany September 1, 2008 DocID: 1nVyh - View Document