Portal - CSL 2013

CSL 2013	September 2-5, 2013, Torino, Italy
Computer Science Logic 2013 (CSL 2013) Simona Ronchi Della Rocca (Ed.)
ISBN 978-3-939897-60-6, LIPICS Vol. 23	ISSN 1868-8969

Additional Information

License
Conference Website
Complete volume (PDF, 20 MB)
Search Publication Server

Authors

Broadbent, Christopher

Bulatov, Andrei

Chatterjee, Krishnendu

Di Gianantonio, Pietro

Krishnaswami, Neelakantan R.

Mamouras, Konstantinos

Ronchi Della Rocca, Simona

Frontmatter, Table of Contents, Preface, Conference Organization

Authors: Ronchi Della Rocca, Simona

Abstract | Document (337 KB) | BibTeX

The Ackermann Award 2013

Authors: Dawar, Anuj ; Henzinger, Thomas A. ; Niwiński, Damian

Abstract | Document (261 KB) | BibTeX

Res Publica: The Universal Model of Computation (Invited Talk)

Authors: Dershowitz, Nachum

Abstract | Document (374 KB) | BibTeX

Three lightings of logic (Invited Talk)

Authors: Girard, Jean-Yves

Abstract | Document (523 KB) | BibTeX

From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk)

Authors: Oitavem, Isabel

Abstract | Document (264 KB) | BibTeX

Means and Limits of Decision (Invited Talk)

Authors: Tendera, Lidia

Abstract | Document (234 KB) | BibTeX

On closure ordinals for the modal mu-calculus

Authors: Afshari, Bahareh ; Leigh, Graham E.

Abstract | Document (519 KB) | BibTeX

Realizability and Strong Normalization for a Curry-Howard Interpretation of HA + EM1

Authors: Aschieri, Federico ; Berardi, Stefano ; Birolo, Giovanni

Abstract | Document (620 KB) | BibTeX

Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy

Authors: Berkholz, Christoph ; Krebs, Andreas ; Verbitsky, Oleg

Abstract | Document (632 KB) | BibTeX

Unambiguity and uniformization problems on infinite trees

Authors: Bilkowski, Marcin ; Skrzypczak, Michał

Abstract | Document (498 KB) | BibTeX

A characterization of the Taylor expansion of lambda-terms

Authors: Boudes, Pierre ; He, Fanny ; Pagani, Michele

Abstract | Document (557 KB) | BibTeX

Team building in dependence

Authors: Bradfield, Julian

Abstract | Document (362 KB) | BibTeX

Saturation-Based Model Checking of Higher-Order Recursion Schemes

Authors: Broadbent, Christopher ; Kobayashi, Naoki

Abstract | Document (668 KB) | BibTeX

Descriptive complexity of approximate counting CSPs

Authors: Bulatov, Andrei ; Dalmau, Victor ; Thurley, Marc

Abstract | Document (577 KB) | BibTeX

What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives

Authors: Chatterjee, Krishnendu ; Chmelik, Martin ; Tracol, Mathieu

Abstract | Document (538 KB) | BibTeX

Infinite-state games with finitary conditions

Authors: Chatterjee, Krishnendu ; Fijalkow, Nathanaël

Abstract | Document (534 KB) | BibTeX

Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic

Authors: Clouston, Ranald ; Dawson, Jeremy ; Goré, Rajeev ; Tiu, Alwen

Abstract | Document (649 KB) | BibTeX

Deciding the weak definability of Büchi definable tree languages

Authors: Colcombet, Thomas ; Kuperberg, Denis ; Löding, Christof ; Vanden Boom, Michael

Abstract | Document (531 KB) | BibTeX

Innocent Game Semantics via Intersection Type Assignment Systems

Authors: Di Gianantonio, Pietro ; Lenisa, Marina

Abstract | Document (463 KB) | BibTeX

Cuts for circular proofs: semantics and cut-elimination

