Proof Theory in Computer Science: International Seminar, PTCS 2001 Dagstuhl Castle, Germany, October 7-12, 2001. Proceedings by Reinhard KahleProof Theory in Computer Science: International Seminar, PTCS 2001 Dagstuhl Castle, Germany, October 7-12, 2001. Proceedings by Reinhard Kahle

Proof Theory in Computer Science: International Seminar, PTCS 2001 Dagstuhl Castle, Germany…

byReinhard KahleEditorPeter Schroeder-Heister, Robert St

Paperback | March 27, 2006

Pricing and Purchase Info

$116.62 online 
$136.95 list price save 14%
Earn 583 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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.
Title:Proof Theory in Computer Science: International Seminar, PTCS 2001 Dagstuhl Castle, Germany…Format:PaperbackDimensions:246 pages, 23.5 × 15.5 × 1.73 inPublished:March 27, 2006Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:354042752X

ISBN - 13:9783540427520

Look for similar items by category:

Reviews

Table of Contents

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.