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;
  • 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
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

Results (academic year 2018/19)

Surname (first letter)Name (first letter)First assignmentSecond assignmentThird assignmentFourth assignmentFinal result
IC282415 
MS262428
PB302328

Results (academic year 2017/18)

Surname (first letter)Name (first letter)First assignmentSecond assignmentThird assignmentFourth assignmentFinal result
BG3030302830
CG3535313330L
MR3035243230