{"title":"递归抛光空间","authors":"Tyler Arant","doi":"10.1007/s00153-023-00883-5","DOIUrl":null,"url":null,"abstract":"<div><p>This paper is concerned with the proper way to effectivize the notion of a Polish space. A theorem is proved that shows the recursive Polish space structure is not found in the effectively open subsets of a space <span>\\({\\mathcal {X}}\\)</span>, and we explore strong evidence that the effective structure is instead captured by the effectively open subsets of the product space <span>\\(\\mathbb {N}\\times {\\mathcal {X}}\\)</span>.\n</p></div>","PeriodicalId":48853,"journal":{"name":"Archive for Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2023-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00153-023-00883-5.pdf","citationCount":"0","resultStr":"{\"title\":\"Recursive Polish spaces\",\"authors\":\"Tyler Arant\",\"doi\":\"10.1007/s00153-023-00883-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper is concerned with the proper way to effectivize the notion of a Polish space. A theorem is proved that shows the recursive Polish space structure is not found in the effectively open subsets of a space <span>\\\\({\\\\mathcal {X}}\\\\)</span>, and we explore strong evidence that the effective structure is instead captured by the effectively open subsets of the product space <span>\\\\(\\\\mathbb {N}\\\\times {\\\\mathcal {X}}\\\\)</span>.\\n</p></div>\",\"PeriodicalId\":48853,\"journal\":{\"name\":\"Archive for Mathematical Logic\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2023-06-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s00153-023-00883-5.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Archive for Mathematical Logic\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00153-023-00883-5\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Arts and Humanities\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Archive for Mathematical Logic","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00153-023-00883-5","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Arts and Humanities","Score":null,"Total":0}
This paper is concerned with the proper way to effectivize the notion of a Polish space. A theorem is proved that shows the recursive Polish space structure is not found in the effectively open subsets of a space \({\mathcal {X}}\), and we explore strong evidence that the effective structure is instead captured by the effectively open subsets of the product space \(\mathbb {N}\times {\mathcal {X}}\).
期刊介绍:
The journal publishes research papers and occasionally surveys or expositions on mathematical logic. Contributions are also welcomed from other related areas, such as theoretical computer science or philosophy, as long as the methods of mathematical logic play a significant role. The journal therefore addresses logicians and mathematicians, computer scientists, and philosophers who are interested in the applications of mathematical logic in their own field, as well as its interactions with other areas of research.