First-Order Logic and Automated Theorem Proving

1. Front Matter

   Pages i-xv

   PDF

2. Background

   • Melvin Fitting

   Pages 1-7

3. Propositional Logic

   • Melvin Fitting

   Pages 8-35

4. Semantic Tableaux and Resolution

   • Melvin Fitting

   Pages 36-69

5. Other Propositional Proof Procedures

   • Melvin Fitting

   Pages 70-96

6. First-Order Logic

   • Melvin Fitting

   Pages 97-125

7. First-Order Proof Procedures

   • Melvin Fitting

   Pages 126-138

8. Implementing Tableaux and Resolution

   • Melvin Fitting

   Pages 139-193

9. Equality

   • Melvin Fitting

   Pages 194-232

10. Back Matter

    Pages 233-244

    PDF

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

• Department of Mathematics and Computer Science Lehman College, City University of New York, Bronx, USA

  Melvin Fitting

Policies and ethics