Math 570/Phil 006/Lgic 310

Day	Sections	Videos
September 7	1.1-1.3	1.1: Math as a computation 1.1: Statements and Contexts 1.1: A Warning 1.2: Terms 1.2: Formulas 1.3: Languages 1.3: Unique Readability
September 9	1.4-1.5	1.4: Induction 1.5: Free Variables
September 14	1.6-1.7	1.6: Structures 1.7: Satisfaction 1.7: Substitutions
September 16	1.8-1.9	1.8: Substitutability 1.8: Logical Implication and Elementary Classes
September 21	2.2-2.4	Deductions
September 23	2.5-2.7	Soundness Deduction Theorem
September 28	2.8	(2.8 is short - this is kind of a catch-up day)
September 30	3.1 and 3.2 through Lemma 3.2.5	Two Kinds of Completeness Consistency and Satisfiability Comleteness Theorem Preliminaries A Little about the Henkin Construction
October 5	Rest of 3.2	Constructing a structure, first try Finishing the construction of a structure Outline of the proof of the completneess theorem
October 7	3.3	Compactness Connectned Graphs
October 12	3.4 and Appendix	Cardinality Elementary Substructures and Equivalence Lowenheim-Skolem
Octover 19	No reading (see videos)	Categoricty A Totally Categorical Theory Dense Linear Orders are Countably Categorical An Uncountably Categorical Theory
October 21	4.1-4.4	Delta formula
October 26	4.5-4.6	Encoding sequences
October 28	5.1-5.4	Sigma sentences are provable Representable sets and formula
November 2	5.5-5.7	Coding
November 4	5.8-5.13	Construction Sequences Coding Deductions
November 9	6.2-6.3	The Self-Reference Lemma The First Incompleteness Theorem
November 11	6.4-6.6	Variations on Incompleteness The Second Incompleteness Theorem
November 16	A Mathematical Introduction to Mathematical Logic, Chapter 8
November 18	A Mathematical Introduction to Mathematical Logic, 9.1-9.3
November 23	A Mathematical Introduction to Mathematical Logic, 9.6, 10.1-10.2, 10.4-10.5
November 30	Enderton, Section 3.1
December 2	Enderton, Section 3.2