1![And the Winners Are... An Axiomatic Approach to Selection from a Set And the Winners Are... An Axiomatic Approach to Selection from a Set](https://www.pdfsearch.io/img/2e498909dbe7acc1f97a0503ebf84ea1.jpg) | Add to Reading ListSource URL: ftp.iza.orgLanguage: English - Date: 2014-07-30 08:59:45
|
---|
2![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 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](https://www.pdfsearch.io/img/788f9b6f56724078be343db8398476ae.jpg) | Add to Reading ListSource URL: www.mathematik.tu-darmstadt.deLanguage: English - Date: 2013-09-25 08:51:12
|
---|
3![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 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](https://www.pdfsearch.io/img/4a1f5138e20b7a0982305a305ee3bbec.jpg) | Add to Reading ListSource URL: www.math.tohoku.ac.jpLanguage: English - Date: 2016-02-20 21:08:40
|
---|
4![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 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](https://www.pdfsearch.io/img/ffdd6daabb5433d7a6475c54aa624fb0.jpg) | Add to Reading ListSource URL: www.mathematik.tu-darmstadt.deLanguage: English - Date: 2012-11-12 10:21:17
|
---|
5![Herbrand’s theorem and extractive proof theory U. Kohlenbach Department of Mathematics Technische Universit¨at Darmstadt Schlossgartenstrasse 7, 64289 Darmstadt, Germany September 1, 2008 Herbrand’s theorem and extractive proof theory U. Kohlenbach Department of Mathematics Technische Universit¨at Darmstadt Schlossgartenstrasse 7, 64289 Darmstadt, Germany September 1, 2008](https://www.pdfsearch.io/img/116dd01daed22c59c319547e8d6b45e5.jpg) | Add to Reading ListSource URL: www.mathematik.tu-darmstadt.deLanguage: English - Date: 2008-09-01 05:59:33
|
---|
6![FOUNDATIONAL AND MATHEMATICAL USES OF HIGHER TYPES ULRICH KOHLENBACH† DEDICATED TO SOLOMON FEFERMAN FOR HIS 70TH BIRTHDAY §1. Introduction. A central theme of proof theory is expressed by the following question: FOUNDATIONAL AND MATHEMATICAL USES OF HIGHER TYPES ULRICH KOHLENBACH† DEDICATED TO SOLOMON FEFERMAN FOR HIS 70TH BIRTHDAY §1. Introduction. A central theme of proof theory is expressed by the following question:](https://www.pdfsearch.io/img/902cb23719656c6305668528fa97210c.jpg) | Add to Reading ListSource URL: www.mathematik.tu-darmstadt.deLanguage: English - Date: 2012-11-12 10:34:29
|
---|
7![On uniform weak K¨onig’s lemma Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade On uniform weak K¨onig’s lemma Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade](https://www.pdfsearch.io/img/2ff5e004b1340ae2495d25f4380e5b33.jpg) | Add to Reading ListSource URL: www.mathematik.tu-darmstadt.deLanguage: English - Date: 2012-11-16 09:11:16
|
---|
8![OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Ramsey’s theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Ramsey’s theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set](https://www.pdfsearch.io/img/a404a4dedb9d96178b06de6016fa15bf.jpg) | Add to Reading ListSource URL: ludovicpatey.comLanguage: English - Date: 2015-10-26 09:24:01
|
---|
9![École Doctorale de l’École polytechnique I NRIA THÈSE DE DOCTORAT Présentée par École Doctorale de l’École polytechnique I NRIA THÈSE DE DOCTORAT Présentée par](https://www.pdfsearch.io/img/639973b52f32dea41dc6f6f281e62e98.jpg) | Add to Reading ListSource URL: cedeela.frLanguage: English - Date: 2015-10-28 05:35:30
|
---|
10![Notre Dame Journal of Formal Logic Volume 50, Number 1, 2009 Factorization of the Shoenfield-like Bounded Functional Interpretation Jaime Gaspar Notre Dame Journal of Formal Logic Volume 50, Number 1, 2009 Factorization of the Shoenfield-like Bounded Functional Interpretation Jaime Gaspar](https://www.pdfsearch.io/img/e5f7dbae62e5f9414638487b811770e7.jpg) | Add to Reading ListSource URL: jg.sdf.orgLanguage: English - Date: 2016-05-02 10:01:00
|
---|