Accepted Papers
CSL2012 Accepted Papers
Banach-Mazur Games with Simple Winning Strategies
Definability of linear equation systems over groups and rings
Isomorphisms of scattered automatic linear orders
The FO2 alternation hierarchy is decidable
Undecidable First-Order Theories of Affine Geometries
Variants of Collapsible Pushdown Systems
Bounded Satisfiablity for PCTL
A Computational Interpretation of the Axiom of Determinacy in Arithmetic
Descriptive complexity for pictures languages
Equivalence Constraints
A Counting Logic for Structure Transition Systems
A Negative Conjunctive Query is Easy if and only if it is Beta-Acyclic
Church-Rosser Properties of Normal Rewriting
Faster Algorithms for Alternating Refinement Relations
Interactive Realizability for Classical Peano Arithmetic with Skolem Axioms
Collapsing non-idempotent intersection types
Connection Matrices and the Definability of Graph Parameters
Axiomatizing proof tree concepts in bounded arithmetic
Pebble games and linear equations
Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication
On the equational consistency of order-theoretic models of lambda calculus
Bounded Combinatory Logic
Commutative Data Automata
Two-Variable Universal Logic with Transitive Closure
Towards CERes in intuitionistic logic
A Systematic Approach to Canonicity in the Classical Sequent Calculus
Herbrand-Confluence for Cut Elimination in Classical First Order Logic
Knowledge Spaces and the Completeness of Learning Strategies
A syntactical approach to weak omega-groupoids
A Concurrent Logical Relation
Relational Parametricity for Higher Kinds
A Proof of Kamp's theorem
Parametricity in an Impredicative Sort
ML with PTIME complexity guarantees
Higher-order Interpretations and Program Complexity