Authors: Fortier, Jérôme ; Santocanale, Luigi

Abstract | Document (618 KB) | BibTeX

Hierarchies in independence logic

Authors: Galliani, Pietro ; Hannula, Miika ; Kontinen, Juha

Abstract | Document (499 KB) | BibTeX

Inclusion Logic and Fixed Point Logic

Authors: Galliani, Pietro ; Hella, Lauri

Abstract | Document (548 KB) | BibTeX

Theories for Subexponential-size Bounded-depth Frege Proofs

Authors: Ghasemloo, Kaveh ; Cook, Stephen A.

Abstract | Document (589 KB) | BibTeX

The Structure of Interaction

Authors: Gimenez, Stéphane ; Moser, Georg

Abstract | Document (559 KB) | BibTeX

The Fixed-Parameter Tractability of Model Checking Concurrent Systems

Authors: Göller, Stefan

Abstract | Document (605 KB) | BibTeX

One-variable first-order linear temporal logics with counting

Authors: Hampson, Christopher ; Kurucz, Agi

Abstract | Document (523 KB) | BibTeX

On the locality of arb-invariant first-order logic with modulo counting quantifiers

Authors: Harwath, Frederik ; Schweikardt, Nicole

Abstract | Document (585 KB) | BibTeX

When is Metric Temporal Logic Expressively Complete?

Authors: Hunter, Paul

Abstract | Document (509 KB) | BibTeX

Proving Strong Normalisation via Non-deterministic Translations into Klop's Extended lambda-Calculus

Authors: Kikuchi, Kentaro

Abstract | Document (577 KB) | BibTeX

Kleene Algebra with Products and Iteration Theories

Authors: Kozen, Dexter ; Mamouras, Konstantinos

Abstract | Document (593 KB) | BibTeX

Internalizing Relational Parametricity in the Extensional Calculus of Constructions

Authors: Krishnaswami, Neelakantan R. ; Dreyer, Derek

Abstract | Document (578 KB) | BibTeX

Modal Logic and Distributed Message Passing Automata

Authors: Kuusisto, Antti

Abstract | Document (396 KB) | BibTeX

Global semantic typing for inductive and coinductive computing

Authors: Leivant, Daniel

Abstract | Document (496 KB) | BibTeX

Two-Variable Logic on 2-Dimensional Structures

Authors: Manuel, Amaldev ; Zeume, Thomas

Abstract | Document (591 KB) | BibTeX

Categorical Duality Theory: With Applications to Domains, Convexity, and the Distribution Monad

Authors: Maruyama, Yoshihiro

Abstract | Document (512 KB) | BibTeX

Axiomatizing Subtyped Delimited Continuations

Authors: Materzok, Marek

Abstract | Document (546 KB) | BibTeX

On dialogue games and coherent strategies

Authors: Melliès, Paul-André

Abstract | Document (588 KB) | BibTeX

Elementary Modal Logics over Transitive Structures

Authors: Michaliszyn, Jakub ; Otop, Jan

Abstract | Document (444 KB) | BibTeX

A Fully Abstract Game Semantics for Parallelism with Non-Blocking Synchronization on Shared Variables

Authors: Nishimura, Susumu

Abstract | Document (702 KB) | BibTeX

Extracting Herbrand trees in classical realizability using forcing

Authors: Rieg, Lionel

Abstract | Document (574 KB) | BibTeX

The Complexity of Abduction for Equality Constraint Languages

Authors: Schmidt, Johannes ; Wrona, Michał

Abstract | Document (556 KB) | BibTeX

A New Type Assignment for Strongly Normalizable Terms

Authors: Statman, Rick

Abstract | Document (325 KB) | BibTeX

Semantics of Intensional Type Theory extended with Decidable Equational Theories

Authors: Wang, Qian ; Barras, Bruno

Abstract | Document (502 KB) | BibTeX

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI

Computer Science Logic 2013 (CSL 2013)