图灵确定性和Suslin集

Q4 Mathematics New Zealand Journal of Mathematics Pub Date : 2022-05-12 DOI:10.53733/140
W. Woodin
{"title":"图灵确定性和Suslin集","authors":"W. Woodin","doi":"10.53733/140","DOIUrl":null,"url":null,"abstract":"The relationship between the Axiom of Determinacy (AD) and the Axiom of Turing Determinacy has been open for over 50 years, and the attempts to understand that relationship has had a profound influence on Set Theory in a variety of ways. The prevailing conjecture is that these two determinacy hypotheses are actually equivalent, and the main theorem of this paper is that Turing Determinacy implies that every Suslin set is determined.","PeriodicalId":30137,"journal":{"name":"New Zealand Journal of Mathematics","volume":"461 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Turing Determinacy and Suslin sets\",\"authors\":\"W. Woodin\",\"doi\":\"10.53733/140\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The relationship between the Axiom of Determinacy (AD) and the Axiom of Turing Determinacy has been open for over 50 years, and the attempts to understand that relationship has had a profound influence on Set Theory in a variety of ways. The prevailing conjecture is that these two determinacy hypotheses are actually equivalent, and the main theorem of this paper is that Turing Determinacy implies that every Suslin set is determined.\",\"PeriodicalId\":30137,\"journal\":{\"name\":\"New Zealand Journal of Mathematics\",\"volume\":\"461 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-05-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"New Zealand Journal of Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.53733/140\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"New Zealand Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.53733/140","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 1

摘要

确定性公理(AD)和图灵确定性公理之间的关系已经开放了50多年,并且试图理解这种关系在各种方面对集合论产生了深远的影响。流行的猜想是这两个确定性假设实际上是等价的,本文的主要定理是图灵确定性意味着每个Suslin集合都是确定的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Turing Determinacy and Suslin sets
The relationship between the Axiom of Determinacy (AD) and the Axiom of Turing Determinacy has been open for over 50 years, and the attempts to understand that relationship has had a profound influence on Set Theory in a variety of ways. The prevailing conjecture is that these two determinacy hypotheses are actually equivalent, and the main theorem of this paper is that Turing Determinacy implies that every Suslin set is determined.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
New Zealand Journal of Mathematics
New Zealand Journal of Mathematics Mathematics-Algebra and Number Theory
CiteScore
1.10
自引率
0.00%
发文量
11
审稿时长
50 weeks
期刊最新文献
note on weak w-projective modules Robin inequality for n/phi(n) Bent-half space model problem for Lame equation with surface tension $k$-rational homotopy fixed points, $k\in \Bbb N$ note on the regularity criterion for the micropolar fluid equations in homogeneous Besov spaces
×
引用
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