2025 Nov 20 16:00-17:30 Liangda Fang (Jinan University) Strategy Synthesis of LIA-Definable Terminating Impartial Combinatorial Games

In game theory, an elementary and fundamental class of games is impartial combinatorial games (ICGs). The majority of classical and interesting ICGs are LIA-definable and terminating. One of the challenging and long-standing problems of ICGs is to compute winning… More>>

2025 Nov 6 16:00-17:30 Qian Chen (陈谦, Tsinghua University) Degree of Kripke-incompleteness of tense logics

Tense logics are normal bi-modal logics with ‘future-looking’ and ‘past-looking’ modalities. The degree of Kripke-incompleteness of a logic L in some lattice C of logics is the cardinality of logics in C which share the same class of Kripke-frames with L. A celebrated result on Kripke-incompleteness…More>>