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 june 2018 | ||
| 31 october 2018 |
Results (academic year 2018/19)
| Surname (first letter) | Name (first letter) | First assignment | Second assignment | Third assignment | Fourth assignment | Final result |
|---|---|---|---|---|---|---|
| I | C | 28 | – | – | – | |
| M | S | 26 | – | – | – | – |
| P | B | 30 | – | – | – | – |
Results (academic year 2017/18)
| Surname (first letter) | Name (first letter) | First assignment | Second assignment | Third assignment | Fourth assignment | Final result |
|---|---|---|---|---|---|---|
| B | G | 30 | 30 | 30 | 28 | 30 |
| C | G | 35 | 35 | 31 | 33 | 30L |
| C | B | 22 | 25 | 30 | 24 | 25 |
| M | R | 30 | 35 | 24 | 32 | 30 |
| T | L | 25 | 22 | 34 | 24 | 26 |
