Skip to main content
  • Conference proceedings
  • © 1997

Computational Logic and Proof Theory

5th Kurt Gödel Colloquium, KGC'97, Vienna, Austria, August 25-29, 1997, Proceedings

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

Conference series link(s): KGC: Kurt Gödel Colloquium on Computational Logic and Proof Theory

Conference proceedings info: KGC 1997.

Buy it now

Buying options

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

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

Table of contents (27 papers)

  1. Front Matter

  2. Ultrafilter logic and generic reasoning

    • W. A. Carnielli, P. A. S. Veloso
    Pages 34-53
  3. Subtyping over a lattice (abstract)

    • Jerzy Tiuryn
    Pages 84-88
  4. A new method for bounding the complexity of modal logics

    • David Basin, Seán Matthews, Luca Viganò
    Pages 89-102
  5. Parameter free induction and reflection

    • Lev D. Beklemishev
    Pages 103-113
  6. Two connections between Linear Logic and Łukasiewicz Logics

    • Agata Ciabattoni, Duccio Luchi
    Pages 128-139
  7. Structuring of computer-generated proofs by cut introduction

    • Uwe Egly, Karin Genther
    Pages 140-152
  8. NaDSyL and some applications

    • Paul C. Gilmore
    Pages 153-166
  9. Bounded hyperset theory and web-like data bases

    • Alexei Lisitsa, Vladimir Sazonov
    Pages 172-185
  10. Invariant definability

    • J. A. Makowsky
    Pages 186-202
  11. Restart tableaux with selection function

    • Christian Pape, Reiner Hähnle
    Pages 219-232

Other Volumes

  1. Computational Logic and Proof Theory

About this book

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.   

Bibliographic Information

Buy it now

Buying options

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