default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLFCS 2009: Deerfield Beach, FL, USA
- Sergei N. Artëmov, Anil Nerode:
Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings. Lecture Notes in Computer Science 5407, Springer 2009, ISBN 978-3-540-92686-3 - Stefano Aguzzoli
, Simone Bova, Vincenzo Marra:
Applications of Finite Duality to Locally Finite Varieties of BL-Algebras. 1-15 - Carlos Areces, Santiago Figueira, Sergio Mera:
Completeness Results for Memory Logics. 16-30 - Arnon Avron, Anna Zamansky:
Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination. 31-45 - Pedro Baltazar, Paulo Mateus:
Temporalization of Probabilistic Propositional Logic. 46-60 - Nicolas Bedon:
Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings. 61-75 - Eduardo Bonelli, Federico Feller:
The Logic of Proofs as a Foundation for Certifying Mobile Computation. 76-91 - Thomas Brihaye, Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey:
ATL with Strategy Contexts and Bounded Memory. 92-106 - Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzonetto:
A Relational Model of a Parallel and Non-deterministic lambda-Calculus. 107-121 - Samuel R. Buss, Roman Kuznets:
The NP-Completeness of Reflected Fragments of Justification Logics. 122-136 - Ugo Dal Lago, Luca Roversi, Luca Vercelli:
Taming Modal Impredicativity: Superlazy Reduction. 137-151 - Renata P. de Freitas, Sheila R. M. Veloso, Paulo A. S. Veloso, Jorge Petrucio Viana:
Positive Fork Graph Calculus. 152-163 - Elisabetta De Maria, Angelo Montanari, Nicola Vitacolonna:
Games on Strings with a Limited Order Relation. 164-179 - Amélie Gheerbrant, Balder ten Cate:
Complete Axiomatizations of MSO, FO(TC1)and FO(LFP1)on Finite Trees. 180-196 - Valentin Goranko, Dmitry Shkatov:
Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic. 197-213 - Stefan Hetzl, Alexander Leitsch, Daniel Weller, Bruno Woltzenlogel Paleo:
A Clausal Approach to Proof Analysis in Second-Order Logic. 214-229 - Rosalie Iemhoff, George Metcalfe:
Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics. 230-245 - Max I. Kanovich:
Light Linear Logic with Controlled Weakening. 246-264 - Uwe Keller, Stijn Heymans:
Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm. 265-279 - Antoine Genitrini, Jakub Kozik:
Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System. 280-294 - Hidenori Kurokawa:
Tableaux and Hypersequents for Justification Logic. 295-308 - Robert S. Lubarsky:
Topological Forcing Semantics with Settling. 309-322 - Victor W. Marek, Jeffrey B. Remmel:
Automata and Answer Set Programming. 323-337 - Andrea Masini, Luca Viganò, Marco Volpe:
A Labeled Natural Deduction System for a Fragment of CTL*. 338-353 - Robert Saxon Milnikel:
Conservativity for Logics of Justified Belief. 354-364 - Wojciech Moczydlowski:
Unifying Sets and Programs via Dependent Types. 365-379 - Yury Savateev:
Product-Free Lambek Calculus Is NP-Complete. 380-394 - Anil Seth:
Games on Multi-stack Pushdown Systems. 395-408 - Phiniki Stouppa, Thomas Studer:
Data Privacy for Knowledge Bases. 409-421 - Kohtaro Tadaki:
Fixed Point Theorems on Partial Randomness. 422-440 - Sebastiaan Terwijn:
Decidability and Undecidability in Probability Logic. 441-450 - James Worthington:
A Bialgebraic Approach to Automata and Formal Language Theory. 451-467
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-11-28 01:46 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:
