PTCS 2001: Dagstuhl, Germany
Reinhard Kahle, Peter Schroeder-Heister, Robert F. Stärk (Eds.): Proof Theory in Computer Science, International Seminar, PTCS 2001, Dagstuhl Castle, Germany, October 7-12, 2001, Proceedings. Springer 2001 Lecture Notes in Computer Science ISBN 3-540-42752-X- Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn: Linear Ramified Higher Type Recursion and Parallel Complexity. 1-21
- Matthias Baaz, Christian G. Fermüller: A Note on the Proof-Theoretic Strength of a Single Application of the Schema of Identity. 38-48
- Ulrich Berger: Program Extraction from Gentzen's Proof of Transfinite Induction up to epsilon0. 68-77
- Birgit Elbl: Modeling Meta-logical Features in a Calculus with Frozen Variables. 114-129
- Lew Gordeew: Proof Theory and Post-turing Analysis. 1301-152
- Ralph Matthes: Interpolation for Natural Deduction with Generalized Eliminations. 153-169
- Isabel Oitavem: Implicit Characterizations of Pspace. 170-190
- Peter H. Schmitt: Iterate Logic. 191-201
- Thomas Studer: Constructive Foundations for Featherweight Java. 202-238
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team