Advertisement

Table of contents

  1. Front Matter
  2. W. A. Carnielli, P. A. S. Veloso
    Pages 34-53
  3. Jerzy Tiuryn
    Pages 84-88
  4. David Basin, Seán Matthews, Luca Viganò
    Pages 89-102
  5. Lev D. Beklemishev
    Pages 103-113
  6. Agata Ciabattoni, Duccio Luchi
    Pages 128-139
  7. Uwe Egly, Karin Genther
    Pages 140-152
  8. Paul C. Gilmore
    Pages 153-166
  9. Alexei Lisitsa, Vladimir Sazonov
    Pages 172-185
  10. J. A. Makowsky
    Pages 186-202
  11. Christian Pape, Reiner Hähnle
    Pages 219-232
  12. Norbert Preining
    Pages 264-277
  13. Back Matter

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory, KGC '97, held in Vienna, Austria, in August 1997.
The volume presents 20 revised full papers selected from 38 submitted papers. Also included are seven invited contributions by leading experts in the area. The book documents interdisciplinary work done in the area of computer science and mathematical logics by combining research on provability, analysis of proofs, proof search, and complexity.

Keywords

Complexity Theory Computational Logic Nonclassical Logics Proof Analysis complexity logic mathematical logic proof theory

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-63385-5
  • Copyright Information Springer-Verlag Berlin Heidelberg 1997
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-63385-3
  • Online ISBN 978-3-540-69806-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site