Introduction to logic / Michael Genesereth and Eric Kao.

Format:

Book

Author/Creator:

Genesereth, Michael R., 1948- author.

Kao, Eric, author.

Series:

Synthesis digital library of engineering and computer science.

Synthesis lectures on computer science ; 1932-1686 # 6.

Synthesis lectures on computer science, 1932-1686 ; # 6

Language:

English

Subjects (All):

Logic.

Physical Description:

1 online resource (165 p.)

Edition:

Second edition.

Place of Publication:

San Rafael, California (1537 Fourth Street, San Rafael, CA 94901 USA) : Morgan & Claypool, 2013.

Language Note:

English

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.

Contents:

Preface

1. Introduction

1.1 Logic

1.2 Elements of logic

1.3 Formalization

1.4 Automation

1.5 Reading guide

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. Satisfiability

3.1 Introduction

3.2 Truth table method

3.3 Basic backtracking search

3.4 Simplification and unit propagation

3.5 DPLL

3.6 GSAT

4. Propositional proofs

4.1 Introduction

4.2 Linear proofs

4.3 Structured proofs

4.4 Fitch

4.5 Soundness and completeness

5. Propositional resolution

5.1 Introduction

5.2 Clausal form

5.3 Resolution principle

5.4 Resolution reasoning

6. Relational 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 relational logic

6.12 Logical entailment

6.13 Finite relational logic

6.14 Omega relational logic

6.15 General relational logic

7. Relational 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 Domain closure

9.3 Linear Induction

9.4 Tree induction

9.5 Structural induction

9.6 Multidimensional induction

9.7 Embedded induction

9.8 Recap

10. Equality

10.1 Introduction

10.2 Properties of equality

10.3 Substitution

10.4 Fitch with equality

10.5 Example, group theory

10.6 Recap

A. Summary of Fitch rules

Bibliography

Authors' biographies.

Notes:

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

Series from website.

Includes bibliographical references (page 149).

Title from PDF title page (viewed on September 17, 2013).

Cited in:

Compendex

INSPEC

Google scholar

Google book search

ISBN:

1-62705-408-1

OCLC:

857365396