CS 4860 Applied Logic - (Fall 2012)
Schedule
Meeting Tue/Thr 10:10-11:25 in Upson 315
Date | Topic | Notes/Readings | Assignments |
---|---|---|---|
Week 1 | |||
8/23 | Introduction | ||
Week 2 | |||
8/28 | Evidence Semantics for Intuitionistic Propositional Logic | ||
8/30 | Evidence Semantics for (Intuitionistic) Propositional Logic |
Lect 3 Notes
|
|
Week 3 | |||
9/4 | Refinement proofs and evidence construction | ||
9/6 | Refinement proofs and evidence construction |
|
|
Week 4 | |||
9/11 | Introduction to Smullyan's Propositional Calculus | Story of Logic - updated 9/13 |
Assignment 2 |
9/13 | Constructive Logic IPC and Classical logic PC |
|
|
Week 5 | |||
9/18 | |||
9/20 |
|
||
Week 6 | |||
9/25 | Consistency of Propositional Logic | ||
9/27 | Consistency of Refinement Logic and Completeness of Propositional Logic |
||
Week 7 | |||
10/2 | Completeness of IPC | ||
10/4 |
|
||
Week 8 | |||
10/9 | NO CLASS - FALL BREAK | ||
10/11 | First-Order Logic |
||
Week 9 | |||
10/16 | Prelim | ||
10/18 | Discuss Prelim Aspects of FOL |
||
Week 10 | |||
10/23 | Prenex Normal Form Proving unrealizability |
||
10/25 | Completeness of FOL |
||
Week 11 | |||
10/30 | Completeness of FOL continued | ||
11/1 | Löwenheim Skolem Theorem, the Skolem "Paradox" |
||
Week 12 | |||
11/6 | Undecidable Theories - Q | ||
11/8 | Undecidability and Incompleteness |
||
Week 13 | |||
11/13 | Gödel Numbering and Natural Induction | ||
11/15 | Fast Induction |
||
Week 14 | |||
11/20 | Undecidable Theories, Constructive Issues | ||
11/22 | NO CLASS - THANKSGIVING BREAK |
|
|
Week 15 | |||
11/27 | Set Theory in FOL | ||
11/29 | Type Theory |