Google
Google Scholar
MS Academic Search
CiteSeerX
Semantic ScholarPTCS 2001: Dagstuhl, Germany
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. Lecture Notes in Computer Science 2183, Springer 2001, 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
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2016-09-23 21:12 CEST by the dblp team