Logical Foundations of Computer Science: International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009, Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
Used and New from Other Sellers
Used and New from Other Sellers
from $55.56
Usually ships in 1-2 business days
(Save 56%)
Other sellers (Paperback)
  • All (12) from $55.56   
  • New (10) from $55.56   
  • Used (2) from $128.99   


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 prool 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.

Read More Show Less

Product Details

Table of Contents

Applications of Finite Duality to Locally Finite Varieties of BL-Algebras.- Completeness Results for Memory Logics.- Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination.- Temporalization of Probabilistic Propositional Logic.- Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings.- The Logic of Proofs as a Foundation for Certifying Mobile Computation.- ATL with Strategy Contexts and Bounded Memory.- A Relational Model of a Parallel and Non-deterministic—-Calculus.- The NP-Completeness of Reflected Fragments of Justification Logics.- Taming Modal Impredicativity: Superlazy Reduction.- Positive Fork Graph Calculus.- Games on Strings with a Limited Order Relation.- Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees.- Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic.- A Clausal Approach to Proof Analysis in Second-Order Logic.- Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics.- Light Linear Logic with Controlled Weakening.- Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm.- Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System.- Tableaux and Hypersequents for Justification Logic.- Topological Forcing Semantics with Settling.- Automata and Answer Set Programming.- A Labeled Natural Deduction System for a Fragment of CTL *.- Conservativity for Logics of Justified Belief.- Unifying Sets and Programs via Dependent Types.- Product-Free Lambek Calculus Is NP-Complete.- Games on Multi-stack Pushdown Systems.- Data Privacy for Knowledge Bases.- Fixed Point Theorems on Partial Randomness.- Decidability and Undecidability in Probability Logic.- A Bialgebraic Approach to Automata and Formal Language Theory.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)