default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5. KGC 1997: Vienna, Austria
- Georg Gottlob, Alexander Leitsch, Daniele Mundici:
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
Invited Papers
- Leo Bachmair:
Paramodulation, Superposition, and Simplification. 1-3 - Wilfried Buchholz:
Explaining Gentzen's Consistency Proof within Infinitary Proof Theory. 4-17 - Samuel R. Buss:
Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization. 18-33 - Walter Alexandre Carnielli, Paulo A. S. Veloso:
Ultrafilter Logic and Generic Reasoning. 34-53 - John Alan Robinson:
Informal Rigor and Mathematical Understanding. 54-64 - Tanel Tammet:
Resolution, Inverse Method and the Sequent Calculus. 65-83 - Jerzy Tiuryn:
Subtyping over a Lattice (Abstract). 84-88
Contributed Papers
- David A. Basin, Seán Matthews, Luca Viganò:
A New Method for Bounding the Complexity of Modal Logics. 89-102 - Lev D. Beklemishev:
Parameter Free Induction and Reflection. 103-113 - Bernd Borchert, Frank Stephan:
Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory. 114-127 - Agata Ciabattoni
, Duccio Luchi:
Two Connections Between Linear Logic and Lukasiewicz Logics. 128-139 - Uwe Egly, Karin Genther:
Structuring of Computer-Generated Proofs by Cut Introduction. 140-152 - Paul C. Gilmore:
NaDSyL and some Applications. 153-166 - Khakhanian V. Kh:
Markov's Rule Is Admissible in the Set Theory with Intuitionistic Logic. 167-171 - Alexei Lisitsa, Vladimir Yu. Sazonov:
Bounded Hyperset Theory and Web-like Data Bases. 172-185 - Johann A. Makowsky:
Invariant Definability (Extended Abstract). 186-202 - Robert Matzinger:
Comparing Computational Representations of Herbrand Models. 203-218 - Christian Pape, Reiner Hähnle:
Restart Tableaux with Selection Function. 219-232 - Valery Plisko:
Two Semantics and Logics Based on the Gödel Interpretation. 233-240 - Regimantas Pliuskevicius:
On the Completeness and Decidability of a Restricted First Order Linear Temporal Logic. 241-254 - Tomasz Polacik:
Propositional Quantification in Intuitionistic Logic. 255-263 - Norbert Preining:
Sketch-as-Proof. 264-277 - Anton Setzer:
Translating Set Theoretical Proofs into Type Theoretical Programs. 278-289 - Lorenzo Tortora de Falco:
Denotational Semantics for Polarized (But-non-constrainted) LK by Means of the Additives. 290-304 - Margus Veanes:
The Undecidability of Simultaneous Rigid E-Unification with Two Variables. 305-318 - Dan E. Willard:
The Tangibility Reflection Principle for Self-Verifying Axiom Systems. 319-334 - Hongwei Xi:
Upper Bounds for Standardizations and an Application. 335-348
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-06 01:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
