LIPIcs, Volume 23, CSL 2013

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