<h2>LIPIcs, Volume 41, CSL 2015</h2>
<ul>
<li>
<span class="authors">Stephan Kreutzer</span>
<span class="title">LIPIcs, Volume 41, CSL'15, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015">10.4230/LIPIcs.CSL.2015</a>
</li>
<li>
<span class="authors">Stephan Kreutzer</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organisation, External Reviewers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.i">10.4230/LIPIcs.CSL.2015.i</a>
</li>
<li>
<span class="authors">Anuj Dawar, Dexter Kozen, and Simona Ronchi Della Rocca</span>
<span class="title">The Ackermann Award 2015</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.xv">10.4230/LIPIcs.CSL.2015.xv</a>
</li>
<li>
<span class="authors">Martín Abadi</span>
<span class="title">The Prophecy of Timely Rollback (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.1">10.4230/LIPIcs.CSL.2015.1</a>
</li>
<li>
<span class="authors">Claudia Carapelle and Markus Lohrey</span>
<span class="title">Temporal Logics with Local Constraints (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.2">10.4230/LIPIcs.CSL.2015.2</a>
</li>
<li>
<span class="authors">R. Ryan Williams</span>
<span class="title">Thinking Algorithmically About Impossibility (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.14">10.4230/LIPIcs.CSL.2015.14</a>
</li>
<li>
<span class="authors">Damiano Mazza</span>
<span class="title">Simple Parsimonious Types and Logarithmic Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.24">10.4230/LIPIcs.CSL.2015.24</a>
</li>
<li>
<span class="authors">Simone Bova and Barnaby Martin</span>
<span class="title">First-Order Queries on Finite Abelian Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.41">10.4230/LIPIcs.CSL.2015.41</a>
</li>
<li>
<span class="authors">Anuj Dawar and Pengming Wang</span>
<span class="title">A Definability Dichotomy for Finite Valued CSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.60">10.4230/LIPIcs.CSL.2015.60</a>
</li>
<li>
<span class="authors">Sjoerd Cranen, Bas Luttik, and Tim A. C. Willemse</span>
<span class="title">Evidence for Fixpoint Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.78">10.4230/LIPIcs.CSL.2015.78</a>
</li>
<li>
<span class="authors">Matthias Baaz and Christian G. Fermüller</span>
<span class="title">Elementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.94">10.4230/LIPIcs.CSL.2015.94</a>
</li>
<li>
<span class="authors">Stefan Hetzl and Sebastian Zivota</span>
<span class="title">Tree Grammars for the Elimination of Non-prenex Cuts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.110">10.4230/LIPIcs.CSL.2015.110</a>
</li>
<li>
<span class="authors">Aleksy Schubert, Wil Dekkers, and Henk P. Barendregt</span>
<span class="title">Automata Theoretic Account of Proof Search</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.128">10.4230/LIPIcs.CSL.2015.128</a>
</li>
<li>
<span class="authors">Filip Mazowiecki and Cristian Riveros</span>
<span class="title">Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.144">10.4230/LIPIcs.CSL.2015.144</a>
</li>
<li>
<span class="authors">Olivier Carton and Luc Dartois</span>
<span class="title">Aperiodic Two-way Transducers and FO-Transductions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.160">10.4230/LIPIcs.CSL.2015.160</a>
</li>
<li>
<span class="authors">Orna Kupferman and Gal Vardi</span>
<span class="title">On Relative and Probabilistic Finite Counterability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.175">10.4230/LIPIcs.CSL.2015.175</a>
</li>
<li>
<span class="authors">Alberto Molinari, Angelo Montanari, and Adriano Peron</span>
<span class="title">A Model Checking Procedure for Interval Temporal Logics based on Track Representatives</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.193">10.4230/LIPIcs.CSL.2015.193</a>
</li>
<li>
<span class="authors">Samson Abramsky, Rui Soares Barbosa, Kohei Kishida, Raymond Lal, and Shane Mansfield</span>
<span class="title">Contextuality, Cohomology and Paradox</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.211">10.4230/LIPIcs.CSL.2015.211</a>
</li>
<li>
<span class="authors">Sylvain Salvati and Igor Walukiewicz</span>
<span class="title">A Model for Behavioural Properties of Higher-order Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.229">10.4230/LIPIcs.CSL.2015.229</a>
</li>
<li>
<span class="authors">Lorenzo Clemente and Slawomir Lasota</span>
<span class="title">Reachability Analysis of First-order Definable Pushdown Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.244">10.4230/LIPIcs.CSL.2015.244</a>
</li>
<li>
<span class="authors">Charles Grellois and Paul-André Melliès</span>
<span class="title">Relational Semantics of Linear Logic and Higher-order Model Checking</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.260">10.4230/LIPIcs.CSL.2015.260</a>
</li>
<li>
<span class="authors">Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, and Heribert Vollmer</span>
<span class="title">A Van Benthem Theorem for Modal Team Semantics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.277">10.4230/LIPIcs.CSL.2015.277</a>
</li>
<li>
<span class="authors">Katsuhiko Sano and Jonni Virtema</span>
<span class="title">Axiomatizing Propositional Dependence Logics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.292">10.4230/LIPIcs.CSL.2015.292</a>
</li>
<li>
<span class="authors">Thomas Schwentick, Nils Vortmeier, and Thomas Zeume</span>
<span class="title">Static Analysis for Logic-based Dynamic Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.308">10.4230/LIPIcs.CSL.2015.308</a>
</li>
<li>
<span class="authors">James Brotherston and Jules Villard</span>
<span class="title">Sub-classical Boolean Bunched Logics and the Meaning of Par</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.325">10.4230/LIPIcs.CSL.2015.325</a>
</li>
<li>
<span class="authors">Stefano Berardi</span>
<span class="title">Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.343">10.4230/LIPIcs.CSL.2015.343</a>
</li>
<li>
<span class="authors">Paolo Capriotti, Nicolai Kraus, and Andrea Vezzosi</span>
<span class="title">Functions out of Higher Truncations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.359">10.4230/LIPIcs.CSL.2015.359</a>
</li>
<li>
<span class="authors">Murdoch J. Gabbay, Dan R. Ghica, and Daniela Petrisan</span>
<span class="title">Leaving the Nest: Nominal Techniques for Variables with Interleaving Scopes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.374">10.4230/LIPIcs.CSL.2015.374</a>
</li>
<li>
<span class="authors">Erich Grädel and Wied Pakusa</span>
<span class="title">Rank Logic is Dead, Long Live Rank Logic!</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.390">10.4230/LIPIcs.CSL.2015.390</a>
</li>
<li>
<span class="authors">Adrià Gascón, Manfred Schmidt-Schauß, and Ashish Tiwari</span>
<span class="title">Two-Restricted One Context Unification is in Polynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.405">10.4230/LIPIcs.CSL.2015.405</a>
</li>
<li>
<span class="authors">Jiaxiang Liu, Jean-Pierre Jouannaud, and Mizuhito Ogawa</span>
<span class="title">Confluence of Layered Rewrite Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.423">10.4230/LIPIcs.CSL.2015.423</a>
</li>
<li>
<span class="authors">Lukasz Kaiser, Martin Lang, Simon Leßenich, and Christof Löding</span>
<span class="title">A Unified Approach to Boundedness Properties in MSO</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.441">10.4230/LIPIcs.CSL.2015.441</a>
</li>
<li>
<span class="authors">Karoliina Lehtinen and Sandra Quickert</span>
<span class="title">Deciding the First Levels of the Modal mu Alternation Hierarchy by Formula Construction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.457">10.4230/LIPIcs.CSL.2015.457</a>
</li>
<li>
<span class="authors">Dietrich Kuske, Jiamou Liu, and Anastasia Moskvina</span>
<span class="title">Infinite and Bi-infinite Words with Decidable Monadic Theories</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.472">10.4230/LIPIcs.CSL.2015.472</a>
</li>
<li>
<span class="authors">Dmitriy Traytel</span>
<span class="title">A Coalgebraic Decision Procedure for WS1S</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.487">10.4230/LIPIcs.CSL.2015.487</a>
</li>
<li>
<span class="authors">Thomas Brihaye, Véronique Bruyère, Noémie Meunier, and Jean-Francois Raskin</span>
<span class="title">Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.504">10.4230/LIPIcs.CSL.2015.504</a>
</li>
<li>
<span class="authors">Felix Klein and Martin Zimmermann</span>
<span class="title">What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.519">10.4230/LIPIcs.CSL.2015.519</a>
</li>
<li>
<span class="authors">Jacques Duparc, Kevin Fournier, and Szczepan Hummel</span>
<span class="title">On Unambiguous Regular Tree Languages of Index (0,2)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.534">10.4230/LIPIcs.CSL.2015.534</a>
</li>
<li>
<span class="authors">David Baelde, Amina Doumane, and Alexis Saurin</span>
<span class="title">Least and Greatest Fixed Points in Ludics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.549">10.4230/LIPIcs.CSL.2015.549</a>
</li>
<li>
<span class="authors">Flavien Breuvart and Michele Pagani</span>
<span class="title">Modelling Coeffects in the Relational Semantics of Linear Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.567">10.4230/LIPIcs.CSL.2015.567</a>
</li>
<li>
<span class="authors">Shahin Amini and Thomas Erhard</span>
<span class="title">On Classical PCF, Linear Logic and the MIX Rule</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.582">10.4230/LIPIcs.CSL.2015.582</a>
</li>
<li>
<span class="authors">Emanuel Kierónski and Antti Kuusisto</span>
<span class="title">Uniform One-Dimensional Fragments with One Equivalence Relation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.597">10.4230/LIPIcs.CSL.2015.597</a>
</li>
<li>
<span class="authors">Charles Paperman</span>
<span class="title">Finite-Degree Predicates and Two-Variable First-Order Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.616">10.4230/LIPIcs.CSL.2015.616</a>
</li>
<li>
<span class="authors">Witold Charatonik and Piotr Witkowski</span>
<span class="title">Two-variable Logic with Counting and a Linear Order</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.631">10.4230/LIPIcs.CSL.2015.631</a>
</li>
<li>
<span class="authors">Fabio Mogavero and Giuseppe Perelli</span>
<span class="title">Binding Forms in First-Order Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2015.648">10.4230/LIPIcs.CSL.2015.648</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing