| Description |
1 online resource (xiii, 151 pages) : illustrations |
| Series |
Synthesis lectures on computer science, 1932-1686 ; #5 |
|
Synthesis lectures on computer science ; #5. 1932-1228
|
| Contents |
Preface -- 1. Introduction -- 1.1 Logic -- 1.2 Elements of logic -- 1.3 Formalization -- 1.4 Automation -- 1.5 Reading guide |
|
10. First order logic -- 10.1 Introduction -- 10.2 Conceptualization -- 10.3 Syntax and semantics -- 10.4 Blocksworld -- 10.5 Arithmetic -- 10.6 Properties of sentences -- 10.7 Logical entailment -- 10.8 Proofs -- 10.9 Examples: equality -- 10.10 Example: blocksworld -- 10.11 Example: arithmetic -- 10.12 Soundness and completeness -- 10.13 Herbrand logic versus first order logic |
|
2. Propositional logic -- 2.1 Introduction -- 2.2 Syntax -- 2.3 Semantics -- 2.4 Satisfaction -- 2.5 Logical properties of propositional sentences -- 2.6 Propositional entailment |
|
3. Propositional proofs -- 3.1 Introduction -- 3.2 Linear proofs -- 3.3 Structured proofs -- 3.4 Fitch -- 3.5 Soundness and completeness |
|
4. Propositional resolution -- 4.1 Introduction -- 4.2 Clausal form -- 4.3 Resolution principle -- 4.4 Resolution reasoning |
|
5. Satisfiability -- 5.1 Introduction -- 5.2 Truth table method -- 5.3 Basic backtracking search -- 5.4 Simplification and unit propagation -- 5.5 DPLL -- 5.6 GSAT |
|
6. Herbrand logic -- 6.1 Introduction -- 6.2 Syntax -- 6.3 Semantics -- 6.4 Example: Sorority world -- 6.5 Example: Blocks world -- 6.6 Example: Modular arithmetic -- 6.7 Example: Peano arithmetic -- 6.8 Example: Linked lists -- 6.9 Example: Pseudo English -- 6.10 Example: Metalevel logic -- 6.11 Properties of sentences in Herbrand logic -- 6.12 Logical entailment -- 6.13 Finite Herbrand logic -- 6.14 Omega Herbrand logic -- 6.15 General Herbrand logic |
|
7. Herbrand logic proofs -- 7.1 Introduction -- 7.2 Proofs -- 7.3 Example -- 7.4 Example -- 7.5 Example |
|
8. Resolution -- 8.1 Introduction -- 8.2 Clausal form -- 8.3 Unification -- 8.4 Resolution principle -- 8.5 Resolution reasoning -- 8.6 Unsatisfiability -- 8.7 Logical entailment -- 8.8 Answer extraction -- 8.9 Strategies |
|
9. Induction -- 9.1 Introduction -- 9.2 Finite induction -- 9.3 Linear induction -- 9.4 Tree induction -- 9.5 Structural induction |
|
A. Summary of Fitch rules -- Bibliography -- Authors' biographies |
| Summary |
This book is a gentle but rigorous introduction to formal logic. It is intended primarily for use at the college level. However, it can also be used for advanced secondary school students, and it can be used at the start of graduate school for those who have not yet seen the material. The approach to teaching logic used here emerged from more than 20 years of teaching logic to students at Stanford University and from teaching logic to tens of thousands of others via online courses on the World Wide Web. The approach differs from that taken by other books in logic in two essential ways, one having to do with content, the other with form. Like many other books on logic, this one covers logical syntax and semantics and proof theory plus induction. However, unlike other books, this book begins with Herbrand semantics rather than the more traditional Tarskian semantics. This approach makes the material considerably easier for students to understand and leaves them with a deeper understanding of what logic is all about |
| Analysis |
Herbrand logic |
|
artificial intelligence |
|
deduction |
|
first-order logic |
|
formal logic |
|
propositional logic |
|
reasoning |
|
symbolic logic |
| Notes |
Part of: Synthesis digital library of engineering and computer science |
|
Series from website |
| Bibliography |
Includes bibliographical references (page 149) |
| Notes |
Online resource; title from PDF title page (Morgan & Claypool, viewed on February 17, 2013) |
| Subject |
Logic.
|
| Form |
Electronic book
|
| Author |
Kao, Eric.
|
| ISBN |
1627050051 |
|
162705006X (electronic bk.) |
|
9781627050050 |
|
9781627050067 (electronic bk.) |
|
(paperback) |
|
