| 2006 | On the Expressive Power of Graph Logic. | Jerzy Marcinkowski |
| 2006 | Universal Structures and the Logic of Forbidden Patterns. | Florent R. Madelaine |
| 2006 | Universality Results for Models in Locally Boolean Domains. | Tobias Lw, Thomas Streicher |
| 2006 | A Sequent Calculus for Type Theory. | Stphane Lengrand, Roy Dyckhoff, James McKinna |
| 2006 | An Algebraic Point of View on the Crane Beach Property. | Clemens Lautemann, Pascal Tesson, Denis Thrien |
| 2006 | Game Quantification on Automatic Structures and Hierarchical Model Checking Games. | Lukasz Kaiser |
| 2006 | Solving Games Without Determinization. | Thomas A. Henzinger, Nir Piterman |
| 2006 | Complete Problems for Higher Order Logics. | Lauri Hella, Jose Maria Turull Torres |
| 2006 | Weak Bisimulation Approximants. | Will Harwood, Faron Moller, Anton Setzer |
| 2006 | Infinite State Model-Checking of Propositional Dynamic Logics. | Stefan Gller, Markus Lohrey |
| 2006 | Jump from Parallel to Sequential Proofs: Multiplicatives. | Paolo Di Giamberardino, Claudia Faggian |
| 2006 | First-Order Queries over One Unary Function. | Arnaud Durand, Frdric Olive |
| 2006 | Relating Two Standard Notions of Secrecy. | Vronique Cortier, Michal Rusinowitch, Eugen Zalinescu |
| 2006 | Algorithms for Omega-Regular Games with Imperfect Information | Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-Franois Raskin |
| 2006 | Nash Equilibrium for Upward-Closed Objectives. | Krishnendu Chatterjee |
| 2006 | Concurrent Games with Tail Objectives. | Krishnendu Chatterjee |
| 2006 | Reasoning About States of Probabilistic Sequential Programs. | Rohit Chadha, Paulo Mateus, Amlcar Sernadas |
| 2006 | On Rational Trees. | Arnaud Carayol, Christophe Morvan |
| 2006 | Towards an Implicit Characterization of | Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem |
| 2006 | Collapsibility in Infinite-Domain Quantified Constraint Satisfaction. | Manuel Bodirsky, Hubie Chen |
| 2006 | Abstracting Allocation. | Nick Benton |
| 2006 | MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay. | Guillaume Bagan |
| 2006 | Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic. | Vincent Atassi, Patrick Baillot, Kazushige Terui |
| 2006 | Logical Omniscience Via Proof Complexity. | Sergei N. Artmov, Roman Kuznets |
| 2006 | The Power of Linear Functions. | Sandra Alves, Maribel Fernndez, Mrio Florido, Ian Mackie |