First-Order Logic and Automated Theorem Proving (Texts in Computer Science)
| Author | : | |
| Rating | : | 4.33 (969 Votes) |
| Asin | : | 0387945938 |
| Format Type | : | paperback |
| Number of Pages | : | 326 Pages |
| Publish Date | : | 2015-07-07 |
| Language | : | English |
DESCRIPTION:
The first item to be addressed is, What are we talking about and why are we interested in it? We are primarily talking about truth as used in mathematical discourse, and our interest in it is, or should be, self evident. It does contain a thorough presentation of formal logic and many proof techniques, and as such it contains all the material one would expect to find in a course in formal logic covering completeness but, not incompleteness issues. Although there is a common core to all such books, they will be very different in emphasis, methods, and even appearance. Truth is a semantic concept, so we begin with models and their properties. Within computer science formal logic turns up in a number of areas, from pro gram verification to logic programming to artificial intelligence. There are many kinds of books on formal logic. These are used to define our subject.. This book is intended for computer scientists. This book is intended for computer scientists interested in automated theo rem proving in classical logic. But even this is not precise. This does not mean, of course, that the book will be of no interest to philosophers or mathematicians. To be more precise yet, it is essentially a theoretical treatment, not a how-to book, although how-to issues are not neglected. Some have philosophers as their intended audience, some mathematicians, some computer scien tists