This monograph on classical logic presents fundamental concepts and results in a rigorous mathematical style. Applications to automated theorem proving are considered and usable programs in Prolog are provided. This material can be used both as a first text in formal logic and as an introduction to
Automated Theorem Proving. A Logical Basis
β Scribed by D. W. Loveland (Auth.)
- Publisher
- Elsevier B.V
- Year
- 1978
- Tongue
- English
- Leaves
- 412
- Series
- Fundamental studies in computer science
- Edition
- First Edition
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Table of Contents
Content:
Fundamental Studies in Computer Science, Page ii
Front Matter, Page iii
Copyright, Page iv
Dedication, Page v
PREFACE, Pages vii-ix
ACKNOWLEDGEMENTS, Page xiii
CHAPTER 1 - THE ROLE OF LOGICAL SYSTEMS, Pages 1-51
CHAPTER 2 - BASIC RESOLUTION, Pages 52-93
CHAPTER 3 - REFINEMENTS OF RESOLUTION, Pages 94-199
CHAPTER 4 - SUBSUMPTION, Pages 200-262
CHAPTER 5 - RESOLUTION WITH EQUALITY, Pages 263-334
CHAPTER 6 - RESOLUTION AND PROBLEM REDUCTION FORMAT, Pages 335-391
APPENDIX - Resolution-based procedures, Pages 392-393
REFERENCES, Pages 395-399
TABLE OF SYMBOLS, Page 400
INDEX, Pages 401-405
π SIMILAR VOLUMES
<p>There are many kinds of books on formal logic. Some have philosophers as their intended audience, some mathematicians, some computer scienΒ tists. Although there is a common core to all such books, they will be very different in emphasis, methods, and even appearance. This book is intended for co
There are many kinds of books on formal logic. Some have philosophers as their intended audience, some mathematicians, some computer scienΒ tists. Although there is a common core to all such books, they will be very different in emphasis, methods, and even appearance. This book is intended for compu