default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th CSL 2012: Fontainebleau, France
- Patrick Cégielski, Arnaud Durand:
Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France. LIPIcs 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2012, ISBN 978-3-939897-42-2 - Frontmatter, Table of Contents, Preface, Conference Organization.
- Thorsten Altenkirch
, Ondrej Rypacek:
A Syntactical Approach to Weak omega-Groupoids. 16-30 - Thierry Coquand, Anuj Dawar, Damian Niwinski:
The Ackermann Award 2012. 1-5 - Serge Abiteboul:
Sharing Distributed Knowledge on the Web (Invited Talk). 6-8 - Stephen A. Cook:
Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk). 9-11 - Inês Lynce:
Satisfiability: where Theory meets Practice (Invited Talk). 12-13 - Johann A. Makowsky:
Definability and Complexity of Graph Parameters (Invited Talk). 14-15 - Federico Aschieri:
Interactive Realizability for Classical Peano Arithmetic with Skolem Axioms. 31-45 - Robert Atkey:
Relational Parametricity for Higher Kinds. 46-61 - Patrick Baillot, Ugo Dal Lago:
Higher-Order Interpretations and Program Complexity. 62-76 - Stefano Berardi, Ugo de'Liguoro:
Knowledge Spaces and the Completeness of Learning Strategies. 77-91 - Nathalie Bertrand, John Fearnley, Sven Schewe:
Bounded Satisfiability for PCTL. 92-106 - Lars Birkedal, Filip Sieczkowski, Jacob Thamsborg:
A Concurrent Logical Relation. 107-121 - Manuel Bodirsky, Michal Wrona:
Equivalence Constraint Satisfaction Problems. 122-136 - Johann Brault-Baron:
A Negative Conjunctive Query is Easy if and only if it is Beta-Acyclic. 137-151 - Alberto Carraro, Antonino Salibra:
On the equational consistency of order-theoretic models of the lambda-calculus. 152-166 - Krishnendu Chatterjee, Siddhesh Chaubal, Pritish Kamath:
Faster Algorithms for Alternating Refinement Relations. 167-182 - Kaustuv Chaudhuri, Stefan Hetzl, Dale Miller:
A Systematic Approach to Canonicity in the Classical Sequent Calculus. 183-197 - Jacek Chrzaszcz, Aleksy Schubert:
ML with PTIME complexity guarantees. 198-212 - Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa:
Definability of linear equation systems over groups and rings. 213-227 - Henry DeYoung, Luís Caires, Frank Pfenning, Bernardo Toninho:
Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication. 228-242 - Boris Düdder, Moritz Martens, Jakob Rehof, Pawel Urzyczyn:
Bounded Combinatory Logic. 243-258 - Thomas Ehrhard:
Collapsing non-idempotent intersection types. 259-273 - Etienne Grandjean, Frédéric Olive:
Descriptive complexity for pictures languages. 274-288 - Martin Grohe, Martin Otto:
Pebble Games and Linear Equations. 289-304 - Erich Grädel, Simon Leßenich:
Banach-Mazur Games with Simple Winning Strategies. 305-319 - Stefan Hetzl, Lutz Straßburger:
Herbrand-Confluence for Cut Elimination in Classical First Order Logic. 320-334 - Takanori Hida:
A Computational Interpretation of the Axiom of Determinacy in Arithmetic. 335-349 - Jean-Pierre Jouannaud, Jianqi Li:
Church-Rosser Properties of Normal Rewriting. 350-365 - Lukasz Kaiser, Simon Leßenich:
A Counting Logic for Structure Transition Systems. 366-380 - Chantal Keller, Marc Lasson:
Parametricity in an Impredicative Sort. 381-395 - Emanuel Kieronski, Jakub Michaliszyn:
Two-Variable Universal Logic with Transitive Closure. 396-410 - Tomer Kotek, Johann A. Makowsky:
Connection Matrices and the Definability of Graph Parameters. 411-425 - Manfred Kufleitner, Pascal Weil:
The FO2 alternation hierarchy is decidable. 426-439 - Satoru Kuroda:
Axiomatizing proof tree concepts in Bounded Arithmetic. 440-454 - Dietrich Kuske:
Isomorphisms of scattered automatic linear orders. 455-469 - Antti Kuusisto, Jeremy Meyers, Jonni Virtema:
Undecidable First-Order Theories of Affine Geometries. 470-484 - Alexander Leitsch, Giselle Reis, Bruno Woltzenlogel Paleo:
Towards CERes in intuitionistic logic. 485-499 - Pawel Parys:
Variants of Collapsible Pushdown Systems. 500-515 - Alexander Rabinovich:
A Proof of Kamp's theorem. 516-527 - Zhilin Wu:
Commutative Data Automata. 528-542
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-01-22 20:18 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:
