Abstract is missing.
- Deciding Monotonic GamesParosh Aziz Abdulla, Ahmed Bouajjani, Julien d Orso. 1-14 [doi]
- The Commuting V-DiagramBernhard K. Aichernig. 15-28 [doi]
- Concurrent Construction of Proof-NetsJean-Marc Andreoli, Laurent Mazaré. 29-42 [doi]
- Back to the Future: Explicit Logic for Computer Science (Invited Lecture)Sergei N. Artëmov. 43 [doi]
- Constraint Satisfaction with Countable Homogeneous TemplatesManuel Bodirsky, Jaroslav Nesetril. 44-57 [doi]
- Quantified Constraints: Algorithms and ComplexityFerdinand Börner, Andrei A. Bulatov, Peter Jeavons, Andrei A. Krokhin. 58-70 [doi]
- Verification of Infinite State Systems (Tutorial)Ahmed Bouajjani. 71 [doi]
- Parity of Imperfection of Fixing IndependenceJulian C. Bradfield. 72-85 [doi]
- Atomic Cut Elimination for classical LogicKai Brünnler. 86-97 [doi]
- Computational Mathematics, Computational Logic, and Symbolic Computation (Invited Lecture)Bruno Buchberger. 98-99 [doi]
- Simple Stochastic Parity GamesKrishnendu Chatterjee, Marcin Jurdzinski, Thomas A. Henzinger. 100-113 [doi]
- Machine Characterization of the Classes of the W-HierarchyYijia Chen, Jörg Flum. 114-127 [doi]
- Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of SessionsYannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani, Laurent Vigneron. 128-141 [doi]
- On Relativisation and Complexity GapStefan S. Dantchev, Søren Riis. 142-154 [doi]
- Strong Normalization of the Typed gamma::ws::-CalculusRené David, Bruno Guillaume. 155-168 [doi]
- A Fixed-Point Logic with Symmetric ChoiceAnuj Dawar, David Richerby. 169-182 [doi]
- Positive Games and Persistent StrategiesJacques Duparc. 183-196 [doi]
- Generating All Abductive Explanations for Queries on Propositional Horn TheoriesThomas Eiter, Kazuhisa Makino. 197-211 [doi]
- Refined Complexity Analysis of Cut EliminationPhilipp Gerhardy. 212-225 [doi]
- Comparing the Succinctness of Monadic Query Languages over Finite TreesMartin Grohe, Nicole Schweikardt. 226-240 [doi]
- The Arithmetical Complexity of Dimension and RandomnessJohn M. Hitchcock, Jack H. Lutz, Sebastiaan Terwijn. 241-254 [doi]
- Towards a Proof System for AdmissibilityRosalie Iemhoff. 255-270 [doi]
- Program Complexity of Dynamic LTL Model CheckingDetlef Kähler, Thomas Wilke. 271-284 [doi]
- Coping Polynomially with Numerous but Identical Elements within Planning ProblemsMax I. Kanovich, Jacqueline Vauzeilles. 285-298 [doi]
- On Algebraic Specifications of Abstract Data TypesBakhadyr Khoussainov. 299-313 [doi]
- On the Complexity of Existential Pebble GamesPhokion G. Kolaitis, Jonathan Panttaja. 314-329 [doi]
- Computational Aspects of sigma-Definability over the Real Numbers without the Equality TestMargarita V. Korovina. 330-344 [doi]
- The Surprising Power of Restricted Programs and Gödel s FunctionalsLars Kristiansen, Paul J. Voda. 345-358 [doi]
- Pebble Games on TreesLukasz Krzeszczakowski. 359-371 [doi]
- Bistability: An Extensional Characterization of SequentialityJames Laird. 372-383 [doi]
- Automata on Lempel-ziv Compressed StringsHans Leiß, Michel de Rougemont. 384-396 [doi]
- Complexity of Some Problems in Modal and Intuitionistic CalculiLarisa Maksimova, Andrei Voronkov. 397-412 [doi]
- Goal-Directed Calculli for Gödel-Dummett LogicsGeorge Metcalfe, Nicola Olivetti, Dov M. Gabbay. 413-426 [doi]
- A Logic for Probability in Quantum SystemsRon van der Meyden, Manas Patra. 427-440 [doi]
- A Strongly Normalising Curry-Howard Correspondence for IZF Set TheoryAlexandre Miquel. 441-454 [doi]
- The Epsilon Calculus (Tutorial)Georg Moser, Richard Zach. 455 [doi]
- Modular Semantics and Logics of ClassesBernhard Reus. 456-469 [doi]
- Validity of CTL Queries RevisitedMarko Samer, Helmut Veith. 470-483 [doi]
- Calculi of Meta-variablesMasahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyama, Atsushi Igarashi. 484-497 [doi]
- Henkin Models of the Partial sigma-CalculusLutz Schröder. 498-512 [doi]
- Nominal UnificaitonChristian Urban, Andrew M. Pitts, Murdoch Gabbay. 513-527 [doi]
- Friends or Foes? Communities in Software Verification (Invited Lecture)Helmut Veith. 528-529 [doi]
- More Computation Power for a Denotational Semantics for First Order LogicKess F. M. Vermeulen. 530-543 [doi]
- Effective Model Completeness of the Theory of Restricted Pfaffian Functions (Invited Lecture)Nicolai Vorobjov. 544 [doi]
- Effective Quantifier Elimination over Real Closed Fields (Tutorial)Nicolai Vorobjov. 545 [doi]
- Fast Infinite-State Model Checking in Integer-Based Systems (Invited Lecture)Tatiana Rybina, Andrei Voronkov. 546-573 [doi]
- Winning Strategies and Synthesis of Controllers (Tutorial)Igor Walukiewicz. 574 [doi]
- Logical Relations for Dynamic Name CreationYu Zhang, David Nowak. 575-588 [doi]