B1a Logic: Contents

L01 Introduction
1. What is mathematical logic about?
2. Historical motivation
3. Hilberts program
4. Solutions to Hilberts program
5. Decidability
6. Why mathematical logic?
L02 PART I: PROPOSITIONAL CALCULUS
1. The language of propositional calculus
L03 2. Valuations and truth tables
3. Logical validity and logical consequence
L04 4. Logical equivalence
5. Adequacy of the connectives and DNF
L05 6. A deductive system for propositional calculus
6.5 The Soundness Theorem for L0
L06 6.6 The Deduction Theorem for L0
6.9 Sequent calculus
L07 Consistency, Completeness and Compactness Theorems
L08 PART II: PREDICATE CALCULUS
8. The language of (first-order) predicate calculus
L09 9.Interpretations and assignments
L10 10. Free and bound variables

L11 11. Substitution

L12 12. A formal system for predicate calculus
12.2 The Soundness Theorem
12.3 The Deduction Theorem
L13/14 13. The Completeness Theorem
L15 14. Applications of Godels Completeness Theorem
14.1 The Compactness Theorem for predicate calculus
14.3 The Lowenheim-Skolem Theorem
Dense linear orderings without endpoints
L16 15. Normal Forms
(a) Prenex Normal Form
(b) Skolem Normal Form