A Computational Logic
eBook - PDF

A Computational Logic

  1. 414 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

A Computational Logic

About this book

ACM Monograph Series: A Computational Logic focuses on the use of induction in proving theorems, including the use of lemmas and axioms, free variables, equalities, and generalization. The publication first elaborates on a sketch of the theory and two simple examples, a precise definition of the theory, and correctness of a tautology-checker. Topics include mechanical proofs, informal development, formal specification of the problem, well-founded relations, natural numbers, and literal atoms. The book then examines the use of type information to simplify formulas, use of axioms and lemmas as rewrite rules, and the use of definitions. Topics include nonrecursive functions, computing values, free variables in hypothesis, infinite backwards chaining, infinite looping, computing type sets, and type prescriptions. The manuscript takes a look at rewriting terms and simplifying clauses, eliminating destructors and irrelevance, using equalities, and generalization. Concerns include reasons for eliminating isolated hypotheses, precise statement of the generalization heuristic, restricting generalizations, precise use of equalities, and multiple destructors and infinite looping. The publication is a vital source of data for researchers interested in computational logic.

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
No, books cannot be downloaded as external files, such as PDFs, for use outside of Perlego. However, you can download books within the Perlego app for offline reading on mobile or tablet. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access A Computational Logic by Robert S. Boyer,J Strother Moore, Thomas A. Standish in PDF and/or ePUB format, as well as other popular books in Matematica & Matematica applicata. We have over one million books available in our catalogue for you to explore.

Information

Publisher
Academic Press
Year
2014
Print ISBN
9780121229504
eBook ISBN
9781483277882
Topic
Matematica
Subtopic
Matematica applicata

Table of contents

  1. Front Cover
  2. A Computational Logic
  3. Copyright Page
  4. Table of Contents
  5. Dedication
  6. Preface
  7. Chapter 1. Introduction
  8. Chapter 2. A Sketch of the Theory and Two Simple Examples
  9. Chapter 3. A Precise Definition of the Theory
  10. Chapter 4. The Correctness of a Tautology-Checker
  11. Chapter 5. An Overview of How We Prove Theorems
  12. Chapter 6. Using Type Information to Simplify Formulas
  13. Chapter 7. Using Axioms and Lemmas as Rewrite Rules
  14. Chapter 8. Using Definitions
  15. Chapter 9. Rewriting Terms and Simplifying Clauses
  16. Chapter 10. Eliminating Destructors
  17. Chapter 11. Using Equalities
  18. Chapter 12. Generalization
  19. Chapter 13. Eliminating Irrelevance
  20. Chapter 14. Induction and the Analysis of Recursive Definitions
  21. Chapter 15. Formulating an Induction Scheme for a Conjecture
  22. Chapter 16. Illustrations of Our Techniques via Elementary Number Theory
  23. Chapter 17. The Correctness of a Simple Optimizing Expression Compiler
  24. Chapter 18. The Correctness of a Fast String Searching Algorithm
  25. Chapter 19. The Unique Prime Factorization Theorem
  26. Appendix A: Definitions Accepted and Theorems Proved by Our System
  27. Appendix B: The Implementation of the Shell Principle
  28. Appendix C: Clauses for Our Theory
  29. References
  30. Index