Skip to main content
  • Conference proceedings
  • © 2009

Logical Foundations of Computer Science

International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009, Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5407)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): LFCS: International Symposium on Logical Foundations of Computer Science

Conference proceedings info: LFCS 2009.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (31 papers)

  1. Front Matter

  2. Applications of Finite Duality to Locally Finite Varieties of BL-Algebras

    • Stefano Aguzzoli, Simone Bova, Vincenzo Marra
    Pages 1-15
  3. Completeness Results for Memory Logics

    • Carlos Areces, Santiago Figueira, Sergio Mera
    Pages 16-30
  4. Temporalization of Probabilistic Propositional Logic

    • Pedro Baltazar, Paulo Mateus
    Pages 46-60
  5. The Logic of Proofs as a Foundation for Certifying Mobile Computation

    • Eduardo Bonelli, Federico Feller
    Pages 76-91
  6. ATL with Strategy Contexts and Bounded Memory

    • Thomas Brihaye, Arnaud Da Costa, François Laroussinie, Nicolas Markey
    Pages 92-106
  7. A Relational Model of a Parallel and Non-deterministic λ-Calculus

    • Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzonetto
    Pages 107-121
  8. The NP-Completeness of Reflected Fragments of Justification Logics

    • Samuel R. Buss, Roman Kuznets
    Pages 122-136
  9. Taming Modal Impredicativity: Superlazy Reduction

    • Ugo Dal Lago, Luca Roversi, Luca Vercelli
    Pages 137-151
  10. Positive Fork Graph Calculus

    • Renata de Freitas, Sheila R. M. Veloso, Paulo A. S. Veloso, Petrucio Viana
    Pages 152-163
  11. Games on Strings with a Limited Order Relation

    • Elisabetta De Maria, Angelo Montanari, Nicola Vitacolonna
    Pages 164-179
  12. Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees

    • Amélie Gheerbrant, Balder ten Cate
    Pages 180-196
  13. A Clausal Approach to Proof Analysis in Second-Order Logic

    • Stefan Hetzl, Alexander Leitsch, Daniel Weller, Bruno Woltzenlogel Paleo
    Pages 214-229
  14. Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm

    • Uwe Keller, Stijn Heymans
    Pages 265-279

Other Volumes

  1. Logical Foundations of Computer Science

About this book

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2009, held in Deerfield Beach, Florida, USA in January 2008. The volume presents 31 revised refereed papers carefully selected by the program committee. All current aspects of logic in computer science are addressed, including constructive mathematics and type theory, logical foundations of programming, logical aspects of computational complexity, logic programming and constraints, automated deduction and interactive theorem proving, logical methods in protocol and program verification and in program specification and extraction, domain theory logics, logical foundations of database theory, equational logic and term rewriting, lambda and combinatory calculi, categorical logic and topological semantics, linear logic, epistemic and temporal logics, intelligent and multiple agent system logics, logics of proof and justification, nonmonotonic reasoning, logic in game theory and social software, logic of hybrid systems, distributed system logics, system design logics, as well as other logics in computer science.

Keywords

  • Automat
  • automated deduction
  • complexity
  • game theory
  • interactive theorem proving
  • logic
  • theorem proving
  • algorithm analysis and problem complexity

Editors and Affiliations

  • Computer Science, CUNY Graduate Center, New York, USA

    Sergei Artemov

  • Department of Mathematics, Cornell University, Ithaca, USA

    Anil Nerode

Bibliographic Information

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions