关于显性选择的说明

IF 0.3 Q4 MATHEMATICS, APPLIED Computability-The Journal of the Association CiE Pub Date : 2023-10-10 DOI:10.3233/com-230458
Mathieu Hoyrup
{"title":"关于显性选择的说明","authors":"Mathieu Hoyrup","doi":"10.3233/com-230458","DOIUrl":null,"url":null,"abstract":"Overt choice was recently introduced and thoroughly studied by de Brecht, Pauly and Schröder. They give estimates on the Weihrauch degree of overt choice on various spaces, and relate it to the topological properties of the space. In this article, we pursue this line of research, answering some of the questions that were left open. We show that overt choice on the rationals is not limit-computable. We identify the Weihrauch degree of overt choice on the space of natural numbers with the co-finite topology. We prove that the quasi-Polish spaces are the countably-based T 0 -spaces on which a variant of overt choice, called Π ~ 2 0 overt choice, is continuous. It extends a previous result that holds in the class of T 1 -spaces. We also prove an effective version of this equivalence.","PeriodicalId":42452,"journal":{"name":"Computability-The Journal of the Association CiE","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2023-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Notes on overt choice\",\"authors\":\"Mathieu Hoyrup\",\"doi\":\"10.3233/com-230458\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Overt choice was recently introduced and thoroughly studied by de Brecht, Pauly and Schröder. They give estimates on the Weihrauch degree of overt choice on various spaces, and relate it to the topological properties of the space. In this article, we pursue this line of research, answering some of the questions that were left open. We show that overt choice on the rationals is not limit-computable. We identify the Weihrauch degree of overt choice on the space of natural numbers with the co-finite topology. We prove that the quasi-Polish spaces are the countably-based T 0 -spaces on which a variant of overt choice, called Π ~ 2 0 overt choice, is continuous. It extends a previous result that holds in the class of T 1 -spaces. We also prove an effective version of this equivalence.\",\"PeriodicalId\":42452,\"journal\":{\"name\":\"Computability-The Journal of the Association CiE\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2023-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computability-The Journal of the Association CiE\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3233/com-230458\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computability-The Journal of the Association CiE","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/com-230458","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

最近,德布莱希特(de Brecht)、保利(Pauly)和Schröder引入了显性选择,并对其进行了深入研究。给出了不同空间上的魏氏选择度的估计,并将其与空间的拓扑性质联系起来。在本文中,我们将继续进行这方面的研究,回答一些尚未解决的问题。我们证明了对有理数的公开选择是不可极限计算的。我们用共有限拓扑确定了自然数空间上明显选择的Weihrauch度。我们证明了拟波兰空间是基于可数的T - 0空间,在T - 0空间上公开选择的一个变体Π ~ 20公开选择是连续的。它扩展了先前在t1 -空间类中成立的结果。我们也证明了这个等价的一个有效版本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Notes on overt choice
Overt choice was recently introduced and thoroughly studied by de Brecht, Pauly and Schröder. They give estimates on the Weihrauch degree of overt choice on various spaces, and relate it to the topological properties of the space. In this article, we pursue this line of research, answering some of the questions that were left open. We show that overt choice on the rationals is not limit-computable. We identify the Weihrauch degree of overt choice on the space of natural numbers with the co-finite topology. We prove that the quasi-Polish spaces are the countably-based T 0 -spaces on which a variant of overt choice, called Π ~ 2 0 overt choice, is continuous. It extends a previous result that holds in the class of T 1 -spaces. We also prove an effective version of this equivalence.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.10
自引率
16.70%
发文量
11
期刊最新文献
Enumerations of families closed under finite differences Nearly computable real numbers Notes on overt choice Lowness properties for strong reducibilities and the computational power of maximal sets Algorithmically random series
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1