| 1995 | Computer Science Logic, 8th International Workshop, CSL '94, Kazimierz, Poland, September 25-30, 1994, Selected Papers Leszek Pacholski, Jerzy Tiuryn |
| 1994 | A Bounded Set Theory with Anti-Foundation Axiom and Inductive Definability. Vladimir Yu. Sazonov |
| 1994 | A Homomorphism Concepts for omega-Regularity. Nils Klarlund |
| 1994 | A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure. Hugo Herbelin |
| 1994 | A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models (Extended Abstract). P. N. Benton |
| 1994 | A Sound Metalogical Semantics for Input/Output Effects. Roy L. Crole, Andrew D. Gordon |
| 1994 | A Subtyping for the Fisher-Honsell-Mitchell Lambda Calculus of Objects. Viviana Bono, Luigi Liquori |
| 1994 | Algorithmic Aspects of Propositional Tense Logics. Alexander V. Chagrov, Valentin B. Shehtman |
| 1994 | An Algebraic View of Structural Induction. Claudio Hermida, Bart Jacobs |
| 1994 | An Intuitionistic Modal Logic with Applications to the Formal Verification of Hardware. Matt Fairtlough, Michael Mendler |
| 1994 | Canonical Forms for Data-Specifications. Frank Piessens, Eric Steegmans |
| 1994 | Completeness of Resolution for Definite Answers with Case Analysis. Tanel Tammet |
| 1994 | Convergence and 0-1 Laws for L_inf, omega^k under Arbitrary Measures. Monica McArthur |
| 1994 | Cut Free Formalization of Logic with Finitely Many Variables. Part I. Lew Gordeev |
| 1994 | Decidability of Higher-Order Subtyping with Intersection Types. Adriana B. Compagnoni |
| 1994 | First-Order Spectra with One Binary Predicate. Arnaud Durand, Solomampionona Ranaivoson |
| 1994 | General Form Recursive Equations I. Hrant B. Marandjian |
| 1994 | How to Lie Without Being (Easily) Convicted and the Length of Proofs in Propositional Calculus. Pavel Pudlák, Samuel R. Buss |
| 1994 | Is First Order Contained in an Initial Segment of PTIME? Alexei P. Stolboushkin, Michael A. Taitslin |
| 1994 | Lambda Representation of Operations Between Fifferent Term Algebras. Marek Zaionc |
| 1994 | Log-Approximable Minimization Problems on Random Inputs. Anders Malmström |
| 1994 | Logic Programming in Tau Categories. Stacy E. Finkelstein, Peter J. Freyd, James Lipton |
| 1994 | Logics For Context-Free Languages. Clemens Lautemann, Thomas Schwentick, Denis Thérien |
| 1994 | Modal Logics Preserving Admissible for S4 Inference Rules. Vladimir V. Rybakov |
| 1994 | Monadic Logical Definability of NP-Complete Problems. Etienne Grandjean, Frédéric Olive |
| 1994 | Monadic Second-Order Logic and Linear Orderings of Finite Structures. Bruno Courcelle |
| 1994 | On Existential Theories of List Concatenation. Klaus U. Schulz |
| 1994 | On the Interpretation of Type Theory in Locally Cartesian Closed Categories. Martin Hofmann |
| 1994 | Powerdomains, Powerstructures and Fairness. Yiannis N. Moschovakis, Glen T. Whitney |
| 1994 | Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space. Daniel Leivant, Jean-Yves Marion |
| 1994 | Reasoning and Rewriting with Set-Relations I: Ground Completeness. Valentinas Kriauciukas, Michal Walicki |
| 1994 | Resolution Games and Non-Liftable Resolution Orderings. Hans de Nivelle |
| 1994 | Semi-Unification and Generalizations of a Particularly Simple Form. Matthias Baaz, Gernot Salzer |
| 1994 | Stratified Default Theories. Pawel Cholewinski |
| 1994 | Subrecursion as a Basis for a Feasible Programming Language. Paul J. Voda |
| 1994 | Subtyping with Singleton Types. David Aspinall |
| 1994 | The Girard Translation Extended with Recursion. Torben Braüner |
| 1994 | Towards Machine-Checked Compiler Correctness for Higher-order Pure Functional Languages. David R. Lester, Sava Mintchev |
| 1994 | Usability: Formalising (Un)definedness in Typed Lambda Calculus. Jan Kuper |