| 2012 | A Computational Interpretation of the Axiom of Determinacy in Arithmetic. Takanori Hida |
| 2012 | A Concurrent Logical Relation. Lars Birkedal, Filip Sieczkowski, Jacob Thamsborg |
| 2012 | A Counting Logic for Structure Transition Systems. Lukasz Kaiser, Simon Leßenich |
| 2012 | A Negative Conjunctive Query is Easy if and only if it is Beta-Acyclic. Johann Brault-Baron |
| 2012 | A Proof of Kamp's theorem. Alexander Rabinovich |
| 2012 | A Syntactical Approach to Weak omega-Groupoids. Thorsten Altenkirch, Ondrej Rypacek |
| 2012 | A Systematic Approach to Canonicity in the Classical Sequent Calculus. Kaustuv Chaudhuri, Stefan Hetzl, Dale Miller |
| 2012 | Axiomatizing proof tree concepts in Bounded Arithmetic. Satoru Kuroda |
| 2012 | Banach-Mazur Games with Simple Winning Strategies. Erich Grädel, Simon Leßenich |
| 2012 | Bounded Combinatory Logic. Boris Düdder, Moritz Martens, Jakob Rehof, Pawel Urzyczyn |
| 2012 | Bounded Satisfiability for PCTL. Nathalie Bertrand, John Fearnley, Sven Schewe |
| 2012 | Church-Rosser Properties of Normal Rewriting. Jean-Pierre Jouannaud, Jianqi Li |
| 2012 | Collapsing non-idempotent intersection types. Thomas Ehrhard |
| 2012 | Commutative Data Automata. Zhilin Wu |
| 2012 | Computer Science Logic - 26th International Workshop / 21st Annual Conference of the EACSL, CSL 2012, Fontainebleau, France, September 3-6, 2012 Patrick Cégielski, Arnaud Durand |
| 2012 | Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk). Stephen A. Cook |
| 2012 | Connection Matrices and the Definability of Graph Parameters. Tomer Kotek, Johann A. Makowsky |
| 2012 | Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication. Henry DeYoung, Luís Caires, Frank Pfenning, Bernardo Toninho |
| 2012 | Definability and Complexity of Graph Parameters (Invited Talk). Johann A. Makowsky |
| 2012 | Definability of linear equation systems over groups and rings. Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa |
| 2012 | Descriptive complexity for pictures languages. Etienne Grandjean, Frédéric Olive |
| 2012 | Equivalence Constraint Satisfaction Problems. Manuel Bodirsky, Michal Wrona |
| 2012 | Faster Algorithms for Alternating Refinement Relations. Krishnendu Chatterjee, Siddhesh Chaubal, Pritish Kamath |
| 2012 | Frontmatter, Table of Contents, Preface, Conference Organization. |
| 2012 | Herbrand-Confluence for Cut Elimination in Classical First Order Logic. Stefan Hetzl, Lutz Straßburger |
| 2012 | Higher-Order Interpretations and Program Complexity. Patrick Baillot, Ugo Dal Lago |
| 2012 | Interactive Realizability for Classical Peano Arithmetic with Skolem Axioms. Federico Aschieri |
| 2012 | Isomorphisms of scattered automatic linear orders. Dietrich Kuske |
| 2012 | Knowledge Spaces and the Completeness of Learning Strategies. Stefano Berardi, Ugo de'Liguoro |
| 2012 | ML with PTIME complexity guarantees. Jacek Chrzaszcz, Aleksy Schubert |
| 2012 | On the equational consistency of order-theoretic models of the lambda-calculus. Alberto Carraro, Antonino Salibra |
| 2012 | Parametricity in an Impredicative Sort. Chantal Keller, Marc Lasson |
| 2012 | Pebble Games and Linear Equations. Martin Grohe, Martin Otto |
| 2012 | Relational Parametricity for Higher Kinds. Robert Atkey |
| 2012 | Satisfiability: where Theory meets Practice (Invited Talk). Inês Lynce |
| 2012 | Sharing Distributed Knowledge on the Web (Invited Talk). Serge Abiteboul |
| 2012 | The Ackermann Award 2012. Thierry Coquand, Anuj Dawar, Damian Niwinski |
| 2012 | The FO2 alternation hierarchy is decidable. Manfred Kufleitner, Pascal Weil |
| 2012 | Towards CERes in intuitionistic logic. Alexander Leitsch, Giselle Reis, Bruno Woltzenlogel Paleo |
| 2012 | Two-Variable Universal Logic with Transitive Closure. Emanuel Kieronski, Jakub Michaliszyn |
| 2012 | Undecidable First-Order Theories of Affine Geometries. Antti Kuusisto, Jeremy Meyers, Jonni Virtema |
| 2012 | Variants of Collapsible Pushdown Systems. Pawel Parys |