| Invited Lectures |
| XML Navigation and Tarski's Relation Algebras / Maarten Marx |
| Verification in Predicate Logic with Time: Algorithmic Questions / Anatol Slissenko |
| Note on Formal Analogical Reasoning in the Juridical Context / Matthias Baaz |
| An Abstract Strong Normalization Theorem / Ulrich Berger |
| Semantics and Logics |
| On Bunched Polymorphism / Matthew Collinson ; David Pym ; Edmund Robinson |
| Distributed Control Flow with Classical Modal Logic / Tom Murphy VII ; Karl Crary ; Robert Harper |
| A Logic of Coequations / Jiri Adámek |
| A Semantic Formulation of -Lifting and Logical Predicates for Computational Metalanguage / Shin-ya Katsumata |
| Type Theory and Lambda Calculus |
| Order Structures on Böhm-Like Models / Paula Severi ; Fer-Jan de Vries |
| Higher-Order Matching and Games / Colin Stirling |
| Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations / Frédéric Blanqui |
| On the Role of Type Decorations in the Calculus of Inductive Constructions / Bruno Barras ; Benjamin Grégoire |
| Linear Logic and Ludics |
| L-Nets, Strategies and Proof-Nets / Pierre-Louis Curien ; Claudia Faggian |
| Permutative Logic / Jean-Marc Andreoli ; Gabriele Pulcini ; Paul Ruet |
| Focusing the Inverse Method for Linear Logic / Kaustuv Chaudhuri ; Frank Pfenning |
| Towards a Typed Geometry of Interaction / Esfandiar Haghverdi ; Philip J. Scott |
| Constraints |
| From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction / Hubie Chen ; Víctor Dalmau |
| An Algebraic Approach for the Unsatisfiability of Nonlinear Constraints / Ashish Tiwari |
| Finite Models, Decidability and Complexity |
| Coprimality in Finite Models / Marcin Mostowski ; Konrad Zdanowski |
| Towards a Characterization of Order-Invariant Queries over Tame Structures / Michael Benedikt ; Luc Segoufin |
| Decidability of Term Algebras Extending Partial Algebras / Bakhadyr Khoussainov ; Sasha Rubin |
| Results on the Guarded Fragment with Equivalence or Transitive Relations / Emanuel Kieroński |
| The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic / Bruno Courcelle ; Christian Delhommé |
| On the Complexity of Hybrid Logics with Binders / Balder ten Cate ; Massimo Franceschet |
| The Complexity of Independence-Friendly Fixpoint Logic / Julian Bradfield ; Stephan Kreutzer |
| Closure Properties of Weak Systems of Bounded Arithmetic / Antonina Kolokolova |
| Verification and Model Checking |
| Transfinite Extension of the Mu-Calculus / Jacques Duparc ; Sandra Quickert |
| Bounded Model Checking of Pointer Programs / Witold Charatonik ; Lilia Georgieva ; Patrick Maier |
| PDL with Intersection and Converse Is Decidable / Carsten Lutz |
| On Deciding Topological Classes of Deterministic Tree Languages / Filip Murlak |
| Constructive Reasoning and Computational Mathematics |
| Complexity and Intensionality in a Type-1 Framework for Computable Analysis / Branimir Lambov |
| Computing with Sequences, Weak Topologies and the Axiom of Choice / Vasco Brattka ; Matthias Schröder |
| Light Functional Interpretation / Mircea-Dan Hernest |
| Feasible Proofs of Matrix Properties with Csanky's Algorithm / Michael Soltys |
| Implicit Computational Complexity and Rewriting |
| A Propositional Proof System for Log Space / Steven Perron |
| Identifying Polynomial-Time Recursive Functions / Carsten Schürmann ; Jatin Shah |
| Confluence of Shallow Right-Linear Rewrite Systems / Guillem Godoy |
| Appendices |
| The Ackermann Award 2005 / Erich Grädel ; Janos Makowsky ; Alexander Razborov |
| Clemens Lautemann: 1951-2005 An Obituary |
| Author Index |
| Invited Lectures |
| XML Navigation and Tarski's Relation Algebras / Maarten Marx |
| Verification in Predicate Logic with Time: Algorithmic Questions / Anatol Slissenko |
| Note on Formal Analogical Reasoning in the Juridical Context / Matthias Baaz |
| An Abstract Strong Normalization Theorem / Ulrich Berger |
| Semantics and Logics |
