Abstract is missing.
- The Complexity of Set ConstraintsAlexander Aiken, Dexter Kozen, Moshe Y. Vardi, Edward L. Wimmers. 1-17
- On Duality for the Modal µ-CalculusSimon Ambler, Marta Z. Kwiatkowska, Nicholas Measor. 18-32
- Short Proofs of Tautologies Using the Schema of EquivalenceMatthias Baaz, Richard Zach. 33-35
- Process Algebra with CombinatorsJan A. Bergstra, Inge Bethke, Alban Ponse. 36-65
- Is Game Semantics Necessary?Andreas Blass. 66-77
- The Model Theory of ConcurrencyKevin J. Compton, Rosario Uceda-Sosa. 78-90
- From Semantics to Rules: A Machine Assisted AnalysisCatarina Coquand. 91-105
- On the Reasons for Average Superlinear Speedup in Parallel Backtrack SearchAndreas Goerdt, Udo Kamps. 106-127
- Negation as Inconsistency in PROLOG via Intuitionistic LogicAlexey Gomolko. 128-138
- Approximable Minimization Problems and Optimal Solutions on Random InputsErich Grädel, Anders Malmström. 139-149
- Bounded-Arity Hierarchies in Fixed-Point LogicsMartin Grohe. 150-164
- Petri Nets and the Equivalence ProblemYoram Hirshfeld. 165-174
- Logical Aspects of Set ConstraintsDexter Kozen. 175-188
- Oracles and QuantifiersJohann A. Makowsky, Y. B. Pnueli. 189-222
- A Horn Clause that Implies and Undecidable Set of Horn ClausesJerzy Marcinkowski. 223-237
- Higher-Order Action CalculiRobin Milner. 238-260
- A Generic Strong Normalization Argument: Application to the Calculus of ConstructionsC.-H. Luke Ong, Eike Ritter. 261-279
- Data Types, Infinity and Equality in System AF::2::Christophe Raffalli. 280-294
- Normalization for Typed Lambda Calculi with Explicit SubstitutionEike Ritter. 295-304
- Program Transformation and Proof TransformationWilfried Sieg, Stanley S. Wainer. 305-317
- Incorporating Generalized Quantifiers and the Least Fixed Point OperatorIain A. Stewart. 318-333
- ERRATA to The Semantics of the C Programming Language Yuri Gurevich, James K. Huggins. 334-336