可定义性与计算研讨会

2026.05.19

召集人:

高速,南开大学,数学科学学院,教授;

吴刘臻,中国科学院数学与系统科学研究院,副研究员;

杨跃,新加坡国立大学,数学院,教授


时间:2026.06.21—2026.06.27


Program


June21-27,2026 Tianyuan Mathematics Research Center,Kunming,YunnanProvince

Jun.22

BeijingTime

Schedule

Location

7:30-9:00

Breakfast

Hua Luogeng

Lecture Hall

AM

9:00-9:40

Philip Welch, University of Bristol

Title :Higher Type ITTM recursion and Determinacy

9:40-10:00

Break

10:00-10:40

Alexander Melnikov, Victoria University of Wellington

Title: Computable classification: the twilight zone

10:40-10:50

Break

10:50-11:30

Rizos Sklinos, Chinese Academy of Sciences

Title: On the superstable part of the free group

12:00-13:00

Lunch

PM

14:00-15:30

Problem Session

Chair:Yue Yang

15:30-16:00

Break

16:00-17:30

Problem Session

Chair: Liuzhen Wu

17:30-19:00

Dinner

 

 

Jun.23

BeijingTime

Schedule

Location

7:30-9:00

Breakfast

Hua Luogeng

Lecture Hall

AM

9:00-9:40

Gianluca Paolini, University of Turin
Title: On the isomorphism problem for procountable groups and oligomorphic groups

9:40-10:00

Break

10:00-10:25

Ruiwen Li, Nankai University

Title: Orbit Equivalence of Cantor Minimal Systems

10:25-10:40

Break

10:40-11:05

Tianhao Wang, NankaiUniversity
Title: Strong marker sets for arbitrary generating sets

11:05-11:20

Break

11:20-12:00

Andre Nies, University of Auckland
Title: Turning non-Archimedean groups into countable structures

12:00-13:00

Lunch

PM

14:00-15:30

Collaboration Sessions

15:30-16:00

Break

16:00-17:30

Collaboration Sessions

17:30-19:00

Dinner

 

 

Jun.24

BeijingTime

Schedule

Location

7:30-9:00

Breakfast

Hua Luogeng

Lecture Hall

AM

9:00-9:40

Wei Wang, SunYat-Sen University
Title: Iterated jumps of perfect subtrees of positive trees

9:40-10:00

Break

10:00-10:40

Daniel Max Hoffmann, University of Warsaw

Title: Ergodic decomposition in NIP theories

10:40-10:50

Break

10:50-11:30

Takayuki Kihara, Nagoya University
Title: Lawvere-Tierney topologies as combinatorial and computable complexity

12:00-13:00

Lunch

PM

14:00-17:30

Free Discussions

17:30-19:00

Dinner

 

 

Jun.25

BeijingTime

Schedule

Location

7:30-9:00

Breakfast

Hua Luogeng

Lecture Hall

AM

9:00-9:40

Jialiang He, Sichuan University
Title: Definability of Maximal Eventually Different Families over Ideals

9:40-10:00

Break

10:00-10:25

Guozhen Shen, SunYat-Sen University

Title: Accounts of Set Size and the Axiom of Choice

10:25-10:40

Break

10:40-11:05

Philipp Schlicht, University of Siena
Title:The Wadgehierarchy for generalized Cantor spaces

11:05-11:20

Break

11:20-12:00

Noam Greenberg, Victoria University of Wellington

Title: Borel graph colourings and untagging

12:00-13:00

Lunch

PM

14:00-15:30

Collaboration Sessions

15:30-16:00

Break

16:00-17:30

Problem Session

Chair: Su Gao

17:30-19:00

Dinner

 

 

Jun.26

BeijingTime

Schedule

Location

7:30-9:00

Breakfast

Hua Luogeng

Lecture Hall

AM

9:00-9:40

Ted Slaman, University of California Berkeley

Title:Hausdorff Dimension and the Borel Hierarchy

9:40-10:00

Break

10:00-10:40

Goh Jun Le, National University of Singapore

Title: A recursion-theoretic analogue of Morley's categoricity theorem

10:40-10:50

Break

10:50-11:30

Ningyuan Yao, Fudan University
Title: Newelski’s Conjecture for -Minimal and -Adic Definable Groups

12:00-13:00

Lunch

PM

14:00-17:30

Free Discussions

17:30-19:00

Dinner

 

Title and Abstract

可定义性与计算研讨会