Accepted Papers

CSL2012 Accepted Papers

- Erich Grädel and Simon Lessenich. Banach-Mazur Games with Simple Winning Strategies
- Wied Pakusa, Bjarki Holm, Anuj Dawar, Eryk Kopczynski and Erich Grädel. Definability of linear equation systems over groups and rings
- Dietrich Kuske. Isomorphisms of scattered automatic linear orders
- Manfred Kufleitner and Pascal Weil. The FO2 alternation hierarchy is decidable
- Antti Kuusisto, Jeremy Meyers and Jonni Virtema. Undecidable First-Order Theories of Affine Geometries
- Pawel Parys. Variants of Collapsible Pushdown Systems
- Nathalie Bertrand, John Fearnley and Sven Schewe. Bounded Satisfiablity for PCTL
- Takanori Hida. A Computational Interpretation of the Axiom of Determinacy in Arithmetic
- Etienne Grandjean and Frédéric Olive. Descriptive complexity for pictures languages
- Manuel Bodirsky and Michal Wrona. Equivalence Constraints
- Lukasz Kaiser and Simon Leßenich. A Counting Logic for Structure Transition Systems
- Johann Brault-Baron. A Negative Conjunctive Query is Easy if and only if it is Beta-Acyclic
- Jean-Pierre Jouannaud and Jian-Qi Li. Church-Rosser Properties of Normal Rewriting
- Krishnendu Chatterjee, Siddhesh Chaubal and Pritish Kamath. Faster Algorithms for Alternating Refinement Relations
- Federico Aschieri. Interactive Realizability for Classical Peano Arithmetic with Skolem Axioms
- Thomas Ehrhard. Collapsing non-idempotent intersection types
- Johann Makowsky and Tomer Kotek. Connection Matrices and the Definability of Graph Parameters
- Satoru Kuroda. Axiomatizing proof tree concepts in bounded arithmetic
- Martin Grohe and Martin Otto. Pebble games and linear equations
- Henry Deyoung, Luís Caires, Frank Pfenning and Bernardo Toninho. Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication
- Alberto Carraro and Antonino Salibra. On the equational consistency of order-theoretic models of lambda calculus
- Boris Düdder, Moritz Martens, Jakob Rehof and Paweł Urzyczyn. Bounded Combinatory Logic
- Zhilin Wu. Commutative Data Automata
- Emanuel Kieronski and Jakub Michaliszyn. Two-Variable Universal Logic with Transitive Closure
- Alexander Leitsch, Giselle Reis and Bruno Woltzenlogel Paleo. Towards CERes in intuitionistic logic
- Kaustuv Chaudhuri, Dale Miller and Stefan Hetzl. A Systematic Approach to Canonicity in the Classical Sequent Calculus
- Stefan Hetzl and Lutz Strassburger. Herbrand-Confluence for Cut Elimination in Classical First Order Logic
- Stefano Berardi and Ugo De Liguoro. Knowledge Spaces and the Completeness of Learning Strategies
- Thorsten Altenkirch and Ondrej Rypacek. A syntactical approach to weak omega-groupoids
- Lars Birkedal, Filip Sieczkowski and Jacob Thamsborg. A Concurrent Logical Relation
- Robert Atkey. Relational Parametricity for Higher Kinds
- Alexander Rabinovich. A  Proof of Kamp's  theorem
- Chantal Keller and Marc Lasson. Parametricity in an Impredicative Sort
- Jacek Chrząszcz and Aleksy Schubert. ML with PTIME complexity guarantees
- Patrick Baillot and Ugo Dal Lago. Higher-order Interpretations and Program Complexity