Front matter
1-14
Deciding Monotonic Games
Parosh Aziz Abdulla, Ahmed Bouajjani and Julien d’Orso
15-28
The Commuting V-Diagram
On the Relation of Refinement and Testing
Bernhard K. Aichernig
29-42
Concurrent Construction of Proof-Nets
Jean-Marc Andreoli and Laurent Mazaré
43
Back to the Future: Explicit Logic for Computer Science
Sergei Artemov
44-57
Constraint Satisfaction with Countable Homogeneous Templates
Manuel Bodirsky and Jaroslav Nešetřil
58-70
Quantified Constraints: Algorithms and Complexity
Ferdinand Börner, Andrei Bulatov, Peter Jeavons and Andrei Krokhin
71
Verification of Infinite State Systems
Ahmed Bouajjani
72-85
Parity of Imperfection or Fixing Independence
Julian C. Bradfield
86-97
Atomic Cut Elimination for Classical Logic
Kai Brünnler
98-99
Computational Mathematics, Computational Logic, and Symbolic Computation
Bruno Buchberger
100-113
Simple Stochastic Parity Games
Krishnendu Chatterjee, Marcin Jurdziński and Thomas A. Henzinger
114-127
Machine Characterizations of the Classes of the W-Hierarchy
Yijia Chen and Jörg Flum
128-141
Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions
Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani and Laurent Vigneron
142-154
On Relativisation and Complexity Gap for Resolution-Based Proof Systems
Stefan Dantchev and Søren Riis
155-168
Strong Normalization of the Typed λws-Calculus
René David and Bruno Guillaume
169-182
A Fixed-Point Logic with Symmetric Choice
Anuj Dawar and David Richerby
183-196
Positive Games and Persistent Strategies
Jacques Duparc
197-211
Generating All Abductive Explanations for Queries on Propositional Horn Theories
Thomas Eiter and Kazuhisa Makino
212-225
Refined Complexity Analysis of Cut Elimination
Philipp Gerhardy
226-240
Comparing the Succinctness of Monadic Query Languages over Finite Trees
Martin Grohe and Nicole Schweikardt
241-254
The Arithmetical Complexity of Dimension and Randomness
John M. Hitchcock, Jack H. Lutz and Sebastiaan A. Terwijn
255-270
Towards a Proof System for Admissibility
Rosalie Iemhoff
271-284
Program Complexity of Dynamic LTL Model Checking
Detlef Kähler and Thomas Wilke
285-298
Coping Polynomially with Numerous but Identical Elements within Planning Problems
Max Kanovich and Jacqueline Vauzeilles
299-313
On Algebraic Specifications of Abstract Data Types
Bakhadyr Khoussainov
314-329
On the Complexity of Existential Pebble Games
Phokion G. Kolaitis and Jonathan Panttaja
330-344
Computational Aspects of Σ-Definability over the Real Numbers without the Equality Test
Margarita Korovina
345-358
The Surprising Power of Restricted Programs and Gödel’s Functionals
Lars Kristiansen and Paul J. Voda
359-371
Pebble Games on Trees
Łukasz Krzeszczakowski
372-383
Bistability: An Extensional Characterization of Sequentiality
James Laird
384-396
Automata on Lempel-Ziv Compressed Strings
Hans Leiß and Michel de Rougemont
397-412
Complexity of Some Problems in Modal and Intuitionistic Calculi
Larisa Maksimova and Andrei Voronkov
413-426
Goal-Directed Calculi for Gödel-Dummett Logics
George Metcalfe, Nicola Olivetti and Dov Gabbay
427-440
A Logic for Probability in Quantum Systems
Ron van der Meyden and Manas Patra
441-454
A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory
Alexandre Miquel
455
The Epsilon Calculus
Georg Moser and Richard Zach
456-469
Modular Semantics and Logics of Classes
Bernhard Reus
470-483
Validity of CTL Queries Revisited
Marko Samer and Helmut Veith
484-497
Calculi of Meta-variables
Masahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyama and Atsushi Igarashi
498-512
Henkin Models of the Partial λ-Calculus
Lutz Schröder
513-527
Nominal Unification
Christian Urban, Andrew Pitts and Murdoch Gabbay
528-529
Friends or Foes? Communities in Software Verification
Helmut Veith
530-543
More Computation Power for a Denotational Semantics for First Order Logic
Kess F. M. Vermeulen
544
Effective Model Completeness of the Theory of Restricted Pfaffian Functions
(Abstract)
Nicolai Vorobjov
545
Effective Quantifier Elimination over Real Closed Fields
(Abstract)
Nicolai Vorobjov
546-573
Fast Infinite-State Model Checking in Integer-Based Systems
Tatiana Rybina and Andrei Voronkov
574
Winning Strategies and Synthesis of Controllers
Igor Walukiewicz
575-588
Logical Relations for Dynamic Name Creation
Yu Zhang and David Nowak
Back matter