鸽子洞原理在超算术约简下的弱点

IF 0.9 1区 数学 Q1 LOGIC
B. Monin, Ludovic Patey
{"title":"鸽子洞原理在超算术约简下的弱点","authors":"B. Monin, Ludovic Patey","doi":"10.1142/S0219061321500136","DOIUrl":null,"url":null,"abstract":"The infinite pigeonhole principle for 2-partitions ([Formula: see text]) asserts the existence, for every set [Formula: see text], of an infinite subset of [Formula: see text] or of its complement. In this paper, we study the infinite pigeonhole principle from a computability-theoretic viewpoint. We prove in particular that [Formula: see text] admits strong cone avoidance for arithmetical and hyperarithmetical reductions. We also prove the existence, for every [Formula: see text] set, of an infinite low[Formula: see text] subset of it or its complement. This answers a question of Wang. For this, we design a new notion of forcing which generalizes the first and second-jump control of Cholak et al.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2019-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"The weakness of the pigeonhole principle under hyperarithmetical reductions\",\"authors\":\"B. Monin, Ludovic Patey\",\"doi\":\"10.1142/S0219061321500136\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The infinite pigeonhole principle for 2-partitions ([Formula: see text]) asserts the existence, for every set [Formula: see text], of an infinite subset of [Formula: see text] or of its complement. In this paper, we study the infinite pigeonhole principle from a computability-theoretic viewpoint. We prove in particular that [Formula: see text] admits strong cone avoidance for arithmetical and hyperarithmetical reductions. We also prove the existence, for every [Formula: see text] set, of an infinite low[Formula: see text] subset of it or its complement. This answers a question of Wang. For this, we design a new notion of forcing which generalizes the first and second-jump control of Cholak et al.\",\"PeriodicalId\":50144,\"journal\":{\"name\":\"Journal of Mathematical Logic\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2019-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Mathematical Logic\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1142/S0219061321500136\",\"RegionNum\":1,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"LOGIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Mathematical Logic","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1142/S0219061321500136","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"LOGIC","Score":null,"Total":0}
引用次数: 4

摘要

2分区的无限鸽子洞原理([公式:见文])断言存在,对于每一个集合[公式:见文],一个无限子集[公式:见文]或它的补。本文从可计算理论的角度研究了无限鸽子洞原理。我们特别证明了[公式:见文本]对于算术和超算术约简来说,承认强锥回避。我们也证明了对于每一个[公式:见文]集合,它的一个无穷低[公式:见文]子集或它的补集的存在性。这就回答了王的一个问题。为此,我们设计了一个新的强迫概念,它推广了Cholak等人的第一次和第二次跳跃控制。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The weakness of the pigeonhole principle under hyperarithmetical reductions
The infinite pigeonhole principle for 2-partitions ([Formula: see text]) asserts the existence, for every set [Formula: see text], of an infinite subset of [Formula: see text] or of its complement. In this paper, we study the infinite pigeonhole principle from a computability-theoretic viewpoint. We prove in particular that [Formula: see text] admits strong cone avoidance for arithmetical and hyperarithmetical reductions. We also prove the existence, for every [Formula: see text] set, of an infinite low[Formula: see text] subset of it or its complement. This answers a question of Wang. For this, we design a new notion of forcing which generalizes the first and second-jump control of Cholak et al.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Mathematical Logic
Journal of Mathematical Logic MATHEMATICS-LOGIC
CiteScore
1.60
自引率
11.10%
发文量
23
审稿时长
>12 weeks
期刊介绍: The Journal of Mathematical Logic (JML) provides an important forum for the communication of original contributions in all areas of mathematical logic and its applications. It aims at publishing papers at the highest level of mathematical creativity and sophistication. JML intends to represent the most important and innovative developments in the subject.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信