枚举度中的强最小对

IF 0.6 2区数学 Q2 LOGIC Annals of Pure and Applied Logic Pub Date : 2024-05-28 DOI:10.1016/j.apal.2024.103464

Josiah Jacobsen-Grocott

{"title":"枚举度中的强最小对","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":"{\"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}","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

摘要

我们证明了在枚举度中存在强极小对，并且强极小对的左侧和右侧的度包括 Σ20 度，尽管在 Σ20 枚举度中是否存在强极小对还是未知数。我们定义了一种更强的极小对，称为强超极小对，并证明在枚举度中不存在强超极小对，从而回答了 Lempp 等人提出的问题[6]。我们对枚举度中是否存在超极小对这个问题保持开放态度。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Strong minimal pairs in the enumeration degrees

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 $Σ_{2}^{0}$ degrees, although it is unknown if there is a strong minimal pair in the $Σ_{2}^{0}$ 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.

求助全文

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

来源期刊

Annals of Pure and Applied Logic 数学-数学

CiteScore

1.40

自引率

12.50%

发文量

审稿时长

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.

期刊最新文献

Dividing and forking in random hypergraphs Editorial Board Saturation properties for compositional truth with propositional correctness Foundations of iterated star maps and their use in combinatorics Theories of Frege structure equivalent to Feferman's system T0