Items related to Logic for Applications (Texts and Monographs in Computer...
Synopsis
This is a rigorous introduction to classical and nonclassical logic, which emphasizes deduction as a form of computation. It can be used to teach classical, modal and intuitistic predicate logic. It also presents the logical and mathematical foundations for resolution theorem proving and logic programming. A distinctive feature of the book is its uniform mathematical treatment of logic, based on the tableau method of classical logic, which includes soundness, completeness, compactness, incompleteness and the theorems of Herb Rand and Skolem Wenheim. The same uniform treatment is used for important areas of application in computer science and artificial intelligence. These include resolution theorem proving, logic programming and PROLOG, predicate intuitionistic logic, and predicate modal logic. There is also an historical appendix and an extensive list of selected references so that both the background and more advanced developments of these subjects can be pursued.
"synopsis" may belong to another edition of this title.
Review
From reviews of the first edition: "... must surely rank as one of the most fruitful textbooks introduced into computer science ... We strongly suggest it as a textbook ..." SIGACT News
From the reviews of the second edition:
"...the book achieves its goal of being a unified introduction into classical logic, logic programming and certain non-classical logics. ...the book succeeded in presenting a uniform framework for describing different logics. The author’s thorough approach to describing logic programming, via introduction of resolution-based refutations and subsequent study of different kinds of resolutions allows the reader to gradually switch from the study of logic to the study of logical programming paradigm and provides a lot of intuition about the behavior of logic programs.
As such the book can be recommended both as a textbook for senior/graduate course in logic/logic programming, and as a reading or reference for graduate students in the areas related to discrete mathematics."
(Alexander Dekhtyar, William Gasarch’s Book Review Column, SIGACT News)
From the Back Cover
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.
"About this title" may belong to another edition of this title.
- PublisherSpringer-Verlag Berlin and Heidelberg GmbH & Co. K
- Publication date1993
- ISBN 10 3540941290
- ISBN 13 9783540941293
- BindingHardcover
- LanguageEnglish
- Number of pages382
(No Available Copies)
Search Books: Create a WantCan't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!
Create a Want
