Abstract is missing.
- Four-Valued Diagnoses for Stratified Knowledge-BasesOfer Arieli, Arnon Avron. 1-17
- Fast Cut-Elimination by ProjectionMatthias Baaz, Alexander Leitsch. 18-33
- On the Subject Reduction Property for Algebraic Type SystemsGilles Barthe, Paul-André Melliès. 34-57
- Presheaf Models for ConcurrencyGian Luca Cattani, Glynn Winskel. 58-75
- Directed Virtual ReductionsVincent Danos, Marco Pedicini, Laurent Regnier. 76-88
- Bounded-Variable Fixpoint Queries are PSPACE-completeStefan Dziembowski. 89-105
- Graph Rewriting Semantics for Functional Programming LanguagesMarko C. J. D. van Eekelen, Sjaak Smetsers, Marinus J. Plasmeijer. 106-128
- An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain TheoryMarcelo P. Fiore, Gordon D. Plotkin. 129-149
- Relative Undecidability in Term RewritingAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema. 150-166
- Extending Models of Second Order Predicate Logic to Models of Second Dependent Type TheoryHerman Geuvers. 167-181
- Eta-Expansions in F:::omega:::Neil Ghani. 182-197
- Cut-free Display Calculi for Relation AlgebrasRajeev Goré. 198-210
- Computational Aspects of Arity HierarchiesHenrik Imhof. 211-225
- Weak Semantics Based on Lighted Button Pressing ExperimentsAnna Ingólfsdóttir. 226-243
- Kleene Algebra with Tests: Completeness and DecidabilityDexter Kozen, Frederick Smith. 244-259
- Monadic NP and Built-in TreesMartin Kreidler, Detlef Seese. 260-275
- Coercive Subtyping in Type TheoryZhaohui Luo. 276-296
- Proofs in System F::omega:: Can Be Done in System F::omega:::::1:::Sophie Malecki. 297-315
- Optimization Problems with Approximation SchemesAnders Malmström. 316-333
- Computational Representations of Herbrand Models Using GrammarsRobert Matzinger. 334-348
- Exact Pairs for Abstract Bounded ReducibilitiesWolfgang Merkle. 349-368
- The Logic of Explicitly Presentation-Invariant CircuitsMartin Otto. 369-384
- Social Confluence in Client-Server SystemsAnna Philippou, David Walker. 385-398
- A Type-Free Resource-Aware Lambda-CalculusLuca Roversi. 399-413
- Inductive Definitions with Decidable Atomic FormulasAnton Setzer. 414-430
- Call-by-Value, Call-by-Name and the Logic of ValuesRobert F. Stärk. 431-445
- On Cartesian MonoidsRichard Statman. 446-459
- New Intuitionistic Logical Constants: Undecidability of the Conservativsness ProblemA. D. Yashin. 460-471