Computer Science Logic (CSL 2012)

• Stephen Cook Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems
• Pawel Parys Variants of Collapsible Pushdown Systems
• Alberto Carraro and Antonino Salibra On the equational consistency of order-theoretic models of lambda calculus
• Alexander Leitsch, Giselle Reis, and Bruno Woltzenlogel Paleo Towards CERes in intuitionistic logic
• Wied Pakusa, Bjarki Holm, Anuj Dawar, Eryk Kopczynski, and Erich Grädel Definability of linear equation systems over groups and rings
• Lukasz Kaiser and Simon Leßenich A Counting Logic for Structure Transition Systems
• Johann Makowsky and Tomer Kotek Connection Matrices and the Definability of Graph Parameters
• Johann Brault-Baron A Negative Conjunctive Query is Easy if and only if it is Beta-Acyclic
• Lars Birkedal, Filip Sieczkowski, and Jacob Thamsborg A Concurrent Logical Relation
• Manuel Bodirsky and Michal Wrona Equivalence Constraints
• 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
• Inês Lynce Satisfiability: where Theory meets Practice
• Nathalie Bertrand , John Fearnley, and Sven Schewe Bounded Satisfiablity for PCTL
• Alexander Rabinovich A Proof of Kamp's theorem
• Thomas Ehrhard An application of the extensional collapse of the relational model of linear logic
• Henry Deyoung , Luís Caires , Frank Pfenning, and Bernardo Toninho Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication
• 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
• Federico Aschieri Interactive Realizability for Classical Peano Arithmetic with Skolem Axioms
• Satoru Kuroda Axiomatizing proof tree concepts in bounded arithmetic
• Boris Düdder , Moritz Martens, Jakob Rehof, and Paweł Urzyczyn Bounded Combinatory Logic
• Emanuel Kieronski and Jakub Michaliszyn Two-Variable Universal Logic with Transitive Closure
• Serge Abiteboul Sharing Distributed Knowledge on the Web
• Krishnendu Chatterjee, Siddhesh Chaubal, and Pritish Kamath Faster Algorithms for Alternating Refinement Relations
• Patrick Baillot and Ugo Dal Lago Higher-order Interpretations and Program Complexity
• Dietrich Kuske Isomorphisms of scattered automatic linear orders
• Robert Atkey Relational Parametricity for Higher Kinds
• Johann Makowsky Definability and Complexity of Graph Parameters
• Takanori Hida A Computational Interpretation of the Axiom of Determinacy in Arithmetic
• 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
• Erich Grädel and Simon Lessenich Banach-Mazur Games with Simple Winning Strategies
• Martin Grohe and Martin Otto Pebble games and linear equations
• Jean-Pierre Jouannaud and Jian-Qi Li Church-Rosser Properties of Normal Rewriting
• Zhilin Wu Commutative Data Automata
• Chantal Keller and Marc Lasson Parametricity in an Impredicative Sort
• Jacek Chrząszcz and Aleksy Schubert ML with PTIME complexity guarantees
• Étienne Grandjean and Frédéric Olive Descriptive complexity for pictures languages