澄清序数

arXiv - MATH - Logic Pub Date : 2024-08-19 DOI:arxiv-2408.10367

Noah Schweber

{"title":"澄清序数","authors":"Noah Schweber","doi":"arxiv-2408.10367","DOIUrl":null,"url":null,"abstract":"We use forcing over admissible sets to show that, for every ordinal $\\alpha$\nin a club $C\\subset\\omega_1$, there are copies of $\\alpha$ such that the\nisomorphism between them is not computable in the join of the complete\n$\\Pi^1_1$ set relative to each copy separately. Assuming $\\mathsf{V=L}$, this\nis close to optimal; on the other hand, assuming large cardinals the same (and\nmore) holds for every projective functional.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Clarifying ordinals\",\"authors\":\"Noah Schweber\",\"doi\":\"arxiv-2408.10367\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We use forcing over admissible sets to show that, for every ordinal $\\\\alpha$\\nin a club $C\\\\subset\\\\omega_1$, there are copies of $\\\\alpha$ such that the\\nisomorphism between them is not computable in the join of the complete\\n$\\\\Pi^1_1$ set relative to each copy separately. Assuming $\\\\mathsf{V=L}$, this\\nis close to optimal; on the other hand, assuming large cardinals the same (and\\nmore) holds for every projective functional.\",\"PeriodicalId\":501306,\"journal\":{\"name\":\"arXiv - MATH - Logic\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2408.10367\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.10367","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们使用对可容许集的强迫来证明，对于在一个俱乐部$C/subset/omega_1$中的每一个序$\alpha$，都有$\alpha$的副本，使得它们之间的同构在相对于每个副本的完整$Pi^1_1$集的连接中是不可计算的。假定 $\mathsf{V=L}$，这接近于最优；另一方面，假定有大红心，则对每一个射影函数都同样成立（而且更成立）。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Clarifying ordinals

We use forcing over admissible sets to show that, for every ordinal $\alpha$ in a club $C\subset\omega_1$, there are copies of $\alpha$ such that the isomorphism between them is not computable in the join of the complete $\Pi^1_1$ set relative to each copy separately. Assuming $\mathsf{V=L}$, this is close to optimal; on the other hand, assuming large cardinals the same (and more) holds for every projective functional.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

arXiv - MATH - Logic

自引率

0.00%

发文量