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 non-official videos are now available in the video page.
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 |
Results (academic year 2019/20)
| Surname | Name | 1st | 2nd | 3rd | 4th | Final |
|---|---|---|---|---|---|---|
| F | D | 36 | 28 | 22 | 32 | 30 |
| G | L | 24 | 36 | 21 | 24 | 26 |
| S | G | 28 | 30 | 19 | 24 | 25 |
| Te | G | 30 | 32 | 19 | 30 | 28 |
| Tu | G | 32 | 36 | 28 | 28 | 30 e lode |
