| 2008 |
|---|
| 15 | EE | Guillaume Bonfante,
Reinhard Kahle,
Jean-Yves Marion,
Isabel Oitavem:
Recursion Schemata for NCk.
CSL 2008: 49-63 |
| 2007 |
|---|
| 14 | EE | Reinhard Kahle:
Edwin D. Mares, Relevant Logic - A Philosophical Interpretation.
Studia Logica 85(3): 419-424 (2007) |
| 13 | EE | Reinhard Kahle:
Freek Wiedijk (Ed.), The Seventeen Provers of the World.
Studia Logica 87(2-3): 369-374 (2007) |
| 2006 |
|---|
| 12 | EE | Guillaume Bonfante,
Reinhard Kahle,
Jean-Yves Marion,
Isabel Oitavem:
Towards an Implicit Characterization of NCk.
CSL 2006: 212-224 |
| 2005 |
|---|
| 11 | EE | Wilfried Buchholz,
Reinhard Kahle:
Preface.
Ann. Pure Appl. Logic 133(1-3): 1- (2005) |
| 2003 |
|---|
| 10 | | Reinhard Kahle:
Universes over Frege structures.
Ann. Pure Appl. Logic 119(1-3): 191-223 (2003) |
| 2001 |
|---|
| 9 | | Reinhard Kahle,
Peter Schroeder-Heister,
Robert F. Stärk:
Proof Theory in Computer Science, International Seminar, PTCS 2001, Dagstuhl Castle, Germany, October 7-12, 2001, Proceedings
Springer 2001 |
| 8 | | Gerhard Jäger,
Reinhard Kahle,
Thomas Studer:
Universes in explicit mathematics.
Ann. Pure Appl. Logic 109(3): 141-162 (2001) |
| 7 | | Reinhard Kahle,
Thomas Studer:
Formalizing non-termination of recursive programs.
J. Log. Algebr. Program. 49(1-2): 1-14 (2001) |
| 6 | | Reinhard Kahle:
Truth in Applicative Theories.
Studia Logica 68(1): 103-128 (2001) |
| 2000 |
|---|
| 5 | EE | Reinhard Kahle,
Thomas Studer:
A Theory of Explicit Mathematics Equivalent to ID1.
CSL 2000: 356-370 |
| 4 | EE | Reinhard Kahle:
N\hbox{\sf N}-strictness in applicative theories.
Arch. Math. Log. 39(2): 125-144 (2000) |
| 3 | EE | Reinhard Kahle:
Proof-theoretic notions for software maintenance.
Electr. Notes Theor. Comput. Sci. 40: (2000) |
| 1999 |
|---|
| 2 | EE | Reinhard Kahle:
Frege Structures for Partial Applicative Theories.
J. Log. Comput. 9(5): 683-700 (1999) |
| 1 | | Gerhard Jäger,
Reinhard Kahle,
Anton Setzer,
Thomas Strahm:
The Proof-Theoretic Analysis of Transfinitely Iterated Fixed Point Theories.
J. Symb. Log. 64(1): 53-67 (1999) |
