Amazon cover image
Image from Amazon.com

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 (eds.).

By: Contributor(s): Material type: TextTextSeries: Lecture notes in computer science ; 2183.Publication details: Berlin ; New York : Springer, ©2001.Description: 1 online resource (viii, 238 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540455042
  • 3540455043
Subject(s): Genre/Form: Additional physical formats: Print version:PTCS 2001 (2001 : Dahgstuhl Castle): Proof theory in computer science : international seminar, PTCS 2001, Dagstuhl Castle, Germany, October 7-12, 2001 : proceedingsDDC classification:
  • 004/.01/5113 21
LOC classification:
  • QA76.9.A96 P753 2001
Other classification:
  • SS 4800
  • DAT 706f
  • MAT 036f
Online resources:
Contents:
Linear ramified higher type recursion and parallel complexity / Klaus Aehlig . [and others] -- Reflective [lambda]-calculus / Jesse Alt and Sergei Artemov -- A note on the proof-theoretic strength of a single application of the schema of identity / Matthias Baaz and Christian G. Fermuller -- Comparing the complexity of cut-elimination methods / Matthias Baaz and Alexander Leitsch -- Program extraction from Gentzen's proof of transfinite induction up to [epsilon]₀ / Ulrich Berger -- Coherent bicartesian and sesquicartesian categories / Kosta Dosen and Zoran Petric -- Indexed induction-recursion / Peter Dybjer and Anton Setzer -- Modeling meta-logical features in a calculus with frozen variables / Birgit Elbl -- Proof theory and post-turing analysis / Lew Gordeew -- Interpolation for natural deduction with generalized eliminations / Ralph Matthes -- Implicit characterizations of Pspace / Isabel Oitavem -- Iterate logic / Peter H. Schmitt -- Constructive foundations for featherweight Java / Thomas Studer.
Summary: 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.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

Includes bibliographical references and index.

Linear ramified higher type recursion and parallel complexity / Klaus Aehlig . [and others] -- Reflective [lambda]-calculus / Jesse Alt and Sergei Artemov -- A note on the proof-theoretic strength of a single application of the schema of identity / Matthias Baaz and Christian G. Fermuller -- Comparing the complexity of cut-elimination methods / Matthias Baaz and Alexander Leitsch -- Program extraction from Gentzen's proof of transfinite induction up to [epsilon]₀ / Ulrich Berger -- Coherent bicartesian and sesquicartesian categories / Kosta Dosen and Zoran Petric -- Indexed induction-recursion / Peter Dybjer and Anton Setzer -- Modeling meta-logical features in a calculus with frozen variables / Birgit Elbl -- Proof theory and post-turing analysis / Lew Gordeew -- Interpolation for natural deduction with generalized eliminations / Ralph Matthes -- Implicit characterizations of Pspace / Isabel Oitavem -- Iterate logic / Peter H. Schmitt -- Constructive foundations for featherweight Java / Thomas Studer.

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.

English.

Powered by Koha