3. KGC 1993: Brno, Czech Republic

Invited Papers

• Egon Börger, Dean Rosenzweig:
  The Mathematics of Set Predicates in Prolog. 1-13
  
• Robert Cowen:
  Some Connections Between Set Theory and Computer Science. 14-22
  
• Solomon Feferman:
  Gödel's Dialectica Interpretation and Its Two-Way Stretch. 23-40
  
• Petr Hájek:
  Epistemic Entrenchment and Arthmetical Hierarchy (Abstract). 41-42
  
• Joseph Y. Halpern:
  A Critical Reexamination of Default Logic, Autoepistemic Logic, and Only Knowing. 43-60
  
• V. Wiktor Marek:
  Complexity Issues in Nonmonotonic Logic and Logic Programming (Abstract). 61
  
• Grigori Mints:
  Strategies for Resolution Method in Non-classical Logics (Abstract). 62
  
• Leszek Pacholski:
  Undecidability of Implication Problems in Logic Programming, Database Theory and Classical Logic. 63-68
  
• Giovanni Sambin, Silvio Valentini:
  Building up a Tool-Box for Matrin-Löf's Type Theory (Abstract). 69-70
  

Contributed Papers

• Sergei N. Artëmov, Tyko Straßen:
  The Logic of the Gödel Proof Predicate. 71-82
  
• Leo Bachmair, Harald Ganzinger, Uwe Waldmann:
  Superposition with Simplification as a Desision Procedure for the Monadic Class with Equality. 83-96
  
• N. P. Bamber:
  Computation with Access to the Reals, but Using only Classical Machines. 97-107
  
• Bernhard Beckert, Reiner Hähnle, Peter H. Schmitt:
  The Even More Liberalized delta-Rule in Free Variable Semantic Tableaux. 108-119
  
• Mario R. F. Benevides:
  Differentiating Assumptions from Extra-Logical Axioms in Natural Deduction. 120-131
  
• Alberto Bottoni, Giorgio Levi:
  The Inverse of Fitting's Functional. 132-143
  
• Stefan Brüning:
  On Loop Detection in Connection Calculi. 144-151
  
• Newton C. A. da Costa, Francisco A. Doria:
  On Arnold's Hilbert Symposium Problems. 152-158
  
• Vincent Danos, Jean-Baptiste Joinet, Harold Schellinx:
  The Structure of Exponentials: Uncovering the Dynamics of Linear Logic Proofs. 159-171
  
• Uwe Egly:
  On Different Concepts of Function Introduction. 172-183
  
• Giovanni Faglia:
  Double Exponential Inseparability Of Robinson Subsystem Q+ From The Unsatisfiable Sentences In The Language Of Addition. 184-186
  
• Giovanni Faglia, Paul Young:
  In The Meaning Of Essentially Unprovable Theorems In The Presburger Theory Of Addition. 187-189
  
• Paul C. Gilmore:
  A Syntactic Consistency Proof for NaDSet. 190-201
  
• Jean Goubault:
  A Rule-based Algorithm for Rigid E-Unification. 202-210
  
• Tomi Janhunen, Ilkka Niemelä:
  A Scheme for Weakened Negative Introspection in Autoepistemic Reasoning. 211-222
  
• Jan Johannsen:
  On the Weakness of Sharply Bounded Polynomial Induction. 223-230
  
• Adam Kolany:
  On the Logic of Hypergraphs. 231-242
  
• Martin Kummer, Frank Stephan:
  Recursion Theoretic Properties of Frequency Computation and Bounded Queries (Extended Abstract). 243-254
  
• André Nies:
  Interpreting True Arithmetic in Degree Structures. 255-262
  
• Michel Parigot:
  Classical Proofs as Programs. 263-276
  
• Uwe Petermann:
  Completeness of the Pool Calculus with an Open Built-in Theory. 277-288
  
• Regimantas Pliuskevicius:
  On the Saturation Principle for a Linear Temporal Logic. 289-300
  
• Vladimir Yu. Sazonov, Andrei Voronkov:
  A Construction of Typed Lambda Models Related to Feasible Computability. 301-312
  
• Grigori Schwarz, Miroslaw Truszczynski:
  Nonmonotonic Reasoning is Sometimes Simpler. 313-324
  
• Dan E. Willard:
  Self-Verifying Axiom Systems. 325-336
  
• Jirí Zlatuska:
  Committed-Choice Concurrent Logic Programming in Linear Logic. 337-348
  

Last update Thu May 23 17:37:38 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page