Year: 2020
Type: preprint
Abstract: Assuming $\mathrm{ZF}$, we prove that Turing determinacy ($\mathrm{TD}$) implies countable choice axiom for sets of reals ($\mathrm{CCR}$).
Source: arXiv (Cornell University)
Authors: Peng, Yinhe, Yu, Liang
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4394646502