Mathematical Logic
Program
- Propositional logic: language, deduction system, semantics, soundness, completeness;
- First-order logic: syntax, semantics, soundness, completeness, compactness;
- Set theory: fundamental axioms, ordinals, cardinals, transfinite induction, axiom of choice, continuum hypothesis;
- Constructive mathematics: intuitionistic logic, computable functions, λ-calculi, propositions as types;
- Limiting results: Peano arithmetic, Gödel’s incompleteness theorems, natural incompleteness results, incompleteness and computability.
The slides of the course are available: select the right academic year
Here are some exercises on natural deduction. Although not of high quality, these are the videos from the 2016/17 course.
Assignments
| date | text | solution |
|---|---|---|
| 7 nov 2016 | ||
| 5 dec 2016 | ||
| 16/17 jan 2017 | ||
| 1 feb 2017 | ||
| 23 mar 2018 | ||
| 2 may 2018 | ||
| 25 may 2018 | ||
| 8 jun 2018 | ||
| 31 oct 2018 | ||
| 28 nov 2018 | ||
| 10 jan 2019 | ||
| 5 feb 2019 | ||
| 24 nov 2019 |
Results (academic year 2019/20)
| Surname (first letter) | Name (first letter) | First assignment | Second assignment | Third assignment | Fourth assignment | Final result |
|---|---|---|---|---|---|---|
| F | D | 36 | – | – | – | – |
| G | L | 24 | – | – | – | – |
| S | G | 28 | – | – | – | – |
| Te | G | 30 | – | – | – | – |
| Tu | G | 32 | – | – | – | – |
