2000 character limit reached
Open Problems in Computability Theory and Descriptive Set Theory
Published 5 Jul 2025 in math.LO | (2507.03972v1)
Abstract: These open problems were presented in the Problem Sessions held during the Tianyuan Workshop on Computability Theory and Descriptive Set Theory, June 16-20, 2025. The problems are organized into sections named after their contributors, in the order of their presentations during the workshop. Notes were taken and compiled by Wei Dai, Feng Li, Ruiwen Li, Ming Xiao, Xu Wang, V\'ictor Hugo Ya~nez Salazar, and Yang Zheng.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.