LIPIcs, Volume 62, CSL 2016

• Jean-Marc Talbot and Laurent Regnier LIPIcs, Volume 62, CSL'16, Complete Volume 10.4230/LIPIcs.CSL.2016
• Jean-Marc Talbot and Laurent Regnier Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers 10.4230/LIPIcs.CSL.2016.0
• Thierry Coquand and Anuj Dawar The Ackermann Award 2016 10.4230/LIPIcs.CSL.2016.1
• Libor Barto Infinite Domain Constraint Satisfaction Problem (Invited Talk) 10.4230/LIPIcs.CSL.2016.2
• Anca Muscholl Automated Synthesis: Going Distributed (Invited Talk) 10.4230/LIPIcs.CSL.2016.3
• Agata Ciabattoni Analytic Calculi for Non-Classical Logics: Theory and Applications (Invited Talk) 10.4230/LIPIcs.CSL.2016.4
• Alexandra Silva Coalgebraic Learning (Invited Talk) 10.4230/LIPIcs.CSL.2016.5
• Hans Leiss The Matrix Ring of a mu-Continuous Chomsky Algebra is mu-Continuous 10.4230/LIPIcs.CSL.2016.6
• Sebastian Enqvist, Fatemeh Seifan, and Yde Venema Completeness for Coalgebraic Fixpoint Logic 10.4230/LIPIcs.CSL.2016.7
• Akihisa Yamada, Christian Sternagel, René Thiemann, and Keiichirou Kusakari AC Dependency Pairs Revisited 10.4230/LIPIcs.CSL.2016.8
• Jérémy Dubut, Eric Goubault, and Jean Goubault-Larrecq The Directed Homotopy Hypothesis 10.4230/LIPIcs.CSL.2016.9
• Paulo Tabuada and Daniel Neider Robust Linear Temporal Logic 10.4230/LIPIcs.CSL.2016.10
• Pawel Parys and Szymon Torunczyk Models of Lambda-Calculus and the Weak MSO Logic 10.4230/LIPIcs.CSL.2016.11
• Moses Ganardi, Stefan Göller, and Markus Lohrey On the Parallel Complexity of Bisimulation on Finite Systems 10.4230/LIPIcs.CSL.2016.12
• Tomer Kotek, Helmut Veith, and Florian Zuleger Monadic Second Order Finite Satisfiability and Unbounded Tree-Width 10.4230/LIPIcs.CSL.2016.13
• Lauri Hella and Phokion G. Kolaitis Dependence Logic vs. Constraint Satisfaction 10.4230/LIPIcs.CSL.2016.14
• Hubie Chen and Peter Mayr Quantified Constraint Satisfaction on Monoids 10.4230/LIPIcs.CSL.2016.15
• Albert Atserias and Szymon Torunczyk Non-Homogenizable Classes of Finite Structures 10.4230/LIPIcs.CSL.2016.16
• Michael Elberfeld Context-Free Graph Properties via Definable Decompositions 10.4230/LIPIcs.CSL.2016.17
• Kord Eickmeyer and Ken-ichi Kawarabayashi Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs 10.4230/LIPIcs.CSL.2016.18
• Wied Pakusa, Svenja Schalthöfer, and Erkal Selman Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time 10.4230/LIPIcs.CSL.2016.19
• Arnaud Durand, Anselm Haak, Juha Kontinen, and Heribert Vollmer Descriptive Complexity of #AC^0 Functions 10.4230/LIPIcs.CSL.2016.20
• Thorsten Altenkirch, Paolo Capriotti, and Nicolai Kraus Extending Homotopy Type Theory with Strict Equality 10.4230/LIPIcs.CSL.2016.21
• Kuen-Bang Hou (Favonia) and Michael Shulman The Seifert-van Kampen Theorem in Homotopy Type Theory 10.4230/LIPIcs.CSL.2016.22
• Lars Birkedal, Aleš Bizjak, Ranald Clouston, Hans Bugge Grathwohl, Bas Spitters, and Andrea Vezzosi Guarded Cubical Type Theory: Path Equality for Guarded Recursion 10.4230/LIPIcs.CSL.2016.23
• Ian Orton and Andrew M. Pitts Axioms for Modelling Cubical Type Theory in a Topos 10.4230/LIPIcs.CSL.2016.24
• Jean-Louis Krivine Bar Recursion in Classical Realisability: Dependent Choice and Continuum Hypothesis 10.4230/LIPIcs.CSL.2016.25
• Ulrich Berger Extracting Non-Deterministic Concurrent Programs 10.4230/LIPIcs.CSL.2016.26
• James Laird Polymorphic Game Semantics for Dynamic Binding 10.4230/LIPIcs.CSL.2016.27
• Shaull Almagor and Orna Kupferman High-Quality Synthesis Against Stochastic Environments 10.4230/LIPIcs.CSL.2016.28
• Rajeev Alur, Marco Faella, Sampath Kannan, and Nimit Singhania Hedging Bets in Markov Decision Processes 10.4230/LIPIcs.CSL.2016.29
• Paul Hunter, Guillermo A. Pérez, and Jean-François Raskin Minimizing Regret in Discounted-Sum Games 10.4230/LIPIcs.CSL.2016.30
• Alexander Weinert and Martin Zimmermann Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs 10.4230/LIPIcs.CSL.2016.31
• David Baelde, Simon Lunel, and Sylvain Schmitz A Sequent Calculus for a Modal Logic on Finite Data Trees 10.4230/LIPIcs.CSL.2016.32
• Martin Lück Axiomatizations for Propositional and Modal Team Logic 10.4230/LIPIcs.CSL.2016.33
• Gergei Bana and Mitsuhiro Okada Semantics for "Enough-Certainty" and Fitting's Embedding of Classical Logic in S4 10.4230/LIPIcs.CSL.2016.34
• Erich Grädel and Stefan Hegselmann Counting in Team Semantics 10.4230/LIPIcs.CSL.2016.35
• Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Pierre Pradic, and Michal Skrzypczak The Logical Strength of Büchi's Decidability Theorem 10.4230/LIPIcs.CSL.2016.36
• Prateek Karandikar and Philippe Schnoebelen The Height of Piecewise-Testable Languages with Applications in Logical Complexity 10.4230/LIPIcs.CSL.2016.37
• Emanuel Kieronski One-Dimensional Logic over Words 10.4230/LIPIcs.CSL.2016.38
• Ian Pratt-Hartmann, Wieslaw Szwast, and Lidia Tendera Quine's Fluted Fragment is Non-Elementary 10.4230/LIPIcs.CSL.2016.39
• Patrick Baillot and Anupam Das Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic 10.4230/LIPIcs.CSL.2016.40
• Daniel de Carvalho The Relational Model Is Injective for Multiplicative Exponential Linear Logic 10.4230/LIPIcs.CSL.2016.41
• David Baelde, Amina Doumane, and Alexis Saurin Infinitary Proof Theory: the Multiplicative Additive Case 10.4230/LIPIcs.CSL.2016.42