Google
Google Scholar
MS Academic Search
CiteSeerX
Semantic Scholar21. CSL 2007: Lausanne, Switzerland
Jacques Duparc, Thomas A. Henzinger:
Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings. Lecture Notes in Computer Science 4646, Springer 2007, ISBN 978-3-540-74914-1
Invited Lectures
- Samson Abramsky:
Full Completeness: Interactive and Geometric Characterizations of the Space of Proofs (Abstract). 1-2
Logic and Games
- Anuj Dawar, David Richerby:
The Power of Counting Logics on Restricted Classes of Finite Structures. 84-98
Expressiveness
- Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van Begin:
Comparing the Expressive Power of Well-Structured Transition Systems. 99-114
Games and Trees
- Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison:
Satisfiability of a Spatial Logic with Tree Variables. 130-145
Logic and Deduction
- Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc:
Classical and Intuitionistic Logic Are Asymptotically Identical. 177-193 - Guillaume Bagan, Arnaud Durand, Etienne Grandjean:
On Acyclic Conjunctive Queries and Constant Delay Enumeration. 208-222 - Konstantin Korovin, Andrei Voronkov:
Integrating Linear Arithmetic into Superposition Calculus. 223-237
Lambda Calculus 1
- Marco Gaboardi, Simona Ronchi Della Rocca:
A Soft Type Assignment System for lambda -Calculus. 253-267 - Chantal Berline, Giulio Manzonetto, Antonino Salibra:
Lambda Theories of Effective Lambda Models. 268-282
Lambda Calculus 2
- Frédéric Blanqui, Jean-Pierre Jouannaud, Pierre-Yves Strub:
Building Decision Procedures in the Calculus of Inductive Constructions. 328-342
Finite Model Theory
- Philipp Weis, Neil Immerman:
Structure Theorem and Strict Alternation Hierarchy for FO2 on Words. 343-357 - Klaus Aehlig, Stephen A. Cook, Phuong Nguyen:
Relativizing Small Complexity Classes and Their Theories. 374-388 - Yijia Chen, Jörg Flum:
Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping. 389-404
Linear Logic
- Dale Miller, Alexis Saurin:
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic. 405-419 - Paulin Jacobé de Naurois, Virgile Mogbil:
Correctness of Multiplicative (and Exponential) Proof Structures is NL -Complete. 435-450
Proof Theory
- Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro, Fernando Orejas:
A Cut-Free and Invariant-Free Sequent Calculus for PLTL. 481-495 - Alexander Hertel, Alasdair Urquhart:
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space. 527-541
Game Semantics
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2016-10-01 19:41 CEST by the dblp team