Syllabus
A review of basics of first-order logic, including elements of model theory.
Turing machines, the universal machine, the undecidability of the halting problem.
Peano arithmetic PA, Gödel’s theorems, formalization of syntax in PA.
See also https://users.math.cas.cz/~jerabek/teaching/mathlog.html and https://www.karlin.mff.cuni.cz/~krajicek/mll.html
Annotation
An advanced course in mathematical logic. It breifly recalls basic concepts and costructions. The main topic is the incompleteness and the undecidability, and Godel's theorems in particular.
A recommended course for specializations Mathematical Analysis and Mathematical
Structures within General Mathematics.