default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID27th CSL 2013: Torino, Italy
- Simona Ronchi Della Rocca:
Computer Science Logic 2013 (CSL 2013), CSL 2013, September 2-5, 2013, Torino, Italy. LIPIcs 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2013, ISBN 978-3-939897-60-6 - Frontmatter, Table of Contents, Preface, Conference Organization.
- Anuj Dawar
, Thomas A. Henzinger, Damian Niwinski:
The Ackermann Award 2013. 1-4 - Nachum Dershowitz:
Res Publica: The Universal Model of Computation (Invited Talk). 5-10 - Jean-Yves Girard:
Three lightings of logic (Invited Talk). 11-23 - Isabel Oitavem:
From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk). 24-27 - Lidia Tendera:
Means and Limits of Decision (Invited Talk). 28-29 - Bahareh Afshari, Graham E. Leigh:
On closure ordinals for the modal mu-calculus. 30-44 - Federico Aschieri, Stefano Berardi, Giovanni Birolo:
Realizability and Strong Normalization for a Curry-Howard Interpretation of HA + EM1. 45-60 - Christoph Berkholz, Andreas Krebs, Oleg Verbitsky:
Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy. 61-80 - Marcin Bilkowski, Michal Skrzypczak:
Unambiguity and uniformization problems on infinite trees. 81-100 - Pierre Boudes, Fanny He, Michele Pagani:
A characterization of the Taylor expansion of lambda-terms. 101-115 - Julian C. Bradfield:
Team building in dependence. 116-128 - Christopher H. Broadbent, Naoki Kobayashi:
Saturation-Based Model Checking of Higher-Order Recursion Schemes. 129-148 - Andrei A. Bulatov, Víctor Dalmau, Marc Thurley:
Descriptive complexity of approximate counting CSPs. 149-164 - Krishnendu Chatterjee, Martin Chmelik, Mathieu Tracol:
What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives. 165-180 - Krishnendu Chatterjee, Nathanaël Fijalkow:
Infinite-state games with finitary conditions. 181-196 - Ranald Clouston, Jeremy E. Dawson, Rajeev Goré, Alwen Tiu:
Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic. 197-214 - Thomas Colcombet, Denis Kuperberg, Christof Löding, Michael Vanden Boom:
Deciding the weak definability of Büchi definable tree languages. 215-230 - Pietro Di Gianantonio, Marina Lenisa:
Innocent Game Semantics via Intersection Type Assignment Systems. 231-247 - Jérôme Fortier, Luigi Santocanale:
Cuts for circular proofs: semantics and cut-elimination. 248-262 - Pietro Galliani, Miika Hannula, Juha Kontinen:
Hierarchies in independence logic. 263-280 - Pietro Galliani, Lauri Hella:
Inclusion Logic and Fixed Point Logic. 281-295 - Kaveh Ghasemloo, Stephen A. Cook:
Theories for Subexponential-size Bounded-depth Frege Proofs. 296-315 - Stéphane Gimenez, Georg Moser:
The Structure of Interaction. 316-331 - Stefan Göller:
The Fixed-Parameter Tractability of Model Checking Concurrent Systems. 332-347 - Christopher Hampson, Agi Kurucz:
One-variable first-order linear temporal logics with counting. 348-362 - Frederik Harwath, Nicole Schweikardt:
On the locality of arb-invariant first-order logic with modulo counting quantifiers. 363-379 - Paul Hunter:
When is Metric Temporal Logic Expressively Complete?. 380-394 - Kentaro Kikuchi:
Proving Strong Normalisation via Non-deterministic Translations into Klop's Extended lambda-Calculus. 395-414 - Dexter Kozen, Konstantinos Mamouras:
Kleene Algebra with Products and Iteration Theories. 415-431 - Neelakantan R. Krishnaswami, Derek Dreyer:
Internalizing Relational Parametricity in the Extensional Calculus of Constructions. 432-451 - Antti Kuusisto:
Modal Logic and Distributed Message Passing Automata. 452-468 - Daniel Leivant:
Global semantic typing for inductive and coinductive computing. 469-483 - Amaldev Manuel, Thomas Zeume:
Two-Variable Logic on 2-Dimensional Structures. 484-499 - Yoshihiro Maruyama:
Categorical Duality Theory: With Applications to Domains, Convexity, and the Distribution Monad. 500-520 - Marek Materzok:
Axiomatizing Subtyped Delimited Continuations. 521-539 - Paul-André Melliès:
On dialogue games and coherent strategies. 540-562 - Jakub Michaliszyn, Jan Otop:
Elementary Modal Logics over Transitive Structures. 563-577 - Susumu Nishimura:
A Fully Abstract Game Semantics for Parallelism with Non-Blocking Synchronization on Shared Variables. 578-596 - Lionel Rieg:
Extracting Herbrand trees in classical realizability using forcing. 597-614 - Johannes Schmidt, Michal Wrona:
The Complexity of Abduction for Equality Constraint Languages. 615-633 - Rick Statman:
A New Type Assignment for Strongly Normalizable Terms. 634-652 - Qian Wang, Bruno Barras:
Semantics of Intensional Type Theory extended with Decidable Equational Theories. 653-667
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-04 22:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
