5. CSL 1991: Berne, Switzerland

• Yaniv Bargury, Johann A. Makowsky:
  The Expressive Power of Transitive Closue and 2-way Multihead Automata. 1-14
  
• Christoph Beierle, Egon Börger:
  Correctness Proof For the WAM with Types. 15-34
  
• Eike Best, Javier Esparza:
  Model Checking of Persistent Petri Nets. 35-52
  
• Jawahar Chirimar, James Lipton:
  Provability in TBLL: A Decision Procedure. 53-67
  
• Elias Dahlhaus:
  How to Implement First Order Formulas in Local Memory Machine Models. 68-78
  
• Solomon Feferman:
  A New Approach to Abstract Data Types II: Computation on ADTs as Ordinary Computation. 79-95
  
• Tim Fernando:
  A Primitive Recursive Set Theory and AFA: On the Logical Complexity of the Largest Bisimulation. 96-110
  
• Jörg Flum:
  On Bounded Theories. 111-118
  
• Andreas Goerdt:
  The Cutting Plane Proof System with Bounded Degree of Falsity. 119-133
  
• Juan Carlos González Moreno, Maria Teresa Hortalá-González, Mario Rodríguez-Artalejo:
  Denotational Versus Declarative Semantics for Functional Programming. 134-148
  
• Erich Grädel:
  On Transitive Closure Logic. 149-163
  
• Peter Heusch, Ewald Speckenmeyer:
  Some Aspects of the Probabilistic Behavior of Variants of Resolution. 164-172
  
• Yoram Hirshfeld:
  Safe Queries in Relational Databases with Functions. 173-183
  
• John N. Hooker:
  Logical Inference and Polyhedral Projection. 184-200
  
• Brigitte Bösli:
  Stable Logic. 201-212
  
• M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar:
  A Transformational Methodology for Proving Termination of Logic Programs. 213-226
  
• Daniel J. Lehmann:
  Plausibility Logic. 227-241
  
• Hans Leiß:
  Towards Kleene Algebra with Recursion. 242-256
  
• Karl Meinke:
  Equational Specification of Abstract Types and Combinators. 257-271
  
• Daniele Mundici:
  Normal Forms in Infinite-Valued Logic: The Case of One Variable. 272-277
  
• Halit Oguztüzün:
  A Fragment of First Order Logic Adequate for Observation Equivalence. 278-292
  
• Sophie Pinchinat:
  Ordinal Processes in Comparative Concurrency Semantics. 293-305
  
• Gerard R. Renardel de Lavalette:
  Logical Semantics of Modularisation. 306-315
  
• Ulf R. Schmerl:
  A Cut-Elimination Procedure Designed for Evaluating Proofs as Programs. 316-325
  
• Helmut Schwichtenberg:
  Minimal from Classical Proofs. 326-328
  
• Sebastian Seibert:
  Quantifier Hierarchies over Word Relations. 329-352
  
• Iain A. Stewart:
  On Completeness for NP via Projection Translations. 353-366
  
• John G. Thistle, W. Murray Wonham:
  Control of omega-Automata, Church's Problem, and the Emptiness Problem for Tree omega-Automata. 367-382
  
• A. S. Troelstra:
  Comparing the Theory of Representations and Constructive Mathematics. 383-395
  
• Jerzy Tyszkiewicz:
  Infinitary Queries and Their Asymptotic Probabilities I: Properties Definable in Transitive Closue Logic. 396-410
  
• Andrei Voronkov:
  On Completeness of Program Synthesis Systems. 411-418
  
• Andreas Weiermann:
  Proving Termination for Term Rewriting Systems. 419-428
  

Last update Sat May 18 02:36:25 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page