| 1996 | Computer Science Logic, 9th International Workshop, CSL '95, Annual Conference of the EACSL, Paderborn, Germany, September 22-29, 1995, Selected Papers Hans Kleine Büning |
| 1995 | A Fully Abstract Denotational Model for Observational Precongruence. Anna Ingólfsdóttir, Andrea Schalk |
| 1995 | A Logical Aspect of Parametric Polymorphism. Ryu Hasegawa |
| 1995 | A Note on the Relation Between Polynomial Time Functionals and Constable's Class K. Peter Clote |
| 1995 | A Proof System for Finite Trees. Patrick Blackburn, Wilfried Meyer-Viol, Maarten de Rijke |
| 1995 | An Evolving Algebra Abstract Machine. Giuseppe Del Castillo, Igor Durdanovic, Uwe Glässer |
| 1995 | Bounded Fixed-Point Definability and Tabular Recognition of Languages. Hans Leiß |
| 1995 | Congruence Types. Gilles Barthe, Herman Geuvers |
| 1995 | Decision Procedures Using Model Building Techniques. Ricardo Caferra, Nicolas Peltier |
| 1995 | Deduction by Combining Semantic Tableaux and Integer Programming. Bernhard Beckert, Reiner Hähnle |
| 1995 | Effective Strategies for Enumeration Games. Martin Kummer, Matthias Ott |
| 1995 | Equivalences among Various Logical Frameworks of Partial Algebras. Till Mossakowski |
| 1995 | First Order Logic, Fixed Point Logic and Linear Order. Anuj Dawar, Steven Lindell, Scott Weinstein |
| 1995 | Generalized Implicit Definitions on Finite Structures. Stéphane Grumbach, Zoé Lacroix, Steven Lindell |
| 1995 | Improved Decision Procedures for the Modal Logics K, T, and S4. Jörg Hudelmaier |
| 1995 | Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs. Matthias Baaz, Alexander Leitsch, Richard Zach |
| 1995 | Languages and Logical Definability in Concurrency Monoids. Manfred Droste, Dietrich Kuske |
| 1995 | On Sharply Bounded Length Induction. Jan Johannsen |
| 1995 | On the Modal Logic K Plus Theories. Alain Heuerding, Stefan Schwendimann |
| 1995 | Positive Deduction modulo Regular Theories. Laurent Vigneron |
| 1995 | Representing Unification in a Logical Framework. Jason Brown, Lincoln A. Wallen |
| 1995 | Rewriting with Extensional Polymorphic Lambda-Calculus. Roberto Di Cosmo, Delia Kesner |
| 1995 | Semantics of Non-terminating Rewrite Systems Using Minimal Coverings. José Barros, Joseph A. Goguen |
| 1995 | Simultaneous Regid E-Unification Is Undecidable. Anatoli Degtyarev, Andrei Voronkov |
| 1995 | Some Extensions to Propositional Mean-Value Caculus: Expressiveness and Decidability. Paritosh K. Pandya |
| 1995 | The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions. Yuri Gurevich, James K. Huggins |
| 1995 | Theorem Proving modulo Associativity. Albert Rubio |
| 1995 | leanEA: A Lean Evolving Algebra Compiler. Bernhard Beckert, Joachim Posegga |