Proof Theory in Computer Science

International Seminar, PTCS 2001 Dagstuhl Castle, Germany, October 7-12, 2001. Proceedings

Reinhard Kahle, Peter Schroeder-Heister, Robert Stärk (Herausgeber)

Buch | Softcover

X, 246 Seiten

2001 | 2001
Springer Berlin (Verlag)
978-3-540-42752-0 (ISBN)

Artikel merken

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.

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.

Erscheint lt. Verlag	28.9.2001
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	X, 246 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	363 g
Themenwelt	Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge
Themenwelt	Informatik ► Theorie / Studium ► Compilerbau
Schlagworte	AI logics • Algorithm analysis and problem complexity • automated deduction • Complexity • Complexity theory • Computer Science Logic • Deduction • formal methods • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Java • Lambda Calculus • Logic • Logic Programming • Mathematical Logic • NATURAL • programming • Programming Theory • Proof theory • Racter • theorem proving • Turing • Type Systems
ISBN-10	3-540-42752-X / 354042752X
ISBN-13	978-3-540-42752-0 / 9783540427520
Zustand	Neuware