TY  - BOOK
AU  - Kahle,Reinhard
AU  - Schroeder-Heister,Peter
AU  - Stärk,Robert
ED  - SpringerLink (Online service)
TI  - Proof Theory in Computer Science: International Seminar, PTCS 2001 Dagstuhl Castle, Germany, October 7–12, 2001 Proceedings 
T2  - Lecture Notes in Computer Science,
SN  - 9783540455042
AV  - QA8.9-QA10.3 
U1  - 005.131 23
PY  - 2001///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Computer software
KW  - Logic design
KW  - Artificial intelligence
KW  - Logic, Symbolic and mathematical
KW  - Computer Science
KW  - Mathematical Logic and Formal Languages
KW  - Artificial Intelligence (incl. Robotics)
KW  - Logics and Meanings of Programs
KW  - Mathematical Logic and Foundations
KW  - Algorithm Analysis and Problem Complexity
N1  - Linear Ramified Higher Type Recursion and Parallel Complexity -- Reflective ?-Calculus -- A Note on the Proof-Theoretic Strength of a Single Application of the Schema of Identity -- Comparing the Complexity of Cut-Elimination Methods -- Program Extraction from Gentzen’s Proof of Transfinite Induction up to ?0 -- Coherent Bicartesian and Sesquicartesian Categories -- Indexed Induction-Recursion -- Modeling Meta-logical Features in a Calculus with Frozen Variables -- Proof Theory and Post-turing Analysis -- Interpolation for Natural Deduction with Generalized Eliminations -- Implicit Characterizations of Pspace -- Iterate logic -- Constructive Foundations for Featherweight Java
N2  - Proof theory has long been established as a basic discipline of mathematical logic. It has recently become increasingly relevant to computer science. The - ductive apparatus provided by proof theory has proved useful for metatheoretical purposes as well as for practical applications. Thus it seemed to us most natural to bring researchers together to assess both the role proof theory already plays in computer science and the role it might play in the future. The form of a Dagstuhl seminar is most suitable for purposes like this, as Schloß Dagstuhl provides a very convenient and stimulating environment to - scuss new ideas and developments. To accompany the conference with a proc- dings volume appeared to us equally appropriate. Such a volume not only ?xes basic results of the subject and makes them available to a broader audience, but also signals to the scienti?c community that Proof Theory in Computer Science (PTCS) is a major research branch within the wider ?eld of logic in computer science
UR  - http://dx.doi.org/10.1007/3-540-45504-3
ER  -