可计算性理论与描述集合论 研讨会(Computability Theory and Descriptive Set Theory)

2025.05.20

召集人:高速(南开大学,教授)、丁龙云(南开大学,教授)、杨跃(新加坡国立大学,教授)、刘路(中南大学,教授)

时间:2025.06.15—2025.06.21


Schedule


Jun. 16

Beijing Time

Speaker& Title

AM

7:30-8:30

Breakfast

8:30-9:20

Opening ceremony

Andre Nies: Profinite groups and computability theory

9:20-10:00

Tea Break

10:00-10:50

Yang Zheng: Rigid theorem on disconnected Polish groups

10:50-11:10

Break

11:10-12:00

Theodore Slaman: Gauge Dimension and the Borel Hierarchy


12:00-13:00

Lunch

PM

14:00-15:30

Problem Session: Yue Yang

15:30-16:00

Tea Break

16:00-17:30

Problem Session: Su Gao

17:30-19:00

Dinner

 

Jun. 17

Beijing Time

Speaker& Title

AM

7:30-8:30

Breakfast

8:30-9:20

Chong Chi Tat: Definable solutions of combinatorial principles

9:20-10:00

Tea Break

10:00-10:50

Nikolay Bazhenov: On reducibilities for computably enumerable equivalence relations

10:50-11:10

Break

11:10-12:00

Wei Wang: Connectivity, Ramsey's Theorem and Reverse Mathematics


12:00-13:00

Lunch

PM

14:00-15:30

Collaboration Sessions

15:30-16:00

Tea Break

16:00-17:30

Collaboration Sessions

17:30-19:00

Dinner

 

Jun. 18

Beijing Time

Speaker& Title

AM

7:30-8:30

Breakfast

8:30-9:20

Riley Thornton: Topological weak containment

Photo

9:20-10:00

Tea Break

10:00-10:50

Ming Xiao:Z -orders and hyperhyperfinite Borel equivalence relations

10:50-11:10

Break

11:10-12:00

Shichang Song: Applications of nonstandard analysis to graphon theory


12:00-13:00

Lunch

PM

14:00-17:30

Free Discussions

17:30-19:00

Dinner

 

Jun. 19

Beijing Time

Speaker& Title

AM

7:30-8:30

Breakfast

8:30-9:20

Jing Yu: Embedding Borel graphs into grids

9:20-10:00

Tea Break

10:00-10:50

Jialiang He: Regularity properties and pathological sets

10:50-11:10

Break

11:10-12:00

Keng Meng Ng: Degree structures in computability


12:00-13:00

Lunch

PM

14:00-15:30

Collaboration Sessions

15:30-16:00

Tea Break

16:00-17:30

Problem Session: Yue Yang, Su Gao

17:30-19:00

Dinner

 

Jun. 20

Beijing Time

Speaker& Title

AM

7:30-8:30

Breakfast

8:30-9:20

Nan Fang: Speedability of computably approximable reals and their approximations

9:20-10:00

Tea Break

10:00-10:50

George Barmpalias: Computable oneway functions on the reals

10:50-11:10

Break

11:10-12:00

Guohua Wu: Sacks Splitting Theorem Revisited

Closing Ceremony


12:00-13:00

Lunch

PM

14:00-17:30

Free Discussions

17:30-19:00

Dinner

 

Schedule and Abstract20250613_页面_07.jpg

Schedule and Abstract20250613_页面_08.jpg


Schedule and Abstract20250613_页面_09.jpg

Schedule and Abstract20250613_页面_10.jpg

Schedule and Abstract20250613_页面_11.jpg

Schedule and Abstract20250613_页面_12.jpg

Schedule and Abstract20250613_页面_13.jpg

Schedule and Abstract20250613_页面_14.jpg

Schedule and Abstract20250613_页面_15.jpg

Schedule and Abstract20250613_页面_16.jpg

Schedule and Abstract20250613_页面_17.jpg