English

TD implies CCR

Logic 2020-12-22 v2

Abstract

Assuming ZF\mathrm{ZF}, we prove that Turing determinacy (TD\mathrm{TD}) implies countable choice axiom for sets of reals (CCR\mathrm{CCR}).

Keywords

Cite

@article{arxiv.2012.10003,
  title  = {TD implies CCR},
  author = {Yinhe Peng and Liang Yu},
  journal= {arXiv preprint arXiv:2012.10003},
  year   = {2020}
}
R2 v1 2026-06-23T21:03:59.288Z