Skip to main content
SpringerLink
Log in

Proof Theory in Computer Science

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

  • Conference proceedings
  • © 2001

Overview

Editors:
  1. Reinhard Kahle

    1. Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Tübingen, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Peter Schroeder-Heister

    1. Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Tübingen, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Robert Stärk

    1. Theoretische Informatik, ETH Zürich, Switzerland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2183)

Included in the following conference series:

Conference proceedings info: PTCS 2001.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (13 papers)

  1. Front Matter

    Pages I-IX
    Download chapter PDF

  2. Linear Ramified Higher Type Recursion and Parallel Complexity

    • Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan A. Terwijn
    Pages 1-21

  3. Reflective λ-Calculus

    • Jesse Alt, Sergei Artemov
    Pages 22-37

  4. A Note on the Proof-Theoretic Strength of a Single Application of the Schema of Identity

    • Matthias Baaz, Christian G. Fermüller
    Pages 38-48

  5. Comparing the Complexity of Cut-Elimination Methods

    • Matthias Baaz, Alexander Leitsch
    Pages 49-67

  6. Program Extraction from Gentzen’s Proof of Transfinite Induction up to ε0

    • Ulrich Berger
    Pages 68-77

  7. Coherent Bicartesian and Sesquicartesian Categories

    • Kosta Došen, Zoran Petrić
    Pages 78-92

  8. Indexed Induction-Recursion

    • Peter Dybjer, Anton Setzer
    Pages 93-113

  9. Modeling Meta-logical Features in a Calculus with Frozen Variables

    • Birgit Elbl
    Pages 114-129

  10. Proof Theory and Post-turing Analysis

    • Lew Gordeew
    Pages 130-152

  11. Interpolation for Natural Deduction with Generalized Eliminations

    • Ralph Matthes
    Pages 153-169

  12. Implicit Characterizations of Pspace

    • Isabel Oitavem
    Pages 170-190

  13. Iterate logic

    • Peter H. Schmitt
    Pages 191-201

  14. Constructive Foundations for Featherweight Java

    • Thomas Studer
    Pages 202-238

  15. Back Matter

    Pages 239-239
    Download chapter PDF
Back to top

Other volumes

  1. Proof Theory in Computer Science

Keywords

About this book

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.

Editors and Affiliations

  • Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Tübingen, Germany

    Reinhard Kahle, Peter Schroeder-Heister

  • Theoretische Informatik, ETH Zürich, Switzerland

    Robert Stärk

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation