Kurt Gödel Colloquium

Keyphrases

Publications

1997

Dan E. Willard
The Tangibility Reflection Principle for Self-Verifying Axiom Systems. Kurt Gödel Colloquium (1997)
Regimantas Pliuskevicius
On the Completeness and Decidability of a Restricted First Order Linear Temporal Logic. Kurt Gödel Colloquium (1997)
Norbert Preining
Sketch-as-Proof. Kurt Gödel Colloquium (1997)
Margus Veanes
The Undecidability of Simultaneous Rigid E-Unification with Two Variables. Kurt Gödel Colloquium (1997)
Walter Alexandre Carnielli, Paulo A. S. Veloso
Ultrafilter Logic and Generic Reasoning. Kurt Gödel Colloquium (1997)
Alexei Lisitsa, Vladimir Yu. Sazonov
Bounded Hyperset Theory and Web-like Data Bases. Kurt Gödel Colloquium (1997)
Johann A. Makowsky
Invariant Definability (Extended Abstract). Kurt Gödel Colloquium (1997)
Hongwei Xi
Upper Bounds for Standardizations and an Application. Kurt Gödel Colloquium (1997)
Tanel Tammet
Resolution, Inverse Method and the Sequent Calculus. Kurt Gödel Colloquium (1997)
Samuel R. Buss
Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization. Kurt Gödel Colloquium (1997)
Uwe Egly, Karin Genther
Structuring of Computer-Generated Proofs by Cut Introduction. Kurt Gödel Colloquium (1997)
Anton Setzer
Translating Set Theoretical Proofs into Type Theoretical Programs. Kurt Gödel Colloquium (1997)
Tomasz Polacik
Propositional Quantification in Intuitionistic Logic. Kurt Gödel Colloquium (1997)
Lorenzo Tortora de Falco
Denotational Semantics for Polarized (But-non-constrainted) LK by Means of the Additives. Kurt Gödel Colloquium (1997)
John Alan Robinson
Informal Rigor and Mathematical Understanding. Kurt Gödel Colloquium (1997)
Bernd Borchert, Frank Stephan
Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory. Kurt Gödel Colloquium (1997)
Agata Ciabattoni, Duccio Luchi
Two Connections Between Linear Logic and Lukasiewicz Logics. Kurt Gödel Colloquium (1997)
Khakhanian V. Kh
Markov's Rule Is Admissible in the Set Theory with Intuitionistic Logic. Kurt Gödel Colloquium (1997)
David A. Basin, Seán Matthews, Luca Viganò
A New Method for Bounding the Complexity of Modal Logics. Kurt Gödel Colloquium (1997)
Lev D. Beklemishev
Parameter Free Induction and Reflection. Kurt Gödel Colloquium (1997)
Christian Pape, Reiner Hähnle
Restart Tableaux with Selection Function. Kurt Gödel Colloquium (1997)
Jerzy Tiuryn
Subtyping over a Lattice (Abstract). Kurt Gödel Colloquium (1997)
Leo Bachmair
Paramodulation, Superposition, and Simplification. Kurt Gödel Colloquium (1997)
Robert Matzinger
Comparing Computational Representations of Herbrand Models. Kurt Gödel Colloquium (1997)
Valery Plisko
Two Semantics and Logics Based on the Gödel Interpretation. Kurt Gödel Colloquium (1997)
Wilfried Buchholz
Explaining Gentzen's Consistency Proof within Infinitary Proof Theory. Kurt Gödel Colloquium (1997)
Paul C. Gilmore
NaDSyL and some Applications. Kurt Gödel Colloquium (1997)

volume 1289, 1997

Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, KGC'97, Vienna, Austria, August 25-29, 1997, Proceedings Kurt Gödel Colloquium 1289 (1997)

1993

volume 713, 1993

Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93, Brno, Czech Republic, August 24-27, 1993, Proceedings Kurt Gödel Colloquium 713 (1993)