Low Price Guarantee
We Take School POs
Modal Logic
Contributor(s): Blackburn, Patrick (Author), Rijke, Maarten de (Author), Venema, Yde (Author)

View larger image

ISBN: 0521527147     ISBN-13: 9780521527149
Publisher: Cambridge University Press
OUR PRICE: $107.35  

Binding Type: Paperback - See All Available Formats & Editions
Published: September 2002
Qty:

Annotation: This modern, advanced textbook on modal logic is intended both for novices and for more experienced readers. The two distinct tracks through the work are clearly signposted at the start of each chapter. The book assumes a prior acquaintance with first-order logic and its semantics and a familiarity with the basic mathematical notions of set theory. The authors focus on the use of modal languages as tools to analyze the properties of relational structures, including algorithmic and algebraic aspects. Applications to issues in logic and computer science such as completeness, computability and complexity are also considered. The work is a must for anyone interested in modal logic.

Click for more in this series: Cambridge Tracts in Theoretical Computer Science (Paperback)
Additional Information
BISAC Categories:
- Mathematics | Logic
- Computers | Programming Languages - General
- Medical
Dewey: 511.3
Series: Cambridge Tracts in Theoretical Computer Science (Paperback)
Physical Information: 1.2" H x 6.14" W x 8.9" L (1.96 lbs) 578 pages
Features: Bibliography, Illustrated, Index, Table of Contents
 
Descriptions, Reviews, Etc.
Publisher Description:
This modern, advanced textbook reviews modal logic, a field which caught the attention of computer scientists in the late 1970's. The development is mathematical; prior acquaintance with first-order logic and its semantics is assumed, and familiarity with the basic mathematical notions of set theory is required. The authors focus on the use of modal languages as tools to analyze the properties of relational structures, including their algorithmic and algebraic aspects. Applications to issues in logic and computer science such as completeness, computability and complexity are considered.
 
Customer ReviewsSubmit your own review
 
To tell a friend about this book, you must Sign In First!