1 citations · 1 across the 6 of their papers we have counts for
1 paper · 1 filter
Yinhe Peng, Liang Yu
Assuming ZF, we prove that Turing determinacy (TD) implies countable choice axiom for sets of reals (CCR).