Skip to main content
Springer Nature Link
Log in

Computational Logic and Proof Theory

Third Kurt Gödel Colloquium, KGC'93, Brno, Czech Republic, August 24-27, 1993. Proceedings

  • Conference proceedings
  • © 1993

Overview

Editors:
  1. Georg Gottlob
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Alexander Leitsch
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Daniele Mundici
    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 713)

  • 6463 Accesses

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

Access this book

Log in via an institution
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

About this book

The Third Kurt G|del Symposium, KGC'93, held in Brno, Czech Republic, August1993, is the third in a series of biennial symposia on logic, theoretical computer science, and philosophy of mathematics. The aim of this meeting wasto bring together researchers working in the fields of computational logic and proof theory. While proof theory traditionally is a discipline of mathematical logic, the central activity in computational logic can be foundin computer science. In both disciplines methods were invented which arecrucial to one another. This volume contains the proceedings of the symposium. It contains contributions by 36 authors from 10 different countries. In addition to 10 invited papers there are 26 contributed papers selected from over 50 submissions.

Keywords

Table of contents (35 papers)

  1. Front Matter

    Download chapter PDF

  2. The mathematics of set predicates in Prolog

    • Egon Börger, Dean Rosenzweig
    Pages 1-13

  3. Some connections between set theory and computer science

    • Robert Cowen
    Pages 14-22

  4. Gödel's Dialectica interpretation and its two-way stretch

    • Solomon Feferman
    Pages 23-40

  5. Epistemic entrenchment and arithmetical hierarchy (abstract)

    • Petr Hájek
    Pages 41-42

  6. A critical reexamination of default logic, autoepistemic logic, and only knowing

    • Joseph Y. Halpern
    Pages 43-60

  7. Complexity issues in nonmonotonic logic and logic programming (abstract)

    • V. Wiktor Marek
    Pages 61-61

  8. Strategies for resolution method in non-classical logics (Abstract)

    • Grigori Mints
    Pages 62-62

  9. Undecidability of implication problems in logic programming, database theory and classical logic

    • Leszek Pacholski
    Pages 63-68

  10. Building up a tool-box for Martin-Löf's type theory (abstract)

    • Giovanni Sambin, Silvio Valentini
    Pages 69-70

  11. The logic of the Gödel proof predicate

    • Sergei Artëmov, Tyko Straßen
    Pages 71-82

  12. Superposition with simplification as a decision procedure for the monadic class with equality

    • Leo Bachmair, Harald Ganzinger, Uwe Waldmann
    Pages 83-96

  13. Computation with access to the reals, but using only classical machines

    • N. P. Bamber
    Pages 97-107

  14. The even more liberalized δ-rule in free variable Semantic Tableaux

    • Bernhard Beckert, Reiner Hähnle, Peter H. Schmitt
    Pages 108-119

  15. Differentiating assumptions from extra-logical axioms in natural deduction

    • Mario R. F. Benevides
    Pages 120-131

  16. The inverse of fitting's functional

    • Alberto Bottoni, Giorgio Levi
    Pages 132-143

  17. On loop detection in connection calculi

    • Stefan Brüning
    Pages 144-151

  18. On Arnol'd's Hilbert symposium problems

    • N. C. A. da Costa, F. A. Doria
    Pages 152-158

  19. The structure of exponentials: Uncovering the dynamics of linear logic proofs

    • Vincent Danos, Jean -Baptiste Joinet, Harold Schellinx
    Pages 159-171

  20. On different concepts of function introduction

    • Uwe Egly
    Pages 172-183
Back to top

Bibliographic Information

Publish with us

Policies and ethics

Back to top