Logic for Applications

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.