2007 |
26 | EE | Thomas Streicher,
Ulrich Kohlenbach:
Shoenfield is Gödel after Krivine.
Math. Log. Q. 53(2): 176-179 (2007) |
2006 |
25 | EE | Philipp Gerhardy,
Ulrich Kohlenbach:
Strongly uniform bounds from semi-constructive proofs.
Ann. Pure Appl. Logic 141(1-2): 89-107 (2006) |
24 | EE | Ulrich Kohlenbach:
A Logical Uniform Boundedness Principle for Abstract Metric and Hyperbolic Spaces.
Electr. Notes Theor. Comput. Sci. 165: 81-93 (2006) |
2005 |
23 | EE | Ulrich Kohlenbach:
Proof Mining in Functional Analysis.
CiE 2005: 233-234 |
22 | EE | Ulrich Kohlenbach,
Laurentiu Leustean:
Approximate fixed points of nonexpansive functions in product spaces.
Mathematics, Algorithms, Proofs 2005 |
21 | EE | Philipp Gerhardy,
Ulrich Kohlenbach:
Generalized metatheorems on the extractability of uniform bounds in functional analysis.
Mathematics, Algorithms, Proofs 2005 |
20 | EE | Philipp Gerhardy,
Ulrich Kohlenbach:
Extracting Herbrand disjunctions by functional interpretation.
Arch. Math. Log. 44(5): 633-644 (2005) |
19 | EE | Mircea-Dan Hernest,
Ulrich Kohlenbach:
A complexity analysis of functional interpretations.
Theor. Comput. Sci. 338(1-3): 200-246 (2005) |
2004 |
18 | EE | Yohji Akama,
Stefano Berardi,
Susumu Hayashi,
Ulrich Kohlenbach:
An Arithmetical Hierarchy of the Law of Excluded Middle and Related Principles.
LICS 2004: 192-201 |
2003 |
17 | EE | Ulrich Kohlenbach,
Paulo Oliva:
Proof mining in L1-approximation.
Ann. Pure Appl. Logic 121(1): 1-38 (2003) |
2002 |
16 | | Ulrich Kohlenbach:
On uniform weak König's lemma.
Ann. Pure Appl. Logic 114(1-3): 103-116 (2002) |
15 | EE | Ulrich Kohlenbach:
On Weak Markov's Principle.
Math. Log. Q. 48(S1): 59-65 (2002) |
2001 |
14 | EE | Ulrich Kohlenbach:
A note on Spector's quantifier-free rule of extensionality.
Arch. Math. Log. 40(2): 89-92 (2001) |
13 | EE | Ulrich Kohlenbach:
Intuitionistic Choice and Restricted Classical Logic.
Math. Log. Q. 47(4): 455-460 (2001) |
2000 |
12 | EE | Ulrich Kohlenbach:
On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems.
CCA 2000: 119-145 |
11 | | Ulrich Kohlenbach:
Things That Can and Things That Cannot Be Done in PRA.
Ann. Pure Appl. Logic 102(3): 223-245 (2000) |
10 | | Carsten Butz,
Ulrich Kohlenbach,
Søren Riis,
Glynn Winskel:
Preface.
Ann. Pure Appl. Logic 104(1-3): 1-2 (2000) |
1999 |
9 | | Ulrich Kohlenbach:
On The No-Counterexample Interpretation.
J. Symb. Log. 64(4): 1491-1511 (1999) |
8 | | Ulrich Kohlenbach:
A Note on Goodman's Theorem.
Studia Logica 63(1): 1-5 (1999) |
1998 |
7 | | Ulrich Kohlenbach:
On the Arithmetical Content of Restricted Forms of Comprehension, Choice and General Uniform Boundedness.
Ann. Pure Appl. Logic 95(1-3): 257-285 (1998) |
6 | EE | Ulrich Kohlenbach:
Elimination of Skolem functions for monotone formulas in analysis.
Arch. Math. Log. 37(5-6): 363-390 (1998) |
5 | EE | Ulrich Kohlenbach:
Proof theory and computational analysis.
Electr. Notes Theor. Comput. Sci. 13: (1998) |
4 | | Ulrich Kohlenbach:
Relative Constructivity.
J. Symb. Log. 63(4): 1218-1238 (1998) |
1996 |
3 | EE | Ulrich Kohlenbach:
Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals.
Arch. Math. Log. 36(1): 31-71 (1996) |
1993 |
2 | | Ulrich Kohlenbach:
Effective Moduli from Ineffective Uniqueness Proofs. An Unwinding of de La Vallée Poussin's Proof for Chebycheff Approximation.
Ann. Pure Appl. Logic 64(1): 27-94 (1993) |
1992 |
1 | | Ulrich Kohlenbach:
Effective Bounds from Ineffective Proofs in Analysis: An Application of Functional Interpretation and Majorization.
J. Symb. Log. 57(4): 1239-1273 (1992) |