LIPIcs, Volume 16, CSL 2012

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