Speaker:
Lev D. Beklemishev (Moskow State University)
Time:
- 16:20-17:20 Beijing Time
- October 18, 2024 (Friday)
Venue:
518, Research Building 4
Abstract:
In this lecture we will give an introduction to the theory of computations and proofs. We will start with classical results such as decidable and undecidable problems and the Gödel incompleteness theorems. Then we will go into more advanced topics, discussing what information can be gained from the fact that a function is not only computable but verifiable in some formal system. Finally, we will focus on fast growing functions and examples of combinatorial statements unprovable in Peano arithmetic.
Speaker Bio:
Lev D. Beklemishev, 莫斯科国立大学教授，莫斯科斯捷克洛夫数学研究所博士，2019–2022年担任斯捷克洛夫国际数学中心 (SIMC)副主任，2020年至今担任斯捷克洛夫国际数学中心数学逻辑系主任。俄罗斯科学院院士，曾获得莫斯科数学学会奖，2022年俄罗斯科学院“年度最佳论文”。符号逻辑协会(ASL)委员会成员，俄罗斯A.I. Maltsev奖评审。主要研究方向为：数理逻辑，证明论，形式算术，可证性逻辑，模态逻辑。
October 18, 2024