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;
- Computability: computable functions, λ-calculi, simple theory of types;
- Constructive mathematics: intuitionistic logic, propositions as types, normalisation;
- Limiting results: Peano arithmetic, Gödel’s incompleteness theorems, natural incompleteness results.
The slides of the course are available: select the right academic year
Here are some exercises on natural deduction.
The official online course is available: please carefully read the introductory notes!
The non-official videos are available in the video page.
Note that this course on YouTube differs from the online 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 oct 2019 | ||
| 27 nov 2019 | ||
| 10 jan 2020 | ||
| 28 jan 2020 | ||
| 9 apr 2021 | ||
| 30 apr 2021 |
Results
| Surname | Name | 1st | 2nd | 3rd | 4th | Final |
|---|---|---|---|---|---|---|
| Te (2019/2020) | G | 30 | 32 | 19 | 30 | 28 |
| A | F | 36 | 36 | – | – | – |
| B | M | 32 | 28 | – | – | – |
| Ca | C | 30 | 31 | – | – | – |
| Cl | C | 26 | 34 | – | – | – |
| DZ | G | 36 | 34 | – | – | – |
| DP | G | 36 | 36 | – | – | – |
| D | G | 26 | 32 | – | – | – |
| F | S | 34 | 34 | – | – | – |
| F | A | 36 | 36 | – | – | – |
| G | F | 36 | 34 | – | – | – |
| M | F | 36 | 36 | – | – | – |
| P | R | 23 | 33 | – | – | – |
| R | M | 24 | 36 | – | – | – |
| S | S | 28 | 36 | – | – | – |
| V | M | 32 | 35 | – | – | – |
| V | S | 36 | 36 | – | – | – |
