After successful completion of the course, students are able to understand and independently prove various advanced logical (in particular, model-theoretic and computability-theoretic) statements and facts.
The following topics are intended to be treated in the course:- Quantifier Elimination- Gödel's incompleteness theorems- Computable structures
Lectures and discussions
Two homeworks, each consisting of 6-7 problems.
Knowledge of the basic notions of mathematical logic (syntax, semantics, first-order, propositional, main concepts of computability theory) will be assumed. It is recommended (but not required) to attend the course Computability Theory beforehand.