default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCSL 2015: Berlin, Germany
- Stephan Kreutzer:
24th EACSL Annual Conference on Computer Science Logic, CSL 2015, September 7-10, 2015, Berlin, Germany. LIPIcs 41, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-90-3 - Front Matter, Table of Contents, Preface, Conference Organisation, External Reviewers. i-xiv
- Anuj Dawar
, Dexter Kozen, Simona Ronchi Della Rocca:
The Ackermann Award 2015. xv-xviii - Martín Abadi:
The Prophecy of Timely Rollback (Invited Talk). 1-1 - Claudia Carapelle, Markus Lohrey:
Temporal Logics with Local Constraints (Invited Talk). 2-13 - R. Ryan Williams:
Thinking Algorithmically About Impossibility (Invited Talk). 14-23 - Damiano Mazza:
Simple Parsimonious Types and Logarithmic Space. 24-40 - Simone Bova, Barnaby Martin:
First-Order Queries on Finite Abelian Groups. 41-59 - Anuj Dawar, Pengming Wang:
A Definability Dichotomy for Finite Valued CSPs. 60-77 - Sjoerd Cranen, Bas Luttik, Tim A. C. Willemse:
Evidence for Fixpoint Logic. 78-93 - Matthias Baaz, Christian G. Fermüller:
Elementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic Logic. 94-109 - Stefan Hetzl, Sebastian Zivota:
Tree Grammars for the Elimination of Non-prenex Cuts. 110-127 - Aleksy Schubert, Wil Dekkers, Hendrik Pieter Barendregt:
Automata Theoretic Account of Proof Search. 128-143 - Filip Mazowiecki, Cristian Riveros:
Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata. 144-159 - Olivier Carton, Luc Dartois:
Aperiodic Two-way Transducers and FO-Transductions. 160-174 - Orna Kupferman, Gal Vardi:
On Relative and Probabilistic Finite Counterability. 175-192 - Alberto Molinari, Angelo Montanari, Adriano Peron:
A Model Checking Procedure for Interval Temporal Logics based on Track Representatives. 193-210 - Samson Abramsky, Rui Soares Barbosa, Kohei Kishida, Raymond Lal, Shane Mansfield:
Contextuality, Cohomology and Paradox. 211-228 - Sylvain Salvati, Igor Walukiewicz:
A Model for Behavioural Properties of Higher-order Programs. 229-243 - Lorenzo Clemente, Slawomir Lasota:
Reachability Analysis of First-order Definable Pushdown Systems. 244-259 - Charles Grellois, Paul-André Melliès:
Relational Semantics of Linear Logic and Higher-order Model Checking. 260-276 - Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer:
A Van Benthem Theorem for Modal Team Semantics. 277-291 - Katsuhiko Sano, Jonni Virtema:
Axiomatizing Propositional Dependence Logics. 292-307 - Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
Static Analysis for Logic-based Dynamic Programs. 308-324 - James Brotherston, Jules Villard:
Sub-classical Boolean Bunched Logics and the Meaning of Par. 325-342 - Stefano Berardi:
Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness. 343-358 - Paolo Capriotti, Nicolai Kraus, Andrea Vezzosi:
Functions out of Higher Truncations. 359-373 - Murdoch James Gabbay, Dan R. Ghica, Daniela Petrisan:
Leaving the Nest: Nominal Techniques for Variables with Interleaving Scopes. 374-389 - Erich Grädel, Wied Pakusa:
Rank Logic is Dead, Long Live Rank Logic!. 390-404 - Adrià Gascón, Manfred Schmidt-Schauß, Ashish Tiwari:
Two-Restricted One Context Unification is in Polynomial Time. 405-422 - Jiaxiang Liu, Jean-Pierre Jouannaud, Mizuhito Ogawa:
Confluence of Layered Rewrite Systems. 423-440 - Lukasz Kaiser, Martin Lang, Simon Leßenich, Christof Löding:
A Unified Approach to Boundedness Properties in MSO. 441-456 - Karoliina Lehtinen, Sandra Quickert:
Deciding the First Levels of the Modal mu Alternation Hierarchy by Formula Construction. 457-471 - Dietrich Kuske, Jiamou Liu, Anastasia Moskvina:
Infinite and Bi-infinite Words with Decidable Monadic Theories. 472-486 - Dmitriy Traytel:
A Coalgebraic Decision Procedure for WS1S. 487-503 - Thomas Brihaye, Véronique Bruyère, Noémie Meunier, Jean-François Raskin:
Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability. 504-518 - Felix Klein, Martin Zimmermann:
What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead. 519-533 - Jacques Duparc, Kevin Fournier, Szczepan Hummel:
On Unambiguous Regular Tree Languages of Index (0, 2). 534-548 - David Baelde, Amina Doumane, Alexis Saurin:
Least and Greatest Fixed Points in Ludics. 549-566 - Flavien Breuvart, Michele Pagani:
Modelling Coeffects in the Relational Semantics of Linear Logic. 567-581 - Shahin Amini, Thomas Erhard:
On Classical PCF, Linear Logic and the MIX Rule. 582-596 - Emanuel Kieronski, Antti Kuusisto:
Uniform One-Dimensional Fragments with One Equivalence Relation. 597-615 - Charles Paperman:
Finite-Degree Predicates and Two-Variable First-Order Logic. 616-630 - Witold Charatonik, Piotr Witkowski:
Two-variable Logic with Counting and a Linear Order. 631-647 - Fabio Mogavero, Giuseppe Perelli:
Binding Forms in First-Order Logic. 648-665
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-03-10 20:56 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:
