Course Outline |
||
A thorough introduction to mathematical logic, covering the following topics: propositional and first-order logic; soundness, completeness, and compactness of first-order logic; first-order theories; undecidability and Gödel's incompleteness theorem; and an introduction to other logics such as intuitionistic and modal logics. Furthermore, the course stresses the application of logic to various areas of computer science such as computability, programming languages, program specification and verification.
|
Date | Topics |
1 | Sep 06/11 | Introduction, Propositional Logic (no lab this week) |
2 | Sep 13/18 | Propositional Logic, Natural Deduction |
3 | Sep 20/25 | Natural Deduction, Normal forms |
4 | Sep 27/Oct 02 | First Order Logic, (Test 1) |
5* | Oct 04/16 | First Order Logic, Natural Deduction |
6 | Oct 18/23 | Natural Deduction, Intuitionistic Logic |
7 | Oct 25/30 | Decidability, Gödel's results, (Test 2) |
8 | Nov 01/06 | Modal Logic |
9 | Nov 08/13 | Modal Logic |
10 | Nov 15/20 | Modal Logic, decidability, (Test 3) |
11 | Nov 22/27 | Dynamic Logic |
12 | Nov 29/Dec 04 | Program verification, review (no lab this week) |