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

• 2017/18
• 2016/17
• 2015/16

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	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 june 2018	pdf	pdf

Results (academic year 2017/18)

Surname (first letter)	Name (first letter)	First assignment	Second assignment	Third assignment	Fourth assignment	Final result
B	F	31	22	34	28	29
B	G	30	30	30	28	30
C	G	35	35	31	33	30L
C	T	32	34	22	28	29
C	B	22	25	30	24	25
F	C	36	36	34	32	30L
G	L	22	28	32	33	29
G	H	36	36	34	20	30L
L	T	26	25	30	24	26
M	C	22	26	32	27	27
M	R	30	35	24	32	30
P	A	30	36	24	32	30L
P	D	28	36	36	32	30L
P	V	28	35	34	26	30L
S	F	28	30	34	20	28
S	R	31	35	36	32	30L
T	L	25	22	34	24	26

Results not yet registered (academic year 2016/17)

Surname (first letter)	Name (first letter)	First assignment	Second assignment	Third assignment	Fourth assignment	Final result
A	L	25	20	24	25	24