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 | Jan 08/10 | Introduction, Propositional Logic (no lab this week) |
2 | Jan 15/17 | Propositional Logic, Natural Deduction |
3 | Jan 22/24 | Natural Deduction, Normal forms |
4 | Jan 29/31 | First Order Logic, (Test 1) |
5 | Feb 05/07 | First Order Logic, Natural Deduction |
6 | Feb 12/14 | Natural Deduction, Intuitionistic Logic |
7* | Feb 26/28 | Decidability, Gödel's results, (Test 2) |
8 | Mar 05/07 | Modal Logic |
9 | Mar 12/14 | Modal Logic |
10 | Mar 19/21 | Modal Logic, decidability, (Test 3) |
11 | Mar 26/28 | Dynamic Logic |
12 | Apr 02/04 | Program verification, review (no lab this week) |