<h2>LIPIcs, Volume 23, CSL 2013</h2>
<ul>
<li>
<span class="authors">Simona Ronchi Della Rocca</span>
<span class="title">LIPIcs, Volume 23, CSL'13, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013">10.4230/LIPIcs.CSL.2013</a>
</li>
<li>
<span class="authors">Simona Ronchi Della Rocca</span>
<span class="title">Frontmatter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.i">10.4230/LIPIcs.CSL.2013.i</a>
</li>
<li>
<span class="authors">Anuj Dawar, Thomas A. Henzinger, and Damian Niwiński</span>
<span class="title">The Ackermann Award 2013</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.1">10.4230/LIPIcs.CSL.2013.1</a>
</li>
<li>
<span class="authors">Nachum Dershowitz</span>
<span class="title">Res Publica: The Universal Model of Computation (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.5">10.4230/LIPIcs.CSL.2013.5</a>
</li>
<li>
<span class="authors">Jean-Yves Girard</span>
<span class="title">Three lightings of logic (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.11">10.4230/LIPIcs.CSL.2013.11</a>
</li>
<li>
<span class="authors">Isabel Oitavem</span>
<span class="title">From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.24">10.4230/LIPIcs.CSL.2013.24</a>
</li>
<li>
<span class="authors">Lidia Tendera</span>
<span class="title">Means and Limits of Decision (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.28">10.4230/LIPIcs.CSL.2013.28</a>
</li>
<li>
<span class="authors">Bahareh Afshari and Graham E. Leigh</span>
<span class="title">On closure ordinals for the modal mu-calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.30">10.4230/LIPIcs.CSL.2013.30</a>
</li>
<li>
<span class="authors">Federico Aschieri, Stefano Berardi, and Giovanni Birolo</span>
<span class="title">Realizability and Strong Normalization for a Curry-Howard Interpretation of HA + EM1</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.45">10.4230/LIPIcs.CSL.2013.45</a>
</li>
<li>
<span class="authors">Christoph Berkholz, Andreas Krebs, and Oleg Verbitsky</span>
<span class="title">Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.61">10.4230/LIPIcs.CSL.2013.61</a>
</li>
<li>
<span class="authors">Marcin Bilkowski and Michał Skrzypczak</span>
<span class="title">Unambiguity and uniformization problems on infinite trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.81">10.4230/LIPIcs.CSL.2013.81</a>
</li>
<li>
<span class="authors">Pierre Boudes, Fanny He, and Michele Pagani</span>
<span class="title">A characterization of the Taylor expansion of lambda-terms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.101">10.4230/LIPIcs.CSL.2013.101</a>
</li>
<li>
<span class="authors">Julian Bradfield</span>
<span class="title">Team building in dependence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.116">10.4230/LIPIcs.CSL.2013.116</a>
</li>
<li>
<span class="authors">Christopher Broadbent and Naoki Kobayashi</span>
<span class="title">Saturation-Based Model Checking of Higher-Order Recursion Schemes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.129">10.4230/LIPIcs.CSL.2013.129</a>
</li>
<li>
<span class="authors">Andrei Bulatov, Victor Dalmau, and Marc Thurley</span>
<span class="title">Descriptive complexity of approximate counting CSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.149">10.4230/LIPIcs.CSL.2013.149</a>
</li>
<li>
<span class="authors">Krishnendu Chatterjee, Martin Chmelik, and Mathieu Tracol</span>
<span class="title">What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.165">10.4230/LIPIcs.CSL.2013.165</a>
</li>
<li>
<span class="authors">Krishnendu Chatterjee and Nathanaël Fijalkow</span>
<span class="title">Infinite-state games with finitary conditions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.181">10.4230/LIPIcs.CSL.2013.181</a>
</li>
<li>
<span class="authors">Ranald Clouston, Jeremy Dawson, Rajeev Goré, and Alwen Tiu</span>
<span class="title">Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.197">10.4230/LIPIcs.CSL.2013.197</a>
</li>
<li>
<span class="authors">Thomas Colcombet, Denis Kuperberg, Christof Löding, and Michael Vanden Boom</span>
<span class="title">Deciding the weak definability of Büchi definable tree languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.215">10.4230/LIPIcs.CSL.2013.215</a>
</li>
<li>
<span class="authors">Pietro Di Gianantonio and Marina Lenisa</span>
<span class="title">Innocent Game Semantics via Intersection Type Assignment Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.231">10.4230/LIPIcs.CSL.2013.231</a>
</li>
<li>
<span class="authors">Jérôme Fortier and Luigi Santocanale</span>
<span class="title">Cuts for circular proofs: semantics and cut-elimination</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.248">10.4230/LIPIcs.CSL.2013.248</a>
</li>
<li>
<span class="authors">Pietro Galliani, Miika Hannula, and Juha Kontinen</span>
<span class="title">Hierarchies in independence logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.263">10.4230/LIPIcs.CSL.2013.263</a>
</li>
<li>
<span class="authors">Pietro Galliani and Lauri Hella</span>
<span class="title">Inclusion Logic and Fixed Point Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.281">10.4230/LIPIcs.CSL.2013.281</a>
</li>
<li>
<span class="authors">Kaveh Ghasemloo and Stephen A. Cook</span>
<span class="title">Theories for Subexponential-size Bounded-depth Frege Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.296">10.4230/LIPIcs.CSL.2013.296</a>
</li>
<li>
<span class="authors">Stéphane Gimenez and Georg Moser</span>
<span class="title">The Structure of Interaction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.316">10.4230/LIPIcs.CSL.2013.316</a>
</li>
<li>
<span class="authors">Stefan Göller</span>
<span class="title">The Fixed-Parameter Tractability of Model Checking Concurrent Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.332">10.4230/LIPIcs.CSL.2013.332</a>
</li>
<li>
<span class="authors">Christopher Hampson and Agi Kurucz</span>
<span class="title">One-variable first-order linear temporal logics with counting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.348">10.4230/LIPIcs.CSL.2013.348</a>
</li>
<li>
<span class="authors">Frederik Harwath and Nicole Schweikardt</span>
<span class="title">On the locality of arb-invariant first-order logic with modulo counting quantifiers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.363">10.4230/LIPIcs.CSL.2013.363</a>
</li>
<li>
<span class="authors">Paul Hunter</span>
<span class="title">When is Metric Temporal Logic Expressively Complete?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.380">10.4230/LIPIcs.CSL.2013.380</a>
</li>
<li>
<span class="authors">Kentaro Kikuchi</span>
<span class="title">Proving Strong Normalisation via Non-deterministic Translations into Klop's Extended lambda-Calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.395">10.4230/LIPIcs.CSL.2013.395</a>
</li>
<li>
<span class="authors">Dexter Kozen and Konstantinos Mamouras</span>
<span class="title">Kleene Algebra with Products and Iteration Theories</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.415">10.4230/LIPIcs.CSL.2013.415</a>
</li>
<li>
<span class="authors">Neelakantan R. Krishnaswami and Derek Dreyer</span>
<span class="title">Internalizing Relational Parametricity in the Extensional Calculus of Constructions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.432">10.4230/LIPIcs.CSL.2013.432</a>
</li>
<li>
<span class="authors">Antti Kuusisto</span>
<span class="title">Modal Logic and Distributed Message Passing Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.452">10.4230/LIPIcs.CSL.2013.452</a>
</li>
<li>
<span class="authors">Daniel Leivant</span>
<span class="title">Global semantic typing for inductive and coinductive computing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.469">10.4230/LIPIcs.CSL.2013.469</a>
</li>
<li>
<span class="authors">Amaldev Manuel and Thomas Zeume</span>
<span class="title">Two-Variable Logic on 2-Dimensional Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.484">10.4230/LIPIcs.CSL.2013.484</a>
</li>
<li>
<span class="authors">Yoshihiro Maruyama</span>
<span class="title">Categorical Duality Theory: With Applications to Domains, Convexity, and the Distribution Monad</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.500">10.4230/LIPIcs.CSL.2013.500</a>
</li>
<li>
<span class="authors">Marek Materzok</span>
<span class="title">Axiomatizing Subtyped Delimited Continuations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.521">10.4230/LIPIcs.CSL.2013.521</a>
</li>
<li>
<span class="authors">Paul-André Melliès</span>
<span class="title">On dialogue games and coherent strategies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.540">10.4230/LIPIcs.CSL.2013.540</a>
</li>
<li>
<span class="authors">Jakub Michaliszyn and Jan Otop</span>
<span class="title">Elementary Modal Logics over Transitive Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.563">10.4230/LIPIcs.CSL.2013.563</a>
</li>
<li>
<span class="authors">Susumu Nishimura</span>
<span class="title">A Fully Abstract Game Semantics for Parallelism with Non-Blocking Synchronization on Shared Variables</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.578">10.4230/LIPIcs.CSL.2013.578</a>
</li>
<li>
<span class="authors">Lionel Rieg</span>
<span class="title">Extracting Herbrand trees in classical realizability using forcing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.597">10.4230/LIPIcs.CSL.2013.597</a>
</li>
<li>
<span class="authors">Johannes Schmidt and Michał Wrona</span>
<span class="title">The Complexity of Abduction for Equality Constraint Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.615">10.4230/LIPIcs.CSL.2013.615</a>
</li>
<li>
<span class="authors">Rick Statman</span>
<span class="title">A New Type Assignment for Strongly Normalizable Terms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.634">10.4230/LIPIcs.CSL.2013.634</a>
</li>
<li>
<span class="authors">Qian Wang and Bruno Barras</span>
<span class="title">Semantics of Intensional Type Theory extended with Decidable Equational Theories</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2013.653">10.4230/LIPIcs.CSL.2013.653</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