Stop the war!
Остановите войну!
for scientists:
default search action
PTCS 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 - Jesse Alt, Sergei N. Artëmov:
Reflective lambda-Calculus. 22-37 - Matthias Baaz, Christian G. Fermüller:
A Note on the Proof-Theoretic Strength of a Single Application of the Schema of Identity. 38-48 - Matthias Baaz, Alexander Leitsch:
Comparing the Complexity of Cut-Elimination Methods. 49-67 - Ulrich Berger:
Program Extraction from Gentzen's Proof of Transfinite Induction up to epsilon0. 68-77 - Kosta Dosen, Zoran Petric:
Coherent Bicartesian and Sesquicartesian Categories. 78-92 - Peter Dybjer, Anton Setzer:
Indexed Induction-Recursion. 93-113 - Birgit Elbl:
Modeling Meta-logical Features in a Calculus with Frozen Variables. 114-129 - Lew Gordeev:
Proof Theory and Post-turing Analysis. 130-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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.