5. CSL 1991: Berne, Switzerland

Egon Börger, Gerhard Jäger, Hans Kleine Büning, Michael M. Richter (Eds.): Computer Science Logic, 5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991, Proceedings. Lecture Notes in Computer Science 626 Springer 1992, ISBN 3-540-55789-X BibTeX

@proceedings{DBLP:conf/csl/1991,
  editor    = {Egon B{\"o}rger and
               Gerhard J{\"a}ger and
               Hans Kleine B{\"u}ning and
               Michael M. Richter},
  title     = {Computer Science Logic, 5th Workshop, CSL '91, Berne, Switzerland,
               October 7-11, 1991, Proceedings},
  booktitle = {CSL},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {626},
  year      = {1992},
  isbn      = {3-540-55789-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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