Proof Mining: A Systematic Way of Analysing Proofs in Mathematics (2002)

by Ulrich Kohlenbach , Paulo B. Oliva
Citations:15 - 5 self

Active Bibliography

9 Proof Interpretations and the Computational Content of Proofs. Draft of book in preparation – Ulrich Kohlenbach - 2007
44 Some Logical Metatheorems with Applications in Functional Analysis – Ulrich Kohlenbach - 2003
4 Gödel’s functional interpretation and its use in current mathematics – Ulrich Kohlenbach
1 PROOF INTERPRETATIONS AND MAJORIZABILITY – Fernando Ferreira
4 On the Computational Content of the Bolzano-Weierstraß Principle – Pavol Safarik, Ulrich Kohlenbach - 2009
31 General logical metatheorems for functional analysis – Philipp Gerhardy, Ulrich Kohlenbach - 2008
10 On the Uniform Weak König's Lemma – Ulrich Kohlenbach - 1999
9 On the Arithmetical Content of Restricted Forms of Comprehension, Choice and General Uniform Boundedness – Ulrich Kohlenbach - 1997
BAR RECURSION AND PRODUCTS OF SELECTION FUNCTIONS – Martín Escardó, Paulo Oliva
7 Modified Bar Recursion – Ulrich Berger, Paulo B. Oliva - 2002
3 Effective bounds on strong unicity in L_1-approximation – Ulrich Kohlenbach, Paulo B. Oliva - 2001
10 Proof mining in L_1-approximation – Ulrich Kohlenbach, Paulo Oliva - 2001
10 Strongly Uniform Bounds from Semi-Constructive Proofs – Philipp Gerhardy, Ulrich Kohlenbach - 2004
2 1 General introduction – unknown authors
11 On the computational content of the Krasnoselski and Ishikawa fixed point theorems – Ulrich Kohlenbach - 2000
2 Injecting uniformities into Peano arithmetic – Fernando Ferreira - 2008
2 A most artistic package of a jumble of ideas – Fernando Ferreira
11 Foundational and mathematical uses of higher types – Ulrich Kohlenbach - 1999
The computational strength of . . . weak König’s lemma – Ulrich Kohlenbach - 1998