# First-Order Logic and Automated Theorem Proving

Part of the Texts and Monographs in Computer Science book series (MCS)

Part of the Texts and Monographs in Computer Science book series (MCS)

There are many kinds of books on formal logic. Some have philosophers as their intended audience, some mathematicians, some computer scientists. Although there is a common core to all such books they will be very dif ferent in emphasis, methods, and even appearance. This book is intended for computer scientists. But even this is not precise. Within computer sci ence formal logic turns up in a number of areas, from program verification to logic programming to artificial intelligence. This book is intended for computer scientists interested in automated theorem proving in classical logic. To be more precise yet, it is essentially a theoretical treatment, not a how-to book, although how-to issues are not neglected. This does not mean, of course, that the book will be of no interest to philosophers or mathematicians. 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. 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. Truth is a semantic concept, so we begin with models and their properties. These are used to define our subject.

Prolog Resolution automated theorem proving computer computer science formal logic logic mathematics proof proving theorem proving

- DOI https://doi.org/10.1007/978-1-4684-0357-2
- Copyright Information Springer-Verlag New York 1990
- Publisher Name Springer, New York, NY
- eBook Packages Springer Book Archive
- Print ISBN 978-1-4684-0359-6
- Online ISBN 978-1-4684-0357-2
- Series Print ISSN 0172-603X
- About this book