9 citations · 9 across the 6 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.LO2020
TD implies CCR
Yinhe Peng, Liang Yu
Assuming , we prove that Turing determinacy () implies countable choice axiom for sets of reals ().
math.LO2020
Luzin's (N) and randomness reflection
Arno Pauly, Linda Westrick, Liang Yu
We show that a computable function has Luzin's property (N) if and only if it reflects -randomnes, if and only if it reflects $Δ^1_1(\mathc…