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
Conference proceedings

DOI: 10.1007/3-540-45504-3

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

Table of contents (13 papers)

  1. Front Matter
    Pages I-IX
  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. Comparing the Complexity of Cut-Elimination Methods
    Matthias Baaz, Alexander Leitsch
    Pages 49-67
  5. Coherent Bicartesian and Sesquicartesian Categories
    Kosta Došen, Zoran Petrić
    Pages 78-92
  6. Indexed Induction-Recursion
    Peter Dybjer, Anton Setzer
    Pages 93-113
  7. Proof Theory and Post-turing Analysis
    Lew Gordeew
    Pages 130-152
  8. Implicit Characterizations of Pspace
    Isabel Oitavem
    Pages 170-190
  9. Iterate logic
    Peter H. Schmitt
    Pages 191-201
  10. Back Matter
    Pages 239-239

About these proceedings


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.


Java Natural Racter Turing complexity complexity theory lambda calculus logic programming proof theory

Editors and affiliations

  • Reinhard Kahle
    • 1
  • Peter Schroeder-Heister
    • 1
  • Robert Stärk
    • 2
  1. 1.Wilhelm-Schickard-Institut für InformatikUniversität TübingenTübingenGermany
  2. 2.Theoretische InformatikETH ZürichSwitzerland

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-42752-0
  • Online ISBN 978-3-540-45504-2
  • Series Print ISSN 0302-9743