Mode of access: World Wide Web.

System requirements: Adobe Acrobat Reader.

Part of: Synthesis digital library of engineering and computer science.

Series from website.

Includes bibliographical references (page 161).

1. Introduction -- 1.1 Introduction -- 1.2 Possible worlds -- 1.3 Logical sentences -- 1.4 Logical entailment -- 1.5 Logical proofs -- 1.6 Formalization -- 1.7 Automation -- 1.8 Reading guide -- 1.9 Exercises --

2. Propositional logic -- 2.1 Introduction -- 2.2 Syntax -- 2.3 Semantics -- 2.4 Evaluation -- 2.5 Satisfaction -- 2.6 Example-natural languagE -- 2.7 Example-digital circuits -- 2.8 Exercises --

3. Logical properties and relationships -- 3.1 Introduction -- 3.2 Logical properties -- 3.3 Logical equivalence -- 3.4 Logical entailment -- 3.5 Logical consistency -- 3.6 Connections between properties and relationships -- 3.7 Exercises --

4. Propositional proofs -- 4.1 Introduction -- 4.2 Linear reasoning -- 4.3 Hypothetical reasoning -- 4.4 Fitch -- 4.5 Reasoning tips -- 4.6 Soundness and completeness -- 4.7 Exercises --

5. Propositional resolution -- 5.1 Introduction -- 5.2 Clausal form -- 5.3 Resolution principle -- 5.4 Resolution reasoning -- 5.5 Exercises --

6. Relational logic -- 6.1 Introduction -- 6.2 Syntax -- 6.3 Semantics -- 6.4 Evaluation -- 6.5 Satisfaction -- 6.6 Example- sorority world -- 6.7 Example- blocks world -- 6.8 Example- modular arithmetic -- 6.9 Logical properties -- 6.10 Logical entailment -- 6.11 Relational logic and propositional logic -- 6.12 Exercises --

7. Relational analysis -- 7.1 Introduction -- 7.2 Truth tables -- 7.3 Semantic trees -- 7.4 Boolean models -- 7.5 Non-boolean models -- 7.6 Exercises --

8. Relational proofs -- 8.1 Introduction -- 8.2 Proofs -- 8.3 Example -- 8.4 Example -- 8.5 Example -- 8.6 Exercises --

9. Herbrand logic -- 9.1 Introduction -- 9.2 Syntax and semantics -- 9.3 Evaluation and satisfaction -- 9.4 Example- Peano arithmetic -- 9.5 Example- linked lists -- 9.6 Example- pseudo English -- 9.7 Example- metalevel logic -- 9.8 Undecidability -- 9.9 Exercises --

10. Herbrand proofs -- 10.1 Introduction -- 10.2 Non-compactness and incompleteness --

11. Induction -- 11.1 Introduction -- 11.2 Domain closure -- 11.3 Linear induction -- 11.4 Tree induction -- 11.5 Structural induction -- 11.6 Multidimensional induction -- 11.7 Embedded induction -- 11.8 Exercises --

12. Resolution -- 12.1 Introduction -- 12.2 Clausal form -- 12.3 Unification -- 12.4 Resolution principle -- 12.5 Resolution reasoning -- 12.6 Unsatisfiability -- 12.7 Logical entailment -- 12.8 Answer extraction -- 12.9 Strategies -- 12.10 Exercises --

Bibliography -- Authors' biographies.

Abstract freely available; full-text restricted to subscribers or individual document purchasers.

Compendex

INSPEC

Google scholar

Google book search

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.

Also available in print.

Title from PDF title page (viewed on December 5, 2016).