The SCEAS System
Navigation Menu

Conferences in DBLP

Kurt Gödel Colloquium (KGC) (kgc)
1997 (conf/kgc/1997)

  1. Leo Bachmair
    Paramodulation, Superposition, and Simplification. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:1-3 [Conf]
  2. Wilfried Buchholz
    Explaining Gentzen's Consistency Proof within Infinitary Proof Theory. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:4-17 [Conf]
  3. Samuel R. Buss
    Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:18-33 [Conf]
  4. Walter Alexandre Carnielli, Paulo A. S. Veloso
    Ultrafilter Logic and Generic Reasoning. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:34-53 [Conf]
  5. John Alan Robinson
    Informal Rigor and Mathematical Understanding. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:54-64 [Conf]
  6. Tanel Tammet
    Resolution, Inverse Method and the Sequent Calculus. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:65-83 [Conf]
  7. Jerzy Tiuryn
    Subtyping over a Lattice (Abstract). [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:84-88 [Conf]
  8. David A. Basin, Seán Matthews, Luca Viganò
    A New Method for Bounding the Complexity of Modal Logics. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:89-102 [Conf]
  9. Lev D. Beklemishev
    Parameter Free Induction and Reflection. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:103-113 [Conf]
  10. Bernd Borchert, Frank Stephan
    Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:114-127 [Conf]
  11. Agata Ciabattoni, Duccio Luchi
    Two Connections Between Linear Logic and Lukasiewicz Logics. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:128-139 [Conf]
  12. Uwe Egly, Karin Genther
    Structuring of Computer-Generated Proofs by Cut Introduction. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:140-152 [Conf]
  13. Paul C. Gilmore
    NaDSyL and some Applications. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:153-166 [Conf]
  14. Khakhanian V. Kh
    Markov's Rule Is Admissible in the Set Theory with Intuitionistic Logic. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:167-171 [Conf]
  15. Alexei Lisitsa, Vladimir Yu. Sazonov
    Bounded Hyperset Theory and Web-like Data Bases. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:172-185 [Conf]
  16. Johann A. Makowsky
    Invariant Definability (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:186-202 [Conf]
  17. Robert Matzinger
    Comparing Computational Representations of Herbrand Models. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:203-218 [Conf]
  18. Christian Pape, Reiner Hähnle
    Restart Tableaux with Selection Function. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:219-232 [Conf]
  19. V. Plisko
    Two Semantics and Logics Based on the Gödel Interpretation. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:233-240 [Conf]
  20. Regimantas Pliuskevicius
    On the Completeness and Decidability of a Restricted First Order Linear Temporal Logic. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:241-254 [Conf]
  21. Tomasz Polacik
    Propositional Quantification in Intuitionistic Logic. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:255-263 [Conf]
  22. Norbert Preining
    Sketch-as-Proof. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:264-277 [Conf]
  23. Anton Setzer
    Translating Set Theoretical Proofs into Type Theoretical Programs. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:278-289 [Conf]
  24. Lorenzo Tortora de Falco
    Denotational Semantics for Polarized (But-non-constrainted) LK by Means of the Additives. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:290-304 [Conf]
  25. Margus Veanes
    The Undecidability of Simultaneous Rigid E-Unification with Two Variables. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:305-318 [Conf]
  26. Dan E. Willard
    The Tangibility Reflection Principle for Self-Verifying Axiom Systems. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:319-334 [Conf]
  27. Hongwei Xi
    Upper Bounds for Standardizations and an Application. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:335-348 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002