Programme
Morning Session (Chair: Ruizhi Yang)
09:00–09:50 Yanjing Wang: Knowing how to understand intuitionistic logic
Abstract: The goal of the talk is to make intuitionistic logic intuitive by providing an epistemic understanding grounded both mathematically and philosophically. We decode intuitionistic logic as a dynamic epistemic logic of knowing how by using the state-of-art techniques and ideas from philosophical logic and formal epistemology. The approach is inspired by some scattered but related ideas hidden in the vast literature of math, philosophy, CS, and linguistics about intuitionistic logic in the past 100 years, which echoed Heyting's initial idea about intuitionistic truth as knowing how to prove. Many important technical results of intuitionistic logic, such as Glivenko's double negation translations and Gödel's modal embedding, become transparent, if not trivial. In this approach, we also reveal the intrinsic technical connection between Brouwer–Heyting–Kolmogorov interpretation and the Kripke semantics for intuitionistic logic in a natural manner. It paves a general method to understanding a family of related non-classical logics as intuitive epistemic logics. I shall conclude with some ongoing work and future directions.
09:50–10:40 Weiguang Peng: Some logical investigations on game theory
Abstract: My talk consists of two parts. At first, I will introduce some mathematical results which are used to prove some game properties in the context of reverse mathematics. Then, we will mainly concentrate on the optimal depth-first algorithms and distributional complexity on game tree, which is an important model of computation in the area of computational complexity.
10:40–11:10 Coffee Break and Group Photo
11:10–12:00 Zesheng Chen: 可构造宇宙是否是免于形式的?—论 Kennedy 的“可定义性丘奇–图灵论题” (Zoom ID: 917 8958 3706)