| Anil Nerode 康奈大学数学系的创始人和教授，于1956年在芝加哥大学获得博士学位。他的研究领域包括数理逻辑、自动机、可计算理论、混合系统等。除本书外，他还与其他人合著了《Effective Completeness Theorems for Modal Logic》、《Tableaux for Constructive Concurrent Dynamic Logic》、《Logic，Categories，Lambda Calculus》等书。 |
| Preface Introduction Ⅰ Propositional Logic 1 Orders and Trees 2 Propositions, Connectives and Truth Tables 3 Truth Assignments and Valuations 4 Tableau Proofs in Propositional Calculus 5 Soundness and Completeness of Tableau Proofs 6 Deductions form Premises and Compactness 7 An Axiomatic Approach* 8 Resolution 9 Eefining Resolution 10 Linear Resolution, Horn Clauses and PROLOG Ⅱ Predicate Logic 1 Predicates and Quantifiers 2 The Language: Terms and Formulas 3 Formation Trees, Structures and Lists 4 Semantics: Meaning and Truth 5 Interpretations of PROLOG Programs 6 Proofs: Complete SDystematic Tableaux 7 Soundness and Completeness of Tableau Proofs 8 An Axiomatic Approach* 9 Prenex Normal Form and Skolemization 10 Herbrand's Theorem 11 Unification 12 The Unification Algorithm 13 Resolution 14 Refining Resolution: Linear Resolution Ⅲ PROLOG 1 SLD-Resolution 2 Implementations: Searching and Backtracking 3 Controlling the Implementation: Cut 4 Termination Conditions for PROLOG Programs 5 Equality 6 Negation as Failure 7 Negation and Nonmonotonic Logic 8 Computability and Undecidability Ⅳ Modal Logic …… Ⅴ Intuitionistic Logic Ⅵ Elements of Set Theory Appendix A: An Historical Overview Appendix B: A Genealogical Database Bibliography Indes of Symbols Indes of Terms |
内容加载中，请稍后...
商品评论（0条）