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
datetextsolution
7 nov 2016pdfpdf
5 dec 2016pdfpdf
16/17 jan 2017pdfpdf
1 feb 2017pdfpdf
23 mar 2018pdfpdf
2 may 2018pdfpdf
25 may 2018pdfpdf
8 jun 2018pdfpdf
31 oct 2018pdfpdf
28 nov 2018pdfpdf
10 jan 2019pdfpdf
5 feb 2019pdfpdf
24 oct 2019pdfpdf
27 nov 2019pdfpdf
10 jan 2020pdfpdf
28 jan 2020pdfpdf
9 apr 2021pdfpdf
30 apr 2021pdfpdf
28 may 2021pdfpdf
15 june 2021pdfpdf

Results

SurnameName1st2nd3rd4thFinal
Te (2019/2020)G3032193028
AF3636293630 e lode
BM3228273530 e lode
CaC3031173629
ClC2634333630 e lode
DZG3634313630 e lode
DPG3636303630 e lode
DG2632193628
FS3434293230 e lode
FA3636333530 e lode
GF3634263630 e lode
MF3636343530 e lode
PR2333293430
RM2436223630
SS2836343230 e lode
VM3235303530 e lode
VS3636303530 e lode

Website Powered by WordPress.com.