Table of Contents

• Front Matter, Table of Contents, Preface, Conference Organisation, External Reviewers [doi]
• The Ackermann Award 2015Anuj Dawar, Dexter Kozen, Simona Ronchi Della Rocca. [doi]
• The Prophecy of Timely Rollback (Invited Talk)Martín Abadi. 1-1 [doi]
• Temporal Logics with Local Constraints (Invited Talk)Claudia Carapelle, Markus Lohrey. 2-13 [doi]
• Thinking Algorithmically About Impossibility (Invited Talk)R. Ryan Williams. 14-23 [doi]
• Simple Parsimonious Types and Logarithmic SpaceDamiano Mazza. 24-40 [doi]
• First-Order Queries on Finite Abelian GroupsSimone Bova, Barnaby Martin. 41-59 [doi]
• A Definability Dichotomy for Finite Valued CSPsAnuj Dawar, Pengming Wang. 60-77 [doi]
• Evidence for Fixpoint LogicSjoerd Cranen, Bas Luttik, Tim A. C. Willemse. 78-93 [doi]
• Elementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic LogicMatthias Baaz, Christian G. Fermüller. 94-109 [doi]
• Tree Grammars for the Elimination of Non-prenex CutsStefan Hetzl, Sebastian Zivota. 110-127 [doi]
• Automata Theoretic Account of Proof SearchAleksy Schubert, Wil Dekkers, Hendrik Pieter Barendregt. 128-143 [doi]
• Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register AutomataFilip Mazowiecki, Cristian Riveros. 144-159 [doi]
• Aperiodic Two-way Transducers and FO-TransductionsOlivier Carton, Luc Dartois. 160-174 [doi]
• On Relative and Probabilistic Finite CounterabilityOrna Kupferman, Gal Vardi. 175-192 [doi]
• A Model Checking Procedure for Interval Temporal Logics based on Track RepresentativesAlberto Molinari, Angelo Montanari, Adriano Peron. 193-210 [doi]
• Contextuality, Cohomology and ParadoxSamson Abramsky, Rui Soares Barbosa, Kohei Kishida, Raymond Lal, Shane Mansfield. 211-228 [doi]
• A Model for Behavioural Properties of Higher-order ProgramsSylvain Salvati, Igor Walukiewicz. 229-243 [doi]
• Reachability Analysis of First-order Definable Pushdown SystemsLorenzo Clemente, Slawomir Lasota. 244-259 [doi]
• Relational Semantics of Linear Logic and Higher-order Model CheckingCharles Grellois, Paul-André Melliès. 260-276 [doi]
• A Van Benthem Theorem for Modal Team SemanticsJuha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer. 277-291 [doi]
• Axiomatizing Propositional Dependence LogicsKatsuhiko Sano, Jonni Virtema. 292-307 [doi]
• Static Analysis for Logic-based Dynamic ProgramsThomas Schwentick, Nils Vortmeier, Thomas Zeume. 308-324 [doi]
• Sub-classical Boolean Bunched Logics and the Meaning of ParJames Brotherston, Jules Villard. 325-342 [doi]
• Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-FoundednessStefano Berardi. 343-358 [doi]
• Functions out of Higher TruncationsPaolo Capriotti, Nicolai Kraus, Andrea Vezzosi. 359-373 [doi]
• Leaving the Nest: Nominal Techniques for Variables with Interleaving ScopesMurdoch James Gabbay, Dan R. Ghica, Daniela Petrisan. 374-389 [doi]
• Rank Logic is Dead, Long Live Rank Logic!Erich Grädel, Wied Pakusa. 390-404 [doi]
• Two-Restricted One Context Unification is in Polynomial TimeAdria Gascón, Manfred Schmidt-Schauß, Ashish Tiwari. 405-422 [doi]
• Confluence of Layered Rewrite SystemsJiaxiang Liu, Jean-Pierre Jouannaud, Mizuhito Ogawa. 423-440 [doi]
• A Unified Approach to Boundedness Properties in MSOLukasz Kaiser, Martin Lang 0001, Simon Leßenich, Christof Löding. 441-456 [doi]
• Deciding the First Levels of the Modal mu Alternation Hierarchy by Formula ConstructionKaroliina Lehtinen, Sandra Quickert. 457-471 [doi]
• Infinite and Bi-infinite Words with Decidable Monadic TheoriesDietrich Kuske, Jiamou Liu, Anastasia Moskvina. 472-486 [doi]
• A Coalgebraic Decision Procedure for WS1SDmitriy Traytel. 487-503 [doi]
• Weak Subgame Perfect Equilibria and their Application to Quantitative ReachabilityThomas Brihaye, Véronique Bruyère, Noémie Meunier, Jean-François Raskin. 504-518 [doi]
• What are Strategies in Delay Games? Borel Determinacy for Games with LookaheadFelix Klein, Martin Zimmermann 0002. 519-533 [doi]
• On Unambiguous Regular Tree Languages of Index (0, 2)Jacques Duparc, Kevin Fournier, Szczepan Hummel. 534-548 [doi]
• Least and Greatest Fixed Points in LudicsDavid Baelde, Amina Doumane, Alexis Saurin. 549-566 [doi]
• Modelling Coeffects in the Relational Semantics of Linear LogicFlavien Breuvart, Michele Pagani. 567-581 [doi]
• On Classical PCF, Linear Logic and the MIX RuleShahin Amini, Thomas Erhard. 582-596 [doi]
• Uniform One-Dimensional Fragments with One Equivalence RelationEmanuel Kieronski, Antti Kuusisto. 597-615 [doi]
• Finite-Degree Predicates and Two-Variable First-Order LogicCharles Paperman. 616-630 [doi]
• Two-variable Logic with Counting and a Linear OrderWitold Charatonik, Piotr Witkowski 0001. 631-647 [doi]
• Binding Forms in First-Order LogicFabio Mogavero, Giuseppe Perelli. 648-665 [doi]