Abstract is missing.
- Logic, Complexity, and GamesRonald Fagin. 3 [doi]
- A General Notion of RealizabilityLars Birkedal. 7-17 [doi]
- A Model for Impredicative Type Systems, Universes, Intersection Types and SubtypingAlexandre Miquel. 18-29 [doi]
- Complete Axioms for Categorical Fixed-Point OperatorsAlex K. Simpson, Gordon D. Plotkin. 30-41 [doi]
- The Role of Decidability in First Order Separations over Classes of Finite StructuresSteven Lindell, Scott Weinstein. 45-50 [doi]
- Automatic StructuresAchim Blumensath, Erich Grädel. 51-62 [doi]
- Definability and CompressionFoto N. Afrati, Hans Leiß, Michel de Rougemont. 63-73 [doi]
- Resource-Bounded Continuity and Sequentiality for Type-Two FunctionalsSamuel R. Buss, Bruce M. Kapron. 77-83 [doi]
- A Syntactical Analysis of Non-Size-Increasing Polynomial Time ComputationKlaus Aehlig, Helmut Schwichtenberg. 84-91 [doi]
- Approximating Labeled Markov ProcessesJosee Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden. 95-106 [doi]
- Precongruence Formats for Decorated Trace PreordersBard Bloom, Wan Fokkink, Rob J. van Glabbeek. 107-118 [doi]
- Virtual Symmetry ReductionE. Allen Emerson, John Havlicek, Richard J. Trefler. 121-131 [doi]
- Approximate Pattern Matching is Expressible in Transitive Closure LogicKjell Lemström, Lauri Hella. 157-167 [doi]
- Computational Complexity of Some Problems Involving Congruences on AlgebrasClifford Bergman, Giora Slutzki. 168-174 [doi]
- Satisfiability Testing: Recent Developments and Challenge ProblemsBart Selman. 178 [doi]
- Dominator Trees and Fast Verification of Proof NetsAndrzej S. Murawski, C.-H. Luke Ong. 181-191 [doi]
- Probabilistic Game SemanticsVincent Danos, Russell Harmer. 204-213 [doi]
- Back and Forth between Guarded and Modal LogicsErich Grädel, Colin Hirsch, Martin Otto. 217-228 [doi]
- More Past GloriesMark Reynolds. 229-240 [doi]
- A Complete Axiomatization of Interval Temporal Logic with Infinite TimeBen C. Moszkowski. 241-252 [doi]
- A Modality for RecursionHiroshi Nakano. 255-266 [doi]
- A Static Calculus of Dependencies for the lambda-CubeFrédéric Prost. 267-276 [doi]
- A Decision Procedure for Term Algebras with QueuesTatiana Rybina, Andrei Voronkov. 279-290 [doi]
- A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix OrderingKonstantin Korovin, Andrei Voronkov. 291-302 [doi]
- Some Strategies for Proving Theorems with a Model CheckerKenneth L. McMillan. 305-306 [doi]
- The Curry-Howard Correspondence in Set TheoryJean-Louis Krivine. 307-308 [doi]
- A Theory of Bisimulation for a Fragment of Concurrent ML with Local NamesAlan Jeffrey, Julian Rathke. 311-321 [doi]
- Models for Name-Passing Processes: Interleaving and CausalGian Luca Cattani, Peter Sewell. 322-332 [doi]
- Assigning Types to ProcessesNobuko Yoshida, Matthew Hennessy. 334-345 [doi]
- On First-Order Topological QueriesMartin Grohe, Luc Segoufin. 349-360 [doi]
- View-Based Query Processing and Constraint SatisfactionDiego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi. 361-371 [doi]
- Imperative Programming with Dependent TypesHongwei Xi. 375-387 [doi]
- Efficient and Flexible Matching of Recursive TypesJens Palsberg, Tian Zhao. 388-398 [doi]
- How to Optimize Proof-Search in Modal Logics: A New Way of Proving Redundancy Criteria for Sequent CalculiAndrei Voronkov. 401-412 [doi]