0% found this document useful (0 votes)
45 views3 pages

Modem Primer: Formal

This document is a table of contents for a two-volume primer on formal logic. The volumes cover predicate logic, including syntax, semantics, quantifiers, natural deduction, and metatheory. Volume I focuses on predicate logic, transcription, truth trees, and identity. Volume II covers metatheory, mathematical induction, soundness and completeness proofs for trees and derivations, Koenig's lemma, and interpretations in predicate logic.

Uploaded by

xan30tos
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
45 views3 pages

Modem Primer: Formal

This document is a table of contents for a two-volume primer on formal logic. The volumes cover predicate logic, including syntax, semantics, quantifiers, natural deduction, and metatheory. Volume I focuses on predicate logic, transcription, truth trees, and identity. Volume II covers metatheory, mathematical induction, soundness and completeness proofs for trees and derivations, Koenig's lemma, and interpretations in predicate logic.

Uploaded by

xan30tos
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Contents

A Modem Volume
Formal Logic LI
Primer

PREFACE TO VOLUMES I AND 11: A Guide to the


Primer xi

PART I: PREDICATE LOGIC

1. PREDICATE LOGIC: Syntax


1-1. We Need More Logical Form 1

1-2. Quantifiers and Variables 5


1-3. The Sentences of Predicate Logic 9

2. PREDICATE LOGIC: Semantics and Validity


2-1. Interpretations 13

2-2. Truth in an Interpretation 18

2-3. Validity in Predicate Logic 24


Catcnts vii

3. MORE ABOUT QUANTIFIERS 7. TRUTH TREES FOR PREDICATE LOGIC:


Fundamentals
3-1. Some Examples of Multiple Quantification 28
7-1. The Rule for Universal Quantification 106
3-2. Quantifier Scope, Bound Variables, and Free
Variables 29 7-2. The Rule for Existential Quantification 111

3-3. Correct Definitions of Substitution Instance 7-3. Applying the Rules 114
and Truth in an Interpretation 33
74. Negated Quantified Sentences 118
34. Some Logical Equivalences 36
8. MORE ON TRUTH TREES FOR PREDICATE
LOGIC
4. TRANSCRIPTION
8-1. Contradictions, Logical Truth, Logical
4-1. Restricted Quantifiers 40
Equivalence, and Consistency 123
4-2. Transcribing from English into Logic 45
8-2. Truth Trees with Multiple Quantifiers 128
4-3. Transcription Strategies 54
8-3. Three Shortcuts 131
84. Infinite Trees 133
5. NATURAL DEDUCTION FOR PREDICATE LOGIC:
Fundamentals 62
5-1. Review and Overview 62 9. IDENTITY, FUNCTIONS, AND DEFINITE
DESCRIPTIONS
5-2. The Universal Elimination Rule 63
9-1. Identity 138
5-3. The Existential Introduction Rule 65
9-2. Inference Rules for Identity 141
54. The Existential Elimination and Universal
Introduction Rules: Background in lnformal 9-3. Functions 147
Argument 70
94. Definite Descriptions 153
5-5. The Universal Introduction Rule 73
5-6. The Existential Elimination Rule 83
PART 11: METATHEORY

6. MORE ON NATURAL DEDUCTION FOR PREDICATE


LOGIC 91 10. METATHEORY: The Basic Concepts
6-1. Multiple Quantification and Harder Problems 10-1. Object Language and Metalanguage 157
91
10-2. Syntax and Semantics 161
6-2. Some Derived Rules 96
10-3. Soundness and Completeness 162
6-3. Logical Truth, Contradictions, Inconsistency,
and Logical Equivalence 99 104. Some Further Notation and Definitions 165
MATHEMATICAL INDUCTION 15-3. Soundness for Predicate Logic Derivations 234

11-1. Informal Introduction 169 15-4. Completeness for Predicate Logic Derivations
236
11-2. The Principle of Weak Induction 170
15-5. Compactness, Identity, and Functions 242
I 1-3. Strong Induction 172
15-6. Conclusion 246

SOUNDNESS AND COMPLETENESS FOR SENTENCE


LOGIC TREES 176 INDEX
12- 1. Preliminaries 176
12-2. Soundness and Completeness of the Tree
Method: Informal Statement 177
12-3. Soundness and Completeness for Sentence Logic
Trees: Formal Details 18 1

SOUNDNESS AND COMPLETENESS FOR SENTENCE


LOGIC DERIVATIONS 191
13-1. Soundness for Derivations: Informal
Introduction 19 1
13-2. Soundness for Derivations: Formal Details 193
13-3. Completeness for Derivations: Informal
Introduction 199
13-4. Completeness for Derivations: Formal Details
203

KOENIG'S LEMMA, COMPACTNESS, AND


GENERALIZATION TO INFINITE SETS OF PREMISES 212
14-1. Koenig's Lemma 2 12

14-2. Compactness and Infinite Sets of Premises 214

INTERPRETATIONS, SOUNDNESS, AND


COMPLETENESS FOR PREDICATE LOGIC
15-1. Interpretations 220

15-2. Soundness and Completeness for Trees 230

You might also like