1. CSL 1987: Karlsruhe, Germany

• Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig:
  Diagonalizing over Deterministic Polynomial Time. 1-16
  
• Karl-Hans Bläsius, Ulrich Hedtstück:
  Resolution with Feature Unification. 17-26
  
• Corrado Böhm, Adolfo Piperno:
  Surjectivity for Finite Sets of Combinators by Weak Reduction. 27-43
  
• François Bry, Rainer Manthey:
  Proving Finite Satisfiability of Deductive Databases. 44-55
  
• Elias Dahlhaus:
  Is SETL a Suitable Language for Parallel Programming - A Theoretical Approach. 56-63
  
• Giorgio Germano, Stefano Mazzanti:
  Loose Diagrams, Semigroupoids, Categories, Groupoids and Iteration. 64-80
  
• Yuri Gurevich, James M. Morris:
  Algebraic Operational Semantics and Modula-2. 81-101
  
• Maritta Heisel, Wolfgang Reif, Werner Stephan:
  Program Verification Using Dynamic Logic. 102-117
  
• Gerhard Jäger:
  Induction in the Elementary Theory of Types and Names. 118-128
  
• Marek Karpinski, Hans Kleine Büning, Peter H. Schmitt:
  On the Computational Complexity of Quantified Horn Clauses. 129-137
  
• Katja Lenz, Ingo Wegener:
  The Conjunctive Complexity of Quadratic Boolean Functions. 138-150
  
• Hans Leiß:
  On Type Inference for Object-Oriented Programming Languages. 151-172
  
• Ulrich Löwen:
  Optimization Aspects of Logical Formulas. 173-187
  
• Helena Rasiowa:
  Logic of Approximation Reasoning. 188-210
  
• Ralf Rehrmann, Lutz Priese:
  Deciding the Path- and Word-Fair Equivalence Problem. 211-222
  
• Reinhard Rinn, Britta Schinzel:
  Learning by Teams from Examples with Errors. 223-234
  
• Peter H. Schmitt:
  A Survey of Rewrite Systems. 235-262
  
• Wolfgang Schönfeld:
  Interfacing a Logic Machine. 263-272
  
• Uwe Schöning:
  Complexity Cores and Hard-To-Prove Formulas. 273-280
  
• Ewald Speckenmeyer:
  On the Average Case Complexity of Backtracking for the Exact-Satisfiability Problem. 281-288
  
• Dieter Spreen:
  On Functions Computable in Nondeterministic Polynomial Time: Some Characterizations. 289-303
  
• Olga Stepánková, Petr Stepánek:
  Developing Logic Programs: Computing Through Normalizing. 304-321
  
• Hugo Volger:
  Model Theory of Deductive Databases. 322-334
  
• Andreas Weber:
  Algorithms for Propositional Updates. 335-346