Strong minimal pairs in the enumeration degrees

IF 0.6 2区 数学 Q2 LOGIC
Josiah Jacobsen-Grocott
{"title":"Strong minimal pairs in the enumeration degrees","authors":"Josiah Jacobsen-Grocott","doi":"10.1016/j.apal.2024.103464","DOIUrl":null,"url":null,"abstract":"<div><p>We prove that there are strong minimal pairs in the enumeration degrees and that the degrees of the left and right sides of strong minimal pairs include <span><math><msubsup><mrow><mi>Σ</mi></mrow><mrow><mn>2</mn></mrow><mrow><mn>0</mn></mrow></msubsup></math></span> degrees, although it is unknown if there is a strong minimal pair in the <span><math><msubsup><mrow><mi>Σ</mi></mrow><mrow><mn>2</mn></mrow><mrow><mn>0</mn></mrow></msubsup></math></span> enumeration degrees. We define a stronger type of minimal pair we call a strong super minimal pair, and show that there are none of these in the enumeration degrees, answering a question of Lempp et al. <span>[6]</span>. We leave open the question of the existence of a super minimal pair in the enumeration degrees.</p></div>","PeriodicalId":50762,"journal":{"name":"Annals of Pure and Applied Logic","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2024-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Pure and Applied Logic","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0168007224000629","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"LOGIC","Score":null,"Total":0}
引用次数: 0

Abstract

We prove that there are strong minimal pairs in the enumeration degrees and that the degrees of the left and right sides of strong minimal pairs include Σ20 degrees, although it is unknown if there is a strong minimal pair in the Σ20 enumeration degrees. We define a stronger type of minimal pair we call a strong super minimal pair, and show that there are none of these in the enumeration degrees, answering a question of Lempp et al. [6]. We leave open the question of the existence of a super minimal pair in the enumeration degrees.

枚举度中的强最小对
我们证明了在枚举度中存在强极小对,并且强极小对的左侧和右侧的度包括 Σ20 度,尽管在 Σ20 枚举度中是否存在强极小对还是未知数。我们定义了一种更强的极小对,称为强超极小对,并证明在枚举度中不存在强超极小对,从而回答了 Lempp 等人提出的问题[6]。我们对枚举度中是否存在超极小对这个问题保持开放态度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.40
自引率
12.50%
发文量
78
审稿时长
200 days
期刊介绍: The journal Annals of Pure and Applied Logic publishes high quality papers in all areas of mathematical logic as well as applications of logic in mathematics, in theoretical computer science and in other related disciplines. All submissions to the journal should be mathematically correct, well written (preferably in English)and contain relevant new results that are of significant interest to a substantial number of logicians. The journal also considers submissions that are somewhat too long to be published by other journals while being too short to form a separate memoir provided that they are of particular outstanding quality and broad interest. In addition, Annals of Pure and Applied Logic occasionally publishes special issues of selected papers from well-chosen conferences in pure and applied logic.
×
引用
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学术官方微信