Abstract is missing.
- Frontmatter, Table of Contents, Preface, Conference Organization [doi]
- The Ackermann Award 2012Thierry Coquand, Anuj Dawar, Damian Niwinski. 1-5 [doi]
- Sharing Distributed Knowledge on the Web (Invited Talk)Serge Abiteboul. 6-8 [doi]
- Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk)Stephen A. Cook. 9-11 [doi]
- Satisfiability: where Theory meets Practice (Invited Talk)Inês Lynce. 12-13 [doi]
- Definability and Complexity of Graph Parameters (Invited Talk)Johann A. Makowsky. 14-15 [doi]
- A Syntactical Approach to Weak omega-GroupoidsThorsten Altenkirch, Ondrej Rypacek. 16-30 [doi]
- Interactive Realizability for Classical Peano Arithmetic with Skolem AxiomsFederico Aschieri. 31-45 [doi]
- Relational Parametricity for Higher KindsRobert Atkey. 46-61 [doi]
- Higher-Order Interpretations and Program ComplexityPatrick Baillot, Ugo Dal Lago. 62-76 [doi]
- Knowledge Spaces and the Completeness of Learning StrategiesStefano Berardi, Ugo de'Liguoro. 77-91 [doi]
- Bounded Satisfiability for PCTLNathalie Bertrand, John Fearnley, Sven Schewe. 92-106 [doi]
- A Concurrent Logical RelationLars Birkedal, Filip Sieczkowski, Jacob Thamsborg. 107-121 [doi]
- Equivalence Constraint Satisfaction ProblemsManuel Bodirsky, Michal Wrona. 122-136 [doi]
- A Negative Conjunctive Query is Easy if and only if it is Beta-AcyclicJohann Brault-Baron. 137-151 [doi]
- On the equational consistency of order-theoretic models of the lambda-calculusAlberto Carraro, Antonino Salibra. 152-166 [doi]
- Faster Algorithms for Alternating Refinement RelationsKrishnendu Chatterjee, Siddhesh Chaubal, Pritish Kamath. 167-182 [doi]
- A Systematic Approach to Canonicity in the Classical Sequent CalculusKaustuv Chaudhuri, Stefan Hetzl, Dale Miller. 183-197 [doi]
- ML with PTIME complexity guaranteesJacek Chrzaszcz, Aleksy Schubert. 198-212 [doi]
- Definability of linear equation systems over groups and ringsAnuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa. 213-227 [doi]
- Cut Reduction in Linear Logic as Asynchronous Session-Typed CommunicationHenry DeYoung, Luís Caires, Frank Pfenning, Bernardo Toninho. 228-242 [doi]
- Bounded Combinatory LogicBoris Düdder, Moritz Martens, Jakob Rehof, Pawel Urzyczyn. 243-258 [doi]
- Collapsing non-idempotent intersection typesThomas Ehrhard. 259-273 [doi]
- Descriptive complexity for pictures languagesEtienne Grandjean, Frédéric Olive. 274-288 [doi]
- Pebble Games and Linear EquationsMartin Grohe, Martin Otto. 289-304 [doi]
- Banach-Mazur Games with Simple Winning StrategiesErich Grädel, Simon Leßenich. 305-319 [doi]
- Herbrand-Confluence for Cut Elimination in Classical First Order LogicStefan Hetzl, Lutz Straßburger. 320-334 [doi]
- A Computational Interpretation of the Axiom of Determinacy in ArithmeticTakanori Hida. 335-349 [doi]
- Church-Rosser Properties of Normal RewritingJean-Pierre Jouannaud, Jianqi Li. 350-365 [doi]
- A Counting Logic for Structure Transition SystemsLukasz Kaiser, Simon Leßenich. 366-380 [doi]
- Parametricity in an Impredicative SortChantal Keller, Marc Lasson. 381-395 [doi]
- Two-Variable Universal Logic with Transitive ClosureEmanuel Kieronski, Jakub Michaliszyn. 396-410 [doi]
- Connection Matrices and the Definability of Graph ParametersTomer Kotek, Johann A. Makowsky. 411-425 [doi]
- The FO2 alternation hierarchy is decidableManfred Kufleitner, Pascal Weil. 426-439 [doi]
- Axiomatizing proof tree concepts in Bounded ArithmeticSatoru Kuroda. 440-454 [doi]
- Isomorphisms of scattered automatic linear ordersDietrich Kuske. 455-469 [doi]
- Undecidable First-Order Theories of Affine GeometriesAntti Kuusisto, Jeremy Meyers, Jonni Virtema. 470-484 [doi]
- Towards CERes in intuitionistic logicAlexander Leitsch, Giselle Reis, Bruno Woltzenlogel Paleo. 485-499 [doi]
- Variants of Collapsible Pushdown SystemsPawel Parys. 500-515 [doi]
- A Proof of Kamp's theoremAlexander Rabinovich. 516-527 [doi]
- Commutative Data AutomataZhilin Wu. 528-542 [doi]