Courses


I shall give a series of talks which cover basic facts in model theory, constructibility and forcing. Finally I shall present Shelah's proof on Whitehead problem. Yonghua's talk will cover basic facts in Homological algebra.

This would be an informal introduction to mathematical logic. I intend to cover Godel's incompleteness theorem (with an informal proof), Godel's constructibility and Cohen's forcing. Some connections between mathematical logic and the other mathematical branches will be discussed.

An introduction to priority argument. Some applications to algorithmic information theory will be discussed.

The course is targeted for those students who does not want to be a model theorist. So I plan to put more recursion and effective descriptive set theory stuff into the course. The course will cover an analysis of Vaught's conjecture using effective descriptive set theory, Morley's categoricity theorem and an introduction to infinitary logic with some applications to higher recursion theory.

I intend to use the material from the first part and the first several chapters of the second part in the joint book draft with CT. So the course will cover effective transfinite induction, hyperarithmetic theory, \Pi^1_1 -set theory, Axiom of Determinacy from the recursion theory point of view, and Martin's conjecture etc.

 The course will cover the complete proof of the independence of both Continuum Hypothesis and Axiom of Choice. Mathematical Logic (I) is required.

  The course will cover several proofs of G\" odel's Incompleteness Theorem.

  We shall give a complete proof of G\" odel's Incompleteness Theorem.

The course will cover several proofs of G\" odel's Incompleteness Theorem.

   The course will cover several proofs of G\" odel's Incompleteness Theorem.