TD implies CCR

DOI10.1016/J.AIM.2021.107755MaRDI QIDQ6356401arXivFDO

Authors Yinhe Peng, Liang Yu

Publication date 17 December 2020

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.AIM.2021.107755

Mathematics Subject Classification ID

Other Turing degree structures (03D28) Descriptive set theory (03E15) Axiom of choice and related propositions (03E25) Determinacy principles (03E60)

arXiv classification

math.LO

Abstract: Assuming $mathrmZF$, we prove that Turing determinacy ($mathrmTD$) implies countable choice axiom for sets of reals ($mathrmCCR$).

This page was built for publication: TD implies CCR

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6356401)