5. KGC 1997: Vienna, Austria

Georg Gottlob, Alexander Leitsch, Daniele Mundici (Eds.): Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, KGC'97, Vienna, Austria, August 25-29, 1997, Proceedings. Lecture Notes in Computer Science 1289 Springer 1997, ISBN 3-540-63385-5 BibTeX

@proceedings{DBLP:conf/kgc/1997,
  editor    = {Georg Gottlob and
               Alexander Leitsch and
               Daniele Mundici},
  title     = {Computational Logic and Proof Theory, 5th Kurt G{\"o}del Colloquium,
               KGC'97, Vienna, Austria, August 25-29, 1997, Proceedings},
  booktitle = {Kurt G{\"o}del Colloquium},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1289},
  year      = {1997},
  isbn      = {3-540-63385-5},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Papers

Leo Bachmair: Paramodulation, Superposition, and Simplification. 1-3 BibTeX
Wilfried Buchholz: Explaining Gentzen's Consistency Proof within Infinitary Proof Theory. 4-17 BibTeX
Samuel R. Buss: Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization. 18-33 BibTeX
Walter Alexandre Carnielli, Paulo A. S. Veloso: Ultrafilter Logic and Generic Reasoning. 34-53 BibTeX
John Alan Robinson: Informal Rigor and Mathematical Understanding. 54-64 BibTeX
Tanel Tammet: Resolution, Inverse Method and the Sequent Calculus. 65-83 BibTeX
Jerzy Tiuryn: Subtyping over a Lattice (Abstract). 84-88 BibTeX

Contributed Papers

David A. Basin, Seán Matthews, Luca Viganò: A New Method for Bounding the Complexity of Modal Logics. 89-102 BibTeX
Lev D. Beklemishev: Parameter Free Induction and Reflection. 103-113 BibTeX
Bernd Borchert, Frank Stephan: Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory. 114-127 BibTeX
Agata Ciabattoni, Duccio Luchi: Two Connections Between Linear Logic and Lukasiewicz Logics. 128-139 BibTeX
Uwe Egly, Karin Genther: Structuring of Computer-Generated Proofs by Cut Introduction. 140-152 BibTeX
Paul C. Gilmore: NaDSyL and some Applications. 153-166 BibTeX
Khakhanian V. Kh: Markov's Rule Is Admissible in the Set Theory with Intuitionistic Logic. 167-171 BibTeX
Alexei Lisitsa, Vladimir Yu. Sazonov: Bounded Hyperset Theory and Web-like Data Bases. 172-185 BibTeX
Johann A. Makowsky: Invariant Definability (Extended Abstract). 186-202 BibTeX
Robert Matzinger: Comparing Computational Representations of Herbrand Models. 203-218 BibTeX
Christian Pape, Reiner Hähnle: Restart Tableaux with Selection Function. 219-232 BibTeX
V. Plisko: Two Semantics and Logics Based on the Gödel Interpretation. 233-240 BibTeX
Regimantas Pliuskevicius: On the Completeness and Decidability of a Restricted First Order Linear Temporal Logic. 241-254 BibTeX
Tomasz Polacik: Propositional Quantification in Intuitionistic Logic. 255-263 BibTeX
Norbert Preining: Sketch-as-Proof. 264-277 BibTeX
Anton Setzer: Translating Set Theoretical Proofs into Type Theoretical Programs. 278-289 BibTeX
Lorenzo Tortora de Falco: Denotational Semantics for Polarized (But-non-constrainted) LK by Means of the Additives. 290-304 BibTeX
Margus Veanes: The Undecidability of Simultaneous Rigid E-Unification with Two Variables. 305-318 BibTeX
Dan E. Willard: The Tangibility Reflection Principle for Self-Verifying Axiom Systems. 319-334 BibTeX
Hongwei Xi: Upper Bounds for Standardizations and an Application. 335-348 BibTeX