Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st 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 - Luca de Alfaro:
The Symbolic Approach to Repeated Games (Abstract). 3 - Arnold Beckmann:
Proofs, Programs and Abstract Complexity. 4-5 - Anuj Dawar:
Model-Checking First-Order Logic: Automata and Locality. 6 - Orna Kupferman:
Tightening the Exchange Rates Between Automata. 7-22 - Thomas Gawlitza, Helmut Seidl:
Precise Relational Invariants Through Strategy Iteration. 23-40
Logic and Games
- Eryk Kopczynski:
Omega-Regular Half-Positional Winning Conditions. 41-53 - Jan Obdrzálek:
Clique-Width and Parity Games. 54-68 - Alexander Rabinovich, Wolfgang Thomas:
Logical Refinements of Church's Problem. 69-83 - 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 - Olivier Finkel, Dominique Lecomte:
There Exist Some omega -Powers of Any Borel Rank. 115-129
Games and Trees
- Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison:
Satisfiability of a Spatial Logic with Tree Variables. 130-145 - Mikolaj Bojanczyk:
Forest Expressions. 146-160 - Arnaud Carayol, Christof Löding:
MSO on the Infinite Binary Tree: Choice and Order. 161-176
Logic and Deduction
- Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc:
Classical and Intuitionistic Logic Are Asymptotically Identical. 177-193 - Manuel Bodirsky, Hubie Chen:
Qualitative Temporal and Spatial Reasoning Revisited. 194-207 - 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
- Delia Kesner:
The Theory of Calculi with Explicit Substitutions Revisited. 238-252 - 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 - Søren B. Lassen, Paul Blain Levy:
Typed Normal Form Bisimulation. 283-297
Lambda Calculus 2
- Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzonetto:
Not Enough Points Is Enough. 298-312 - Alexandre Miquel:
Classical Program Extraction in the Calculus of Constructions. 313-327 - 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 - Stefan Göller:
On the Complexity of Reasoning About Dynamic Policies. 358-373 - 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 - Naohiko Hoshino:
Linear Realizability. 420-434 - Paulin Jacobé de Naurois, Virgile Mogbil:
Correctness of Multiplicative (and Exponential) Proof Structures is NL -Complete. 435-450 - Chuck C. Liang, Dale Miller:
Focusing and Polarization in Intuitionistic Logic. 451-465
Proof Theory
- Dale Miller, Vivek Nigam:
Incorporating Tables into Proofs. 466-480 - Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro, Fernando Orejas:
A Cut-Free and Invariant-Free Sequent Calculus for PLTL. 481-495 - Guillaume Burel:
Unbounded Proof-Length Speed-Up in Deduction Modulo. 496-511 - Klaus Aehlig, Arnold Beckmann:
Propositional Logic for Circuit Classes. 512-526 - Alexander Hertel, Alasdair Urquhart:
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space. 527-541
Game Semantics
- Jean Goubault-Larrecq:
Continuous Previsions. 542-557 - Andrzej S. Murawski:
Bad Variables Under Control. 558-572 - Guy McCusker, David J. Pym:
A Games Model of Bunched Implications. 573-588 - Martin Grohe, Martin Hyland, Johann A. Makowsky, Damian Niwinski:
The Ackermann Award 2007. 589-597
a service of 
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 2022-12-08 00:57 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 has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
