Abstract is missing.
- Frontmatter, Table of Contents, Preface, Conference Organization [doi]
- The Ackermann Award 2013Anuj Dawar, Thomas A. Henzinger, Damian Niwinski. 1-4 [doi]
- Res Publica: The Universal Model of Computation (Invited Talk)Nachum Dershowitz. 5-10 [doi]
- Three lightings of logic (Invited Talk)Jean-Yves Girard. 11-23 [doi]
- From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk)Isabel Oitavem. 24-27 [doi]
- Means and Limits of Decision (Invited Talk)Lidia Tendera. 28-29 [doi]
- On closure ordinals for the modal mu-calculusBahareh Afshari, Graham E. Leigh. 30-44 [doi]
- Realizability and Strong Normalization for a Curry-Howard Interpretation of HA + EM1Federico Aschieri, Stefano Berardi, Giovanni Birolo. 45-60 [doi]
- Bounds for the quantifier depth in finite-variable logics: Alternation hierarchyChristoph Berkholz, Andreas Krebs, Oleg Verbitsky. 61-80 [doi]
- Unambiguity and uniformization problems on infinite treesMarcin Bilkowski, Michal Skrzypczak. 81-100 [doi]
- A characterization of the Taylor expansion of lambda-termsPierre Boudes, Fanny He, Michele Pagani. 101-115 [doi]
- Team building in dependenceJulian C. Bradfield. 116-128 [doi]
- Saturation-Based Model Checking of Higher-Order Recursion SchemesChristopher H. Broadbent, Naoki Kobayashi 0001. 129-148 [doi]
- Descriptive complexity of approximate counting CSPsAndrei A. Bulatov, Víctor Dalmau, Marc Thurley. 149-164 [doi]
- What is Decidable about Partially Observable Markov Decision Processes with omega-Regular ObjectivesKrishnendu Chatterjee, Martin Chmelik, Mathieu Tracol. 165-180 [doi]
- Infinite-state games with finitary conditionsKrishnendu Chatterjee, Nathanaël Fijalkow. 181-196 [doi]
- Annotation-Free Sequent Calculi for Full Intuitionistic Linear LogicRanald Clouston, Jeremy E. Dawson, Rajeev Goré, Alwen Tiu. 197-214 [doi]
- Deciding the weak definability of Büchi definable tree languagesThomas Colcombet, Denis Kuperberg, Christof Löding, Michael Vanden Boom. 215-230 [doi]
- Innocent Game Semantics via Intersection Type Assignment SystemsPietro Di Gianantonio, Marina Lenisa. 231-247 [doi]
- Cuts for circular proofs: semantics and cut-eliminationJérôme Fortier, Luigi Santocanale. 248-262 [doi]
- Hierarchies in independence logicPietro Galliani, Miika Hannula, Juha Kontinen. 263-280 [doi]
- Inclusion Logic and Fixed Point LogicPietro Galliani, Lauri Hella. 281-295 [doi]
- Theories for Subexponential-size Bounded-depth Frege ProofsKaveh Ghasemloo, Stephen A. Cook. 296-315 [doi]
- The Structure of InteractionStéphane Gimenez, Georg Moser. 316-331 [doi]
- The Fixed-Parameter Tractability of Model Checking Concurrent SystemsStefan Göller. 332-347 [doi]
- One-variable first-order linear temporal logics with countingChristopher Hampson, Agi Kurucz. 348-362 [doi]
- On the locality of arb-invariant first-order logic with modulo counting quantifiersFrederik Harwath, Nicole Schweikardt. 363-379 [doi]
- When is Metric Temporal Logic Expressively Complete?Paul Hunter. 380-394 [doi]
- Proving Strong Normalisation via Non-deterministic Translations into Klop's Extended lambda-CalculusKentaro Kikuchi. 395-414 [doi]
- Kleene Algebra with Products and Iteration TheoriesDexter Kozen, Konstantinos Mamouras. 415-431 [doi]
- Internalizing Relational Parametricity in the Extensional Calculus of ConstructionsNeelakantan R. Krishnaswami, Derek Dreyer. 432-451 [doi]
- Modal Logic and Distributed Message Passing AutomataAntti Kuusisto. 452-468 [doi]
- Global semantic typing for inductive and coinductive computingDaniel Leivant. 469-483 [doi]
- Two-Variable Logic on 2-Dimensional StructuresAmaldev Manuel, Thomas Zeume. 484-499 [doi]
- Categorical Duality Theory: With Applications to Domains, Convexity, and the Distribution MonadYoshihiro Maruyama. 500-520 [doi]
- Axiomatizing Subtyped Delimited ContinuationsMarek Materzok. 521-539 [doi]
- On dialogue games and coherent strategiesPaul-André Melliès. 540-562 [doi]
- Elementary Modal Logics over Transitive StructuresJakub Michaliszyn, Jan Otop. 563-577 [doi]
- A Fully Abstract Game Semantics for Parallelism with Non-Blocking Synchronization on Shared VariablesSusumu Nishimura. 578-596 [doi]
- Extracting Herbrand trees in classical realizability using forcingLionel Rieg. 597-614 [doi]
- The Complexity of Abduction for Equality Constraint LanguagesJohannes Schmidt 0001, Michal Wrona. 615-633 [doi]
- A New Type Assignment for Strongly Normalizable TermsRick Statman. 634-652 [doi]
- Semantics of Intensional Type Theory extended with Decidable Equational TheoriesQian Wang, Bruno Barras. 653-667 [doi]