Marco Benini

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 pdf pdf
5 dec 2016 pdf pdf
16/17 jan 2017 pdf pdf
1 feb 2017 pdf pdf
23 mar 2018 pdf pdf
2 may 2018 pdf pdf
25 may 2018 pdf pdf
8 jun 2018 pdf pdf
31 oct 2018 pdf pdf
28 nov 2018 pdf pdf
10 jan 2019 pdf pdf
5 feb 2019 pdf pdf
24 oct 2019 pdf pdf
27 nov 2019 pdf pdf
10 jan 2020 pdf pdf
28 jan 2020 pdf pdf

Results (academic year 2019/20)

Surname Name 1st 2nd 3rd 4th Final
Te G 30 32 19 30 28