
Proof Theory in Computer Science
International Seminar, PTCS 2001 Dagstuhl Castle, Germany, October 7-12, 2001. Proceedings
Springer (Publisher)
Published on 28. September 2001
Book
Paperback/Softback
X, 246 pages
978-3-540-42752-0 (ISBN)
Description
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.
More details
Series
Edition
2001 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
X, 246 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 15 mm
Weight
394 gr
ISBN-13
978-3-540-42752-0 (9783540427520)
DOI
10.1007/3-540-45504-3
Schweitzer Classification
Other editions
Additional editions

Reinhard Kahle | Peter Schroeder-Heister | Robert Stärk
Proof Theory in Computer Science
International Seminar, PTCS 2001 Dagstuhl Castle, Germany, October 7-12, 2001. Proceedings
E-Book
06/2003
Springer
€53.49
Available for download
Content
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.