Daniel Bonevac

Blackwell Publishers

Deduction




Programs

Answers

Overhead Slides
Deduction, second edition. Oxford: Blackwell Publishers, fall 2002.


Daniel Bonevac
Department of Philosophy
University of Texas at Austin
316 Waggener Hall
Speedway at 22nd Street
Austin, TX 78712
Phone: 512-471-4857
FAX: 512-471-4806


Description

Deduction presents classical first-order logic as efficiently and elegantly as possible. It presents a truth tree system based on the work of Jeffrey, as well as a natural deduction system inspired by that of Kalish and Montague. Both are very natural and easy to learn. The definition of a formula excludes free variables, and the deduction system uses Show lines; the combination allows rules to be stated very simply.

The book's main innovation is its final part, which contains chapters on extensions and revisions of classical logic: modal logic, many-valued logic, fuzzy logic, intuitionistic logic, counterfactuals, deontic logic, common sense reasoning, and quantified modal logic. These have been areas of great logical and philosophical interest over the past 40 years, but few other textbooks treat them in any depth. Deduction makes these areas accessible to introductory students. All chapters have discussions of the underlying semantics and present both truth tree and deduction systems.

New features in this edition, in addition to truth tree systems for classical and nonclassical logics, include new and simpler rules for modal logic, deontic logic, and counterfactuals; discussions of many-valued, fuzzy, and intuitionistic logics; an introduction to common sense reasoning (nonmonotonic logic); and extensively reworked problem sets, designed to lead students gradually from easier to more difficult problems. This new edition also features web-based programs which make use of the book's methods.


Table of Contents

1. BASIC CONCEPTS OF LOGIC

1.1 Arguments
1.2 Validity
1.3 Implication and Equivalence
1.4 Logical Properties of Sentences
1.5 Satisfiability

2. SENTENCES

2.1 The Language of Sentential Logic
2.2 Truth Functions
2.3 A Sentential Language
2.4 Symbolization
2.5 Validity
2.6 Truth Tables
2.7 Truth Tables for Formulas
2.8 Truth Tables for Argument Forms
2.9 Implication, Equivalence and Satisfiability

3. TRUTH TREES

3.1 Thinking Backwards
3.2 Constructing Truth Trees
3.3 Negation, Conjunction, and Disjunction
3.4 The Conditional and Biconditional
3.5 Other Applications

4. NATURAL DEDUCTION

4.1 Natural Deduction Systems
4.2 Rules for Negation and Conjunction
4.3 Rules for the Conditional and Biconditional
4.4 Rules for Disjunction
4.5 Derivable Rules

5. QUANTIFIERS

5.1 Constants and Quantifiers
5.2 Categorical Sentence Forms
5.3 Polyadic Predicates
5.4 The Language Q
5.5 Symbolization

6. QUANTIFIED TRUTH TREES

6.1 Rules for Quantifiers
6.2 Strategies
6.3 Interpretations
6.4 Constructing Interpretations From Trees

7. QUANTIFIED NATURAL DEDUCTION

7.1 Deduction Rules for Quantifiers
7.2 Universal Proof
7.3 Derived Rules for Quantifiers

8. IDENTITY AND FUNCTION SYMBOLS

8.1 Identity
8.2 Truth Tree Rules for Identity
8.3 Deduction Rules for Identity
8.4 Function Symbols

9. NECESSITY

9.1 If
9.2 Modal Connectives
9.3 Symbolization
9.4 Modal Truth Trees
9.5 Other Tree Rules
9.6 World Travelling
9.7 Modal Deduction
9.8 Other Modal Systems

10. BETWEEN TRUTH AND FALSEHOOD

10.1 Vagueness and Presupposition
10.2 Many-valued Truth Tables
10.3 Many-valued Trees
10.4 Many-valued Deduction
10.5 10.5 Fuzzy Logic
10.6 Intuitionistic Logic

11. OBLIGATION

11.1 Deontic Connectives
11.2 Deontic Truth Trees
11.3 Deontic Deduction
11.4 Moral and Practical Reasoning

12. COUNTERFACTUALS

12.1 The Meaning of Counterfactuals
12.2 Truth Tree Rules for Counterfactuals
12.3 Deduction Rules for Counterfactuals
10.4 Stalnaker's Semantics
10.5 Lewis's Semantics

13. COMMON SENSE REASONING

13.1 When Good Arguments Go Bad
13.2 Truth Trees
13.3 Defeasible Deduction
13.4 Defeasible Deontic Logic

14. QUANTIFIERS AND MODALITY

14.1 Quantified S5
14.2 Free Logic