Prerequisite

"Logic and Computation I". Those who did not take our course last semester had better consult with the lecturer or TA before enrolling this course. Please find more information on "Logic and Computation I" at https://www.bimsa.cn/newsinfo/749634.html

Abstract

In the last semester, we studied basics of computable functions, first-order logic and complexity theory. In this semester, we move on to Goedel's incompleteness theorems, second-order logic, infinite automata, desciriptive set theory, etc.

Lecturer Intro.

Kazuyuki Tanaka received his Ph.D. from U.C. Berkeley. Before joining BIMSA in 2022, he taught at Tokyo Inst. Tech and Tohoku University, and supervised fifteen Ph.D. students. He is most known for his works on second-order arithmetic and reverse mathematics, e.g., Tanaka's embedding theorem for WKLo and the Tanaka formulas for conservation results. For more details: https://sendailogic.com/tanaka/