Overview
- Authors:
-
-
Anil Nerode
-
Department of Mathematics, Cornell University, Ithaca, USA
-
Richard A. Shore
-
Department of Mathematics, Cornell University, Ithaca, USA
Access this book
Other ways to access
Table of contents (5 chapters)
-
Front Matter
Pages i-xvii
-
- Anil Nerode, Richard A. Shore
Pages 1-71
-
- Anil Nerode, Richard A. Shore
Pages 73-144
-
- Anil Nerode, Richard A. Shore
Pages 145-206
-
- Anil Nerode, Richard A. Shore
Pages 207-245
-
- Anil Nerode, Richard A. Shore
Pages 247-294
-
Back Matter
Pages 295-370
About this book
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 recent dramatic growth in the applications of logic to computer science. Thus our choice of topics has been heavily influenced by such applications. Of course, we cover the basic traditional topics - syntax, semantics, soundness, completeness and compactness - as well as a few more advanced results such as the theorems of Skolem-Lowenheim and Herbrand. Much of our 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 PROLOG. We deal extensively with the mathematical foundations of all three of these subjects. In addition, we include two chapters on nonclassical logic- modal and intuitionistic - that are becoming increasingly important in computer science. We develop the basic material on the syntax and se mantics (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 introduced for classical logic. We indicate how it can easily be adapted to various other special types of modal log ics. A number of more advanced topics (including nonmonotonic logic) are also briefly introduced both in the nonclassical logic chapters and in the material on Logic Programming and PROLOG.
