3. CSL 1989: Kaiserslautern, Germany

Egon Börger, Hans Kleine Büning, Michael M. Richter (Eds.): CSL '89, 3rd Workshop on Computer Science Logic, Kaiserslautern, Germany, October 2-6, 1989, Proceedings. Lecture Notes in Computer Science 440 Springer 1990, ISBN 3-540-52753-2 BibTeX

@proceedings{DBLP:conf/csl/1989,
  editor    = {Egon B{\"o}rger and
               Hans Kleine B{\"u}ning and
               Michael M. Richter},
  title     = {CSL '89, 3rd Workshop on Computer Science Logic, Kaiserslautern,
               Germany, October 2-6, 1989, Proceedings},
  booktitle = {CSL},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {440},
  year      = {1990},
  isbn      = {3-540-52753-2},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Klaus Ambos-Spies, Dongping Yang: Honest Polynomial-Time Degrees of Elementary Recursive Sets. 1-15 BibTeX
Grigoris Antoniou, Volker Sperschneider: On the Verification of Modules. 16-35 BibTeX
Egon Börger: A Logical Operational Semantics of Full Prolog. Part I: Selection Core and Control. 36-64 BibTeX
Domenico Cantone, Vincenzo Cutello, Alberto Policriti: Set-Theoretic Reductions of Hilbert's Tenth Problem. 65-75 BibTeX
Elias Dahlhaus: The Complexity of Subtheories of the Existential Linear Theory of Reals. 76-89 BibTeX
Bernd I. Dahn: On Test Classes for Universal Theories. 90-97 BibTeX
Hendrik Decker, Lawrence Cavedon: Generalizing Allowedness While Retaining Completeness of SLDNF-Resolution. 98-115 BibTeX
Manfred Droste, Rüdiger Göbel: Effectively Given Information Systems and Domains. 116-142 BibTeX
Andreas Goerdt: Davis-Putnam Resolution versus Unrestricted Resolution. 143-162 BibTeX
Erich Grädel: On Logical Descriptions of Some Concepts in Structural Complexity Theory. 163-175 BibTeX
Yuri Gurevich, Lawrence S. Moss: Algebraic Operational Semantics and Occam. 176-192 BibTeX
Jan Krajícek, Pavel Pudlák: Propositional Provability and Models of Weak Arithmetic. 193-210 BibTeX
Hans Leiß: Polymorphic Recursion and Semi-Unification. 211-224 BibTeX
Alexander Leitsch: Deciding Horn Classes by Hyperresolution. 225-241 BibTeX
Christoph Meinel: Omega-Branching Programs of Bounded Width. 242-253 BibTeX
Daniel Mey: A Predicate Calculus with Control of Derivations. 254-266 BibTeX
Daniele Mundici: Reducibility of Monotone Formulas to µ-Formulas. 267-270 BibTeX
Hans Jürgen Ohlbach: New Ways for Developing Proof Theories for First-Order Multi Modal Logics. 271-308 BibTeX
Michel Parigot: On the Representation of Data in Lambda-Calculus. 309-321 BibTeX
Ana Pasztor, Ildikó Sain: A Streamlined Temporal Completeness Theorem. 322-336 BibTeX
Wojciech Penczek: A Concurrent Branching Time Temporal Logic. 337-354 BibTeX
Lutz Priese, Doris Nolte: Semantic for Abstract Fairness using Metric Spaces. 355-368 BibTeX
Ewald Speckenmeyer, Rainer Kemp: On the Average Time Complexity of Set Partitioning. 369-381 BibTeX
Robert F. Stärk: A Direct Proof for the Completeness of SLD-Resolution. 382-383 BibTeX
Robert F. Stärk: A Quantifier-Free Completion of Logic Programs. 384-395 BibTeX
Olga Stepánková, Petr Stepánek: Stratification of Definite Clause Programs and of General Logic Programs. 396-408 BibTeX
Hugo Volger: The Semantics of Disjunctive Deductive Databases. 409-421 BibTeX
Elisabeth Wette: Sequential Representation of Primitive Recursive Functions, and Complexity Classes. 422-437 BibTeX