| 1992 | Computer Science Logic, 5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991, Proceedings Egon Börger, Gerhard Jäger, Hans Kleine Büning, Michael M. Richter |
| 1991 | A Cut-Elimination Procedure Designed for Evaluating Proofs as Programs. Ulf R. Schmerl |
| 1991 | A Fragment of First Order Logic Adequate for Observation Equivalence. Halit Oguztüzün |
| 1991 | A New Approach to Abstract Data Types II: Computation on ADTs as Ordinary Computation. Solomon Feferman |
| 1991 | A Primitive Recursive Set Theory and AFA: On the Logical Complexity of the Largest Bisimulation. Tim Fernando |
| 1991 | A Transformational Methodology for Proving Termination of Logic Programs. M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar |
| 1991 | Comparing the Theory of Representations and Constructive Mathematics. A. S. Troelstra |
| 1991 | Control of omega-Automata, Church's Problem, and the Emptiness Problem for Tree omega-Automata. John G. Thistle, Walter Murray Wonham |
| 1991 | Correctness Proof For the WAM with Types. Christoph Beierle, Egon Börger |
| 1991 | Denotational Versus Declarative Semantics for Functional Programming. Juan Carlos González Moreno, Maria Teresa Hortalá-González, Mario Rodríguez-Artalejo |
| 1991 | Equational Specification of Abstract Types and Combinators. Karl Meinke |
| 1991 | How to Implement First Order Formulas in Local Memory Machine Models. Elias Dahlhaus |
| 1991 | Infinitary Queries and Their Asymptotic Probabilities I: Properties Definable in Transitive Closue Logic. Jerzy Tyszkiewicz |
| 1991 | Logical Inference and Polyhedral Projection. John N. Hooker |
| 1991 | Logical Semantics of Modularisation. Gerard R. Renardel de Lavalette |
| 1991 | Minimal from Classical Proofs. Helmut Schwichtenberg |
| 1991 | Model Checking of Persistent Petri Nets. Eike Best, Javier Esparza |
| 1991 | Normal Forms in Infinite-Valued Logic: The Case of One Variable. Daniele Mundici |
| 1991 | On Bounded Theories. Jörg Flum |
| 1991 | On Completeness for NP via Projection Translations. Iain A. Stewart |
| 1991 | On Completeness of Program Synthesis Systems. Andrei Voronkov |
| 1991 | On Transitive Closure Logic. Erich Grädel |
| 1991 | Ordinal Processes in Comparative Concurrency Semantics. Sophie Pinchinat |
| 1991 | Plausibility Logic. Daniel Lehmann |
| 1991 | Provability in TBLL: A Decision Procedure. Jawahar Chirimar, James Lipton |
| 1991 | Proving Termination for Term Rewriting Systems. Andreas Weiermann |
| 1991 | Quantifier Hierarchies over Word Relations. Sebastian Seibert |
| 1991 | Safe Queries in Relational Databases with Functions. Yoram Hirshfeld |
| 1991 | Some Aspects of the Probabilistic Behavior of Variants of Resolution. Peter Heusch, Ewald Speckenmeyer |
| 1991 | Stable Logic. Brigitte Bösli |
| 1991 | The Cutting Plane Proof System with Bounded Degree of Falsity. Andreas Goerdt |
| 1991 | The Expressive Power of Transitive Closue and 2-way Multihead Automata. Yaniv Bargury, Johann A. Makowsky |
| 1991 | Towards Kleene Algebra with Recursion. Hans Leiß |