| |
| |
Editor''s Preface | |
| |
| |
Acknowledgments | |
| |
| |
| |
Introduction | |
| |
| |
Logic and Argument | |
| |
| |
Deduction and Induction | |
| |
| |
Statements, Propositions, and Context | |
| |
| |
Use and Mention | |
| |
| |
| |
Statement Logic I: A New Language | |
| |
| |
Introduction | |
| |
| |
Truth-Functionally Compound Statements | |
| |
| |
Symbolizing Simple and Compound Statements | |
| |
| |
Symbolizing More Complex Statements and Arguments | |
| |
| |
Spelling It Out Formally | |
| |
| |
| |
Statement Logic Ii: Semantic Methods | |
| |
| |
Introduction | |
| |
| |
Truth Tables | |
| |
| |
Formalized Semantics for SL | |
| |
| |
Truth-Functional Validity and Tautologousness | |
| |
| |
Further Semantic Properties and Relationships | |
| |
| |
Truth-Functional Consistency | |
| |
| |
The Material Conditional Revisited | |
| |
| |
Brief Truth Tables | |
| |
| |
Truth Trees | |
| |
| |
Using Truth Trees to Test for Other Semantic Properties | |
| |
| |
The Adequacy of the Tree Method | |
| |
| |
| |
statement logic iii: syntactic methods | |
| |
| |
Introduction | |
| |
| |
Whole Line Inference Rules for DSL | |
| |
| |
Replacement Rules for DSL | |
| |
| |
Conditional Proof and Reduction ad Absurdum | |
| |
| |
Proof Strategy | |
| |
| |
Proving Tautologousness and Other Semantic Properties | |
| |
| |
The Adequacy of the Natural Deduction System DSL | |
| |
| |
Additional Inference Rules | |
| |
| |
A Second Look at the Truth Table for the Material Conditional | |
| |
| |
| |
Predicate Logic I: Syntax And Semantics | |
| |
| |
Introduction | |
| |
| |
Informal Introduction to the Language of Predicate Logic | |
| |
| |
Syntax for L | |
| |
| |
Formal Semantics I: Interpretations | |
| |
| |
Formal Semantics II: Truth Under an Interpretation | |
| |
| |
Symbolizing English I: Monadic Logic and Categorical Forms | |
| |
| |
Symbolizing English II: Polyadic Logic and Nested Quantifiers | |
| |
| |
Semantic Properties and Relationships for L | |
| |
| |
Classifying Logical Relations | |
| |
| |
| |
Predicate Logic Ii: Semantic Methods | |
| |
| |
Introduction | |
| |
| |
Truth Trees | |
| |
| |
Reading Interpretations From Finished Open Paths | |
| |
| |
The Problem of Infinite Trees | |
| |
| |
The Adequacy of the Tree Method for Lm and L | |
| |
| |
Soundness, Completeness, and Undecidability | |
| |
| |
| |
Monadic Predicate Logic Iii: Syntactic Methods | |
| |
| |
Introduction | |
| |
| |
The Rules UI, EG, and Q | |
| |
| |
The Rules UG, R, PA-EI and EI | |
| |
| |
The Adequacy of DL | |
| |
| |
| |
Extensions To L: Identity, Relations And Functions | |
| |
| |
Introduction | |
| |
| |
Syntax and Semantics for L | |
| |
| |
Symbolization in L= I: ''At Least'', ''At Most'', and ''Exactly'' | |
| |
| |
Symbolization in L= II: Identity and Polyadic Predicates | |
| |
| |
Truth Trees for L | |
| |
| |
Natural Deduction in L | |
| |
| |
Syntax and Semantics for L | |
| |
| |
Symbolization in L | |
| |
| |
Truth Trees in L | |
| |
| |
Natural Deduction in L | |
| |
| |
| |
Some Applications And Limitations Of L | |
| |
| |
Introduction | |
| |
| |
Definite Descriptions and Ontological Commitment | |
| |
| |
Axiom Systems for Arithmetic | |
| |
| |
The Incompleteness of Arithmetic | |
| |
| |
Applications of Axiomatic Theories to the Philosophy of Science | |
| |
| |
Higher Order Logic | |
| |
| |
Modal Logic | |
| |
| |
Strict and Counterfactual Conditionals | |
| |
| |
General Intensional Logic | |
| |
| |
Deontic Logic | |
| |
| |
Free Logic | |
| |
| |
Many-Valued Logic | |
| |
| |
| |
Further Reading in Logic | |
| |
| |
| |
Answer to Selected Exercises | |
| |
| |
Index | |