Logic for applications
2nd ed.
Our rough guess is there are 114,000 words in this book.
At a pace averaging 250 words per minute, this book will take 7 hours and 36 minutes to read. With a half hour per day, this will take 15 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
We earn a commission on purchases
Author
Contributions
- Shore, Richard A., 1946- - Contributor
Publication
1997 - Springer, New York, New York (State)
Language
English
Word Count
114,000 words, Guess
Page Count
456 pages
Identifiers
- Open LibraryOL1003621M
- ISBN-100387948937
- OCLC Control Number35397903
- OCLC Control Numberlogicforapplicat0000nero
- Library of Congress Control Number96043297
and 2 more
- LibraryThing2004827
- Goodreads4190100
Classifications
- DDC005.1/01/5113
- LCCQA76.9.M35 N47 1997
Description
Logic for Applications presents a rigorous introduction to classical, intuitionistic, and modal logic. The book emphasizes deduction as a form of computation by examining the logical and mathematical foundations of resolution theorem proving and logic programming. These subjects are important for many areas of applications in computer science and artificial intelligence. Topics covered include soundness, completeness, and undecidability for classical, nonclassical, and computation-based logical systems as well as compactness and the theorems of Herbrand and Skolem-Lowenheim. In context of PROLOG, termination conditions, negation as failure, and the relations to nonmonotonic logic are all discussed . This book is an ideal textbook for presenting classical and non-classical logic as well as logic programming to advanced undergraduate or beginning graduate students in computer science or mathematics. It contains a historical appendix and an extensive list of references for further studies in the field. No advanced mathematical background is required.
Description
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.
Subjects
Series Statement
- Graduate texts in computer science
Other Editions
- Logic for applications
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!