3. KGC 1993:
Brno,
Czech Republic
Georg Gottlob, Alexander Leitsch, Daniele Mundici (Eds.):
Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93, Brno, Czech Republic, August 24-27, 1993, Proceedings.
Lecture Notes in Computer Science 713 Springer 1993, ISBN 3-540-57184-1 BibTeX
@proceedings{DBLP:conf/kgc/1993,
editor = {Georg Gottlob and
Alexander Leitsch and
Daniele Mundici},
title = {Computational Logic and Proof Theory, Third Kurt G{\"o}del Colloquium,
KGC'93, Brno, Czech Republic, August 24-27, 1993, Proceedings},
booktitle = {Kurt G{\"o}del Colloquium},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {713},
year = {1993},
isbn = {3-540-57184-1},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Papers
Contributed Papers
- Sergei N. Artëmov, Tyko Straßen:
The Logic of the Gödel Proof Predicate.
71-82 BibTeX
- Leo Bachmair, Harald Ganzinger, Uwe Waldmann:
Superposition with Simplification as a Desision Procedure for the Monadic Class with Equality.
83-96 BibTeX
- N. P. Bamber:
Computation with Access to the Reals, but Using only Classical Machines.
97-107 BibTeX
- Bernhard Beckert, Reiner Hähnle, Peter H. Schmitt:
The Even More Liberalized delta-Rule in Free Variable Semantic Tableaux.
108-119 BibTeX
- Mario R. F. Benevides:
Differentiating Assumptions from Extra-Logical Axioms in Natural Deduction.
120-131 BibTeX
- Alberto Bottoni, Giorgio Levi:
The Inverse of Fitting's Functional.
132-143 BibTeX
- Stefan Brüning:
On Loop Detection in Connection Calculi.
144-151 BibTeX
- Newton C. A. da Costa, Francisco A. Doria:
On Arnold's Hilbert Symposium Problems.
152-158 BibTeX
- Vincent Danos, Jean-Baptiste Joinet, Harold Schellinx:
The Structure of Exponentials: Uncovering the Dynamics of Linear Logic Proofs.
159-171 BibTeX
- Uwe Egly:
On Different Concepts of Function Introduction.
172-183 BibTeX
- Giovanni Faglia:
Double Exponential Inseparability Of Robinson Subsystem Q+ From The Unsatisfiable Sentences In The Language Of Addition.
184-186 BibTeX
- Giovanni Faglia, Paul Young:
In The Meaning Of Essentially Unprovable Theorems In The Presburger Theory Of Addition.
187-189 BibTeX
- Paul C. Gilmore:
A Syntactic Consistency Proof for NaDSet.
190-201 BibTeX
- Jean Goubault:
A Rule-based Algorithm for Rigid E-Unification.
202-210 BibTeX
- Tomi Janhunen, Ilkka Niemelä:
A Scheme for Weakened Negative Introspection in Autoepistemic Reasoning.
211-222 BibTeX
- Jan Johannsen:
On the Weakness of Sharply Bounded Polynomial Induction.
223-230 BibTeX
- Adam Kolany:
On the Logic of Hypergraphs.
231-242 BibTeX
- Martin Kummer, Frank Stephan:
Recursion Theoretic Properties of Frequency Computation and Bounded Queries (Extended Abstract).
243-254 BibTeX
- André Nies:
Interpreting True Arithmetic in Degree Structures.
255-262 BibTeX
- Michel Parigot:
Classical Proofs as Programs.
263-276 BibTeX
- Uwe Petermann:
Completeness of the Pool Calculus with an Open Built-in Theory.
277-288 BibTeX
- Regimantas Pliuskevicius:
On the Saturation Principle for a Linear Temporal Logic.
289-300 BibTeX
- Vladimir Yu. Sazonov, Andrei Voronkov:
A Construction of Typed Lambda Models Related to Feasible Computability.
301-312 BibTeX
- Grigori Schwarz, Miroslaw Truszczynski:
Nonmonotonic Reasoning is Sometimes Simpler.
313-324 BibTeX
- Dan E. Willard:
Self-Verifying Axiom Systems.
325-336 BibTeX
- Jirí Zlatuska:
Committed-Choice Concurrent Logic Programming in Linear Logic.
337-348 BibTeX
Copyright © Sat May 16 23:28:08 2009
by Michael Ley (ley@uni-trier.de)
