3 papers
math.LO2024
Countable Ordered Groups and Weihrauch Reducibility
Ang Li
This paper continues to study the connection between reverse mathematics and Weihrauch reducibility. In particular, we study the problems formed from Maltsev's theorem on the order…
math.LO2024
There is a deep 1-generic set
Ang Li
An infinite binary sequence is Bennett deep if, for any computable time bound, the difference between the time-bounded prefix-free Kolmogorov complexity and the prefix-free Kolmogo…
math.LO2024
Introenumerability, autoreducibility, and randomness
Ang Li
We define -autoreducible sets given an autoreduction procedure . Then, we show that for any , a measurable class of -autoreducible sets has measure zero. Using this, we…