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.
