TD implies CCR
Assuming $\mathrm{ZF}$, we prove that Turing determinacy ($\mathrm{TD}$) implies countable choice axiom for sets of reals ($\mathrm{CCR}$).
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Peng, Yinhe Yu, Liang |
| description | Assuming $\mathrm{ZF}$, we prove that Turing determinacy ($\mathrm{TD}$)
implies countable choice axiom for sets of reals ($\mathrm{CCR}$). |
| doi_str_mv | 10.48550/arxiv.2012.10003 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2012_10003</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2012_10003</sourcerecordid><originalsourceid>FETCH-LOGICAL-a673-1dd9c588caf31ef0d332c83605c37ed2215c6755e87f819fb26dc7e13964e9a93</originalsourceid><addsrcrecordid>eNotzrsKwjAUgOEsDlJ1d7Iv0HqS09xGiVcoCNK9xFwg0EJpQfTtxcv0bz8fIWsKZaU4h60dn-lRMqCspACAc7Jq9nnqhy6FKTfmtiCzaLspLP_NSHM8NOZc1NfTxezqwgqJBfVeO66UsxFpiOARmVMogDuUwTNGuROS86BkVFTHOxPeyUBRiypoqzEjm9_2C2qHMfV2fLUfWPuF4RtnDi_3</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>TD implies CCR</title><source>arXiv.org</source><creator>Peng, Yinhe ; Yu, Liang</creator><creatorcontrib>Peng, Yinhe ; Yu, Liang</creatorcontrib><description>Assuming $\mathrm{ZF}$, we prove that Turing determinacy ($\mathrm{TD}$)
implies countable choice axiom for sets of reals ($\mathrm{CCR}$).</description><identifier>DOI: 10.48550/arxiv.2012.10003</identifier><language>eng</language><subject>Mathematics - Logic</subject><creationdate>2020-12</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2012.10003$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2012.10003$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Peng, Yinhe</creatorcontrib><creatorcontrib>Yu, Liang</creatorcontrib><title>TD implies CCR</title><description>Assuming $\mathrm{ZF}$, we prove that Turing determinacy ($\mathrm{TD}$)
implies countable choice axiom for sets of reals ($\mathrm{CCR}$).</description><subject>Mathematics - Logic</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrsKwjAUgOEsDlJ1d7Iv0HqS09xGiVcoCNK9xFwg0EJpQfTtxcv0bz8fIWsKZaU4h60dn-lRMqCspACAc7Jq9nnqhy6FKTfmtiCzaLspLP_NSHM8NOZc1NfTxezqwgqJBfVeO66UsxFpiOARmVMogDuUwTNGuROS86BkVFTHOxPeyUBRiypoqzEjm9_2C2qHMfV2fLUfWPuF4RtnDi_3</recordid><startdate>20201217</startdate><enddate>20201217</enddate><creator>Peng, Yinhe</creator><creator>Yu, Liang</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20201217</creationdate><title>TD implies CCR</title><author>Peng, Yinhe ; Yu, Liang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a673-1dd9c588caf31ef0d332c83605c37ed2215c6755e87f819fb26dc7e13964e9a93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Mathematics - Logic</topic><toplevel>online_resources</toplevel><creatorcontrib>Peng, Yinhe</creatorcontrib><creatorcontrib>Yu, Liang</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Peng, Yinhe</au><au>Yu, Liang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>TD implies CCR</atitle><date>2020-12-17</date><risdate>2020</risdate><abstract>Assuming $\mathrm{ZF}$, we prove that Turing determinacy ($\mathrm{TD}$)
implies countable choice axiom for sets of reals ($\mathrm{CCR}$).</abstract><doi>10.48550/arxiv.2012.10003</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2012.10003 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2012_10003 |
| source | arXiv.org |
| subjects | Mathematics - Logic |
| title | TD implies CCR |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T23%3A48%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=TD%20implies%20CCR&rft.au=Peng,%20Yinhe&rft.date=2020-12-17&rft_id=info:doi/10.48550/arxiv.2012.10003&rft_dat=%3Carxiv_GOX%3E2012_10003%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |