| Logic for Applications 1997 Edition Contributor(s): Nerode, Anil (Author), Shore, Richard A. (Author) |
|
 |
ISBN: 0387948937 ISBN-13: 9780387948935 Publisher: Springer OUR PRICE: $151.99 Product Type: Hardcover Published: January 1997 Annotation: This textbook provides a first introduction to mathematical logic which is closely attuned to the applications of logic in computer science. In it the authors emphasize the notion that deduction is a form of computation. While all the traditional subjects of logic are covered thoroughly - syntax, semantics, completeness, and compactness - much of the book deals with less traditional topics such as resolution theorem proving, logic programming, and non-classical logics - modal and intuitionistic - which are becoming increasingly important in computer science. The book also provides a systematic treatment of the elements of set theory, a historical overview of its subjects, and an extensive annotated bibliography. No previous exposure to logic is assumed, and so this will be suitable for upper level undergraduate or beginning graduate students in computer science or mathematics. |
| Additional Information |
| BISAC Categories: - Computers | Logic Design - Computers | Programming - General - Computers | Programming Languages - General |
| Dewey: 005.101 |
| LCCN: 96043297 |
| Series: Graduate Texts in Computer Science |
| Physical Information: 1.3" H x 6.6" W x 9.4" (1.80 lbs) 456 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: In writing this book, our goal was to produce a text suitable for a first course in mathematical logic more attuned than the traditional textbooks to the re- cent dramatic growth in the applications oflogic to computer science. Thus, our choice oftopics has been heavily influenced by such applications. Of course, we cover the basic traditional topics: syntax, semantics, soundnes5, completeness and compactness as well as a few more advanced results such as the theorems of Skolem-Lowenheim and Herbrand. Much ofour book, however, deals with other less traditional topics. Resolution theorem proving plays a major role in our treatment of logic especially in its application to Logic Programming and PRO- LOG. We deal extensively with the mathematical foundations ofall three ofthese subjects. In addition, we include two chapters on nonclassical logics - modal and intuitionistic - that are becoming increasingly important in computer sci- ence. We develop the basic material on the syntax and semantics (via Kripke frames) for each of these logics. In both cases, our approach to formal proofs, soundness and completeness uses modifications of the same tableau method in- troduced for classical logic. We indicate how it can easily be adapted to various other special types of modal logics. A number of more advanced topics (includ- ing nonmonotonic logic) are also briefly introduced both in the nonclassical logic chapters and in the material on Logic Programming and PROLOG. |