|
|
|
|
| LEADER |
00000cam a2200000 i 4500 |
| 001 |
SCIDIR_ocn571414414 |
| 003 |
OCoLC |
| 005 |
20231117033005.0 |
| 006 |
m o d |
| 007 |
cr bn||||||abp |
| 007 |
cr bn||||||ada |
| 008 |
100325s1979 nyu ob 001 0 eng d |
| 040 |
|
|
|a OCLCE
|b eng
|e rda
|e pn
|c OCLCE
|d OCLCQ
|d OCLCF
|d OCLCO
|d OPELS
|d EBLCP
|d CDX
|d IDEBK
|d N$T
|d YDXCP
|d DEBSZ
|d OCLCQ
|d OCLCO
|d OCLCQ
|d MERUC
|d OCLCQ
|d DEBBG
|d OCLCQ
|d OCLCO
|d OCLCQ
|d OCLCO
|d OCLCQ
|d OCLCO
|d UKAHL
|d VLY
|d LUN
|d OCLCQ
|d INARC
|d OCLCQ
|d OCLCO
|d HNC
|d OCLCQ
|d OCLCO
|
| 019 |
|
|
|a 897646576
|a 974615609
|a 974671205
|a 1100940921
|a 1162042431
|a 1255745804
|
| 020 |
|
|
|a 9780121229504
|q (electronic bk.)
|
| 020 |
|
|
|a 0121229505
|q (electronic bk.)
|
| 020 |
|
|
|a 9781483277882
|
| 020 |
|
|
|a 1483277887
|
| 020 |
|
|
|a 9781322470108
|
| 020 |
|
|
|a 1322470103
|
| 035 |
|
|
|a (OCoLC)571414414
|z (OCoLC)897646576
|z (OCoLC)974615609
|z (OCoLC)974671205
|z (OCoLC)1100940921
|z (OCoLC)1162042431
|z (OCoLC)1255745804
|
| 042 |
|
|
|a dlr
|
| 050 |
|
4 |
|a QA76.9.A96
|b B68 1979eb
|
| 072 |
|
7 |
|a MAT
|x 000000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 519.4
|
| 082 |
0 |
4 |
|a 001.53/5
|2 18
|
| 084 |
|
|
|a 31.10
|2 bcl
|
| 100 |
1 |
|
|a Boyer, Robert S.
|
| 245 |
1 |
2 |
|a A computational logic /
|c Robert S. Boyer and J Strother Moore.
|
| 264 |
|
1 |
|a New York :
|b Academic Press,
|c �1979.
|
| 300 |
|
|
|a 1 online resource (xiv, 397 pages)
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 490 |
1 |
|
|a ACM monograph series
|
| 504 |
|
|
|a Includes bibliographical references (pages 385-387) and index.
|
| 506 |
|
|
|3 Use copy
|f Restrictions unspecified
|2 star
|5 MiAaHDL
|
| 533 |
|
|
|a Electronic reproduction.
|b [Place of publication not identified] :
|c HathiTrust Digital Library,
|d 2010.
|5 MiAaHDL
|
| 538 |
|
|
|a Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
|u http://purl.oclc.org/DLF/benchrepro0212
|5 MiAaHDL
|
| 583 |
1 |
|
|a digitized
|c 2010
|h HathiTrust Digital Library
|l committed to preserve
|2 pda
|5 MiAaHDL
|
| 588 |
0 |
|
|a Print version record.
|
| 505 |
0 |
|
|a Front Cover; A Computational Logic; Copyright Page; Dedication; Table of Contents; Preface; Chapter 1. Introduction; A. Motivation; B. Our Formal Theory; C. Proof Techniques; D. Examples; E. Our Mechanical Theorem-Prover; F. Artificial Intelligence or Logic?; G. Organization; Chapter 2. A Sketch of the Theory and Two Simple Examples; A. An Informal Sketch of the Theory; B.A Simple Inductive Proof; C.A More Difficult Problem; D.A More Difficult Proof; E. Summary; F. Notes; Chapter 3. A Precise Definition of the Theory; A. Syntax; B. The Theory of IF and EQUAL; C. Well-Founded Relations
|
| 505 |
8 |
|
|a D. InductionE. Shells; F. Natural Numbers; G. Literal Atoms; H. Ordered Pairs; I. Definitions; J. Lexicographic Relations; K. LESSP and COUNT; L. Conclusion; Chapter 4. The Correctness of a Tautology-Checker; A. Informal Development; B. Formal Specification of the Problem; C. The Former Definition of TAUTOLOGY. CHECKER; D. The Mechanical Proofs; E. Summary; F. Notes; Chapter 5. An Overview of How We Prove Theorems; A. The Role of the User; B. Clausal Representation of Conjectures; C. The Organization of Our Heuristics; D. The Organization of Our Presentation
|
| 505 |
8 |
|
|a Chapter 6. Using Type Information to Simplify FormulasA. Type Sets; B. Assuming Expressions True or False; C. Computing Type Sets; D. Type Prescriptions; E. Summary; F. Notes; Chapter 7. Using Axioms and Lemmas as Rewrite Rules; A. Directed Equalities; B. Infinite Looping; C. More General Rewrite Rules; D. An Example of Using Rewrite Rules; E. Infinite Backwards Chaining; F. Free Variables in Hypotheses; Chapter 8. Using Definitions; A. Nonrecursive Functions; B. Computing Values; C. Diving in to See; Chapter 9. Rewriting Terms and Simplifying Clauses; A. Rewriting Terms
|
| 505 |
8 |
|
|a B. Simplifying ClausesC. The REVERSE Example; D. Simplification in the REVERSE Example; Chapter 10. Eliminating Destructors; A. Trading Bad Terms for Good Terms; B. The Form of Elimination Lemmas; C. The Precise Use of Elimination Lemmas; D.A Nontrivial Example; E. Multiple Destructors and Infinite Looping; F. When Elimination Is Risky; G. Destructor Elimination in the REVERSE Example; Chapter 11. Using Equalities; A. Using and Throwing Away Equalities; B. Cross-Fertilization; C.A Simple Example of Cross-Fertilization; D. The Precise Use of Equalities
|
| 505 |
8 |
|
|a E. Cross-Fertilization in the REVERSE ExampleChapter 12. Generalization; A.A Simple Generalization Heuristic; B. Restricting Generalizations; C. Examples of Generalizations; D. The Precise Statement of the Generalization Heuristic; E. Generalization in the REVERSE Example; Chapter 13. Eliminating Irrelevance; A. Two Simple Checks for Irrelevance; B. The Reason for Eliminating Isolated Hypotheses; C. Elimination of Irrelevance in the REVERSE Example; Chapter 14. Induction and the Analysis of Recursive Definitions; A. Satisfying the Principle of Definition
|
| 546 |
|
|
|a English.
|
| 650 |
|
0 |
|a Automatic theorem proving.
|
| 650 |
|
6 |
|a Th�eor�emes
|x D�emonstration automatique.
|0 (CaQQLa)201-0031979
|
| 650 |
|
7 |
|a MATHEMATICS
|x General.
|2 bisacsh
|
| 650 |
|
7 |
|a Automatic theorem proving
|2 fast
|0 (OCoLC)fst00822777
|
| 700 |
1 |
|
|a Moore, J Strother,
|d 1947-
|e author.
|
| 776 |
0 |
8 |
|i Print version:
|a Boyer, Robert S.
|t Computational logic.
|d New York : Academic Press, �1979
|w (DLC) 79051693
|w (OCoLC)5196669
|
| 830 |
|
0 |
|a ACM monograph series.
|
| 856 |
4 |
0 |
|u https://sciencedirect.uam.elogim.com/science/book/9780121229504
|z Texto completo
|
