Goedel's theorem 1000-1M08TWG

1. General ideas and necessity of formalization, The Peano arithmetic;
2. Recursive and recursively enumerable functions and sets;
3. Goedelisations and other formalisms;
4. The Goedel Theorem and related theorems by Rossner, Tarski, Loeb;
5. Discussion of theorems due to Tenenbaum, Paris-Harrington and Matiasievič, and the proof of one of them.

To understand the lecture knowledge of formal logic, usually covered by a standard course in mathematical logic, is necessary.
Final oral exam, and in case of a big number of students also a written one. Student's activity in class is expected.