Proof Theory in Computer Science

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

AvReinhard Kahle,Peter Schroeder-Heister

Häftad, Engelska, 2001

Del i serien Lecture Notes in Computer Science

536 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the refereed proceedings of the International Seminar on Proof Theory in Computer Science, PTCS 2001, held in Dagstuhl Castle, Germany, in October 2001. The 13 thoroughly revised full papers were carefully reviewed and selected for inclusion in the book. Among the topics addressed are higher type recursion, lambda calculus, complexity theory, transfinite induction, categories, induction-recursion, post-Turing analysis, natural deduction, implicit characterization, iterate logic, and Java programming.

Produktinformation

Utgivningsdatum:2001-09-28
Mått:155 x 235 x 15 mm
Vikt:394 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:246
Upplaga:2001
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540427520

Utforska kategorier

Matematikens grunder inom Naturvetenskap och teknik
Artificiell intelligens inom Data och IT
Programspråk inom Data och IT

Innehållsförteckning

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.