Invited Speakers
Juan Aguilera (Vienna University of Technology, Austria). Determinacy in second-order arithmetic. [abstract] [video]
George Barmpalias (Institute of Software, Chinese Academy of Sciences). Path-random trees and models of arithmetic. [abstract] [slides] [video]
Lorenzo Carlucci (Sapienza University of Rome, Italy). On the effective content of restrictions and variants of Hindman's Finite Sums Theorem. [abstract] [slides] [video]
Longyun Ding (Nankai University, China). On equivalence relations induced by Polish groups. [abstract] [slides] [video]
Marat Faizrakhmanov (Kazan Federal University, Russia). Numberings and the Recursion Theorems. [abstract] [slides] [video]
Akitoshi Kawamura (Kyoto University, Japan). Subrecursive translations between irrational number representations. [abstract]
Bakh Khoussainov (University of Electronic Science and Technology of China). Exotic examples of automatic structures. [abstract] [slides] [video]
Nurlan Kogabaev (Sobolev Institute of Mathematics, Russia). Complexity of the problem of Horn representability for sentences. [abstract] [slides] [video]
Alexander Melnikov (Victoria University of Wellington, New Zealand). Computable topological groups. [abstract] [slides] [video]
Russell Miller (City University of New York, USA). Computability and the absolute Galois group of ℚ. [abstract] [slides] [video]
Holger Thies (Kyoto University, Japan). Formal verification and program extraction for efficient computations over real numbers and hyperspaces. [abstract] [slides] [video]
Guohua Wu (Nanyang Technological University, Singapore). More on cuppings in computably enumerable degrees. [abstract] [slides] [video]
Yue Yang (National University of Singapore). Some generalizations of Posner-Robinson Theorem. [abstract] [slides] [video]