Lecture 28: Recap
27.1 Topics
How to succeed in PHIL 210 (Fall 2025)
1 Introduction and basic terminology
Part I Truth-Functional Logic: Language and semantics
2 Truth-functional logic (TFL): Symbolization
3 Truth-functional logic (TFL): Connectives
4 TFL: Syntax and semantics
5 Validity for TFL arguments and entailment
6 More semantic notions: Logical equivalence
7 More semantic notions: Tautology and joint satisfiability
Part II Truth-Functional Logic: Proof system
8 Formal proofs in the Fitch system for Natural Deduction
9 Implication, bi-implication. Re-iteration. Proofs without premises
10 Soundness and completeness. Subproofs. Rules for disjunction
11 Contradictions, explosion, negation, and IP
12 Strategies for Fitch proofs
13 Derived rules and review of TFL
Part III First-Order Logic: Language and semantics
14 First-order logic: The language
15 First-order logic: The existential quantifier
16 First-order logic: The universal quantifier
17 First-order logic: Identity
18 First-order logic: Syntax and semantics
19 FOL: Validity and other semantic notions
20 Interpretations and variable assignments
21 Counterexamples
Part IV First-Order Logic: Proof system
© Dirk Schlimm, McGill University, PHIL 210, 2025. • Do not distribute this document. • 27–2
22 Fitch rules for identity and universal elimination
23 Fitch rules for universal introduction
24 Fitch rules for the existential quantifier
25 Proof strategies and examples
26 Soundness and completeness of FOL
27.2 Logics
classical intuitionistic modal . . .
Propositional decidable / complete
Monadic FO decidable / complete
First order undecidable / complete
Higher order undecidable / incomplete
27.3 History
Aristotle (syllogisms)
1840s Boole, De Morgan (propositional logic)
1879 Frege: Begriffsschrift (first-order logic)
1880s Cantor / Dedekind (set theory)
1900 Hilbert’s Problems (Consistency)
1910 Whitehead and Russell: Principia Mathematica
1928 Hilbert and Ackermann (Textbook)
1930 Gödel: Completeness of FOL
1931 Gödel: Incompleteness Theorems (G1, G2)
1934 Gentzen (Natural deduction calculus)
1933 Tarski: “The concept of truth in formalized languages” (valuations)
1936 Tarski: “On the concept of logical consequence” (|=)
1936 Turing, Church: Computability (Halting problem)
The real fun with logic has only just begun!