Skip to main content
SpringerLink
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)

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

Table of contents (35 papers)

  1. Double exponential inseparability of Robinson subsystem Q+ from the unsatisfiable sentences in the language of addition

    • Giovanni Faglia
    Pages 184-186

  2. On the meaning of essentially unprovable theorems in the presburger theory of addition

    • Giovanni Faglia, Paul Young
    Pages 187-189

  3. A syntactic consistency proof for NaDSet

    • Paul C. Gilmore
    Pages 190-201

  4. A rule-based algorithm for rigid E-unification

    • Jean Goubault
    Pages 202-210

  5. A scheme for weakened negative introspection in autoepistemic reasoning

    • Tomi Janhunen, Ilkka Niemelä
    Pages 211-222

  6. On the weakness of sharply bounded polynomial induction

    • Jan Johannsen
    Pages 223-230

  7. On the logic of hypergraphs

    • A. Kolany
    Pages 231-242

  8. Recursion theoretic properties of frequency computation and bounded queries (extended abstract)

    • Martin Kummer, Frank Stephan
    Pages 243-254

  9. Interpreting true arithmetic in degree structures

    • André Nies
    Pages 255-262

  10. Classical proofs as programs

    • Michel Parigot
    Pages 263-276

  11. Completeness of the pool calculus with an open built-in theory

    • Uwe Petermann
    Pages 277-288

  12. On the saturation principle for a linear temporal logic

    • Regimantas Pliuskevicius
    Pages 289-300

  13. A construction of typed lambda models related to feasible computability

    • Vladimir Sazonov, Andrei Voronkov
    Pages 301-312

  14. Nonmonotonic reasoning is sometimes simpler

    • Grigori Schwarz, Miroslaw Truszczyński
    Pages 313-324

  15. Self-verifying axiom systems

    • E. Dan Willard
    Pages 325-336

  16. Committed-choice concurrent logic programming in linear logic

    • Jiři Zlatuška
    Pages 337-348

  17. Back Matter

    Download chapter PDF
Back to top

Keywords

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation