9780387948935-0387948937-Logic for Applications (Texts in Computer Science)

Logic for Applications (Texts in Computer Science)

ISBN-13: 9780387948935
ISBN-10: 0387948937
Edition: 2nd
Author: Anil Nerode, Richard A. Shore
Publication date: 1997
Publisher: Springer
Format: Hardcover 469 pages
FREE US shipping
Buy

From $145.24

Book details

ISBN-13: 9780387948935
ISBN-10: 0387948937
Edition: 2nd
Author: Anil Nerode, Richard A. Shore
Publication date: 1997
Publisher: Springer
Format: Hardcover 469 pages

Summary

Logic for Applications (Texts in Computer Science) (ISBN-13: 9780387948935 and ISBN-10: 0387948937), written by authors Anil Nerode, Richard A. Shore, was published by Springer in 1997. With an overall rating of 3.6 stars, it's a notable title among other AI & Machine Learning (Computer Science) books. You can easily purchase or rent Logic for Applications (Texts in Computer Science) (Hardcover) from BooksRun, along with many other new and used AI & Machine Learning books and textbooks. And, if you're looking to sell your copy, our current buyback offer is $0.93.

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.

Rate this book Rate this book

We would LOVE it if you could help us and other readers by reviewing the book