关于寻找表征${>}\ \ ω ^2$ -易变递归可枚举图灵度的格

Liling Ko
{"title":"关于寻找表征${>}\\ \\ ω ^2$ -易变递归可枚举图灵度的格","authors":"Liling Ko","doi":"10.1017/bsl.2021.56","DOIUrl":null,"url":null,"abstract":"Abstract Given a finite lattice L that can be embedded in the recursively enumerable (r.e.) Turing degrees \n$\\langle \\mathcal {R}_{\\mathrm {T}},\\leq _{\\mathrm {T}}\\rangle $\n , we do not in general know how to characterize the degrees \n$\\mathbf {d}\\in \\mathcal {R}_{\\mathrm {T}}$\n below which L can be bounded. The important characterizations known are of the \n$L_7$\n and \n$M_3$\n lattices, where the lattices are bounded below \n$\\mathbf {d}$\n if and only if \n$\\mathbf {d}$\n contains sets of “fickleness” \n$>\\omega $\n and \n$\\geq \\omega ^\\omega $\n respectively. We work towards finding a lattice that characterizes the levels above \n$\\omega ^2$\n , the first non-trivial level after \n$\\omega $\n . We introduced a lattice-theoretic property called “ \n$3$\n -directness” to describe lattices that are no “wider” or “taller” than \n$L_7$\n and \n$M_3$\n . We exhaust the 3-direct lattices L, but they turn out to also characterize the \n$>\\omega $\n or \n$\\geq \\omega ^\\omega $\n levels, if L is not already embeddable below all non-zero r.e. degrees. We also considered upper semilattices (USLs) by removing the bottom meet(s) of some 3-direct lattices, but the removals did not change the levels characterized. This leads us to conjecture that a USL characterizes the same r.e. degrees as the lattice on which the USL is based. We discovered three 3-direct lattices besides \n$M_3$\n that also characterize the \n$\\geq \\omega ^\\omega $\n -levels. Our search for a \n$>\\omega ^2$\n -candidate therefore involves the lattice-theoretic problem of finding lattices that do not contain any of the four \n$\\geq \\omega ^\\omega $\n -lattices as sublattices. Abstract prepared by Liling Ko. E-mail: ko.390@osu.edu URL: http://sites.nd.edu/liling-ko/","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Towards Finding a Lattice that Characterizes the \\n${>}\\\\ \\\\omega ^2$\\n -Fickle Recursively Enumerable Turing Degrees\",\"authors\":\"Liling Ko\",\"doi\":\"10.1017/bsl.2021.56\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract Given a finite lattice L that can be embedded in the recursively enumerable (r.e.) Turing degrees \\n$\\\\langle \\\\mathcal {R}_{\\\\mathrm {T}},\\\\leq _{\\\\mathrm {T}}\\\\rangle $\\n , we do not in general know how to characterize the degrees \\n$\\\\mathbf {d}\\\\in \\\\mathcal {R}_{\\\\mathrm {T}}$\\n below which L can be bounded. The important characterizations known are of the \\n$L_7$\\n and \\n$M_3$\\n lattices, where the lattices are bounded below \\n$\\\\mathbf {d}$\\n if and only if \\n$\\\\mathbf {d}$\\n contains sets of “fickleness” \\n$>\\\\omega $\\n and \\n$\\\\geq \\\\omega ^\\\\omega $\\n respectively. We work towards finding a lattice that characterizes the levels above \\n$\\\\omega ^2$\\n , the first non-trivial level after \\n$\\\\omega $\\n . We introduced a lattice-theoretic property called “ \\n$3$\\n -directness” to describe lattices that are no “wider” or “taller” than \\n$L_7$\\n and \\n$M_3$\\n . We exhaust the 3-direct lattices L, but they turn out to also characterize the \\n$>\\\\omega $\\n or \\n$\\\\geq \\\\omega ^\\\\omega $\\n levels, if L is not already embeddable below all non-zero r.e. degrees. We also considered upper semilattices (USLs) by removing the bottom meet(s) of some 3-direct lattices, but the removals did not change the levels characterized. This leads us to conjecture that a USL characterizes the same r.e. degrees as the lattice on which the USL is based. We discovered three 3-direct lattices besides \\n$M_3$\\n that also characterize the \\n$\\\\geq \\\\omega ^\\\\omega $\\n -levels. Our search for a \\n$>\\\\omega ^2$\\n -candidate therefore involves the lattice-theoretic problem of finding lattices that do not contain any of the four \\n$\\\\geq \\\\omega ^\\\\omega $\\n -lattices as sublattices. Abstract prepared by Liling Ko. E-mail: ko.390@osu.edu URL: http://sites.nd.edu/liling-ko/\",\"PeriodicalId\":22265,\"journal\":{\"name\":\"The Bulletin of Symbolic Logic\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Bulletin of Symbolic Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1017/bsl.2021.56\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Bulletin of Symbolic Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1017/bsl.2021.56","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

给定一个有限格L,它可以嵌入到递归可枚举(r。图灵度$\langle \mathcal {R}_{\mathrm {T}},\leq _{\mathrm {T}}\rangle $,我们通常不知道如何描述度$\mathbf {d}\in \mathcal {R}_{\mathrm {T}}$以下L可以有界。已知的重要特征是$L_7$和$M_3$晶格,当且仅当$\mathbf {d}$分别包含“可变”集$>\omega $和$\geq \omega ^\omega $时,晶格被限定在$\mathbf {d}$以下。我们努力寻找一个格来表征$\omega ^2$以上的水平,这是$\omega $之后的第一个非平凡水平。我们引入了一种称为“$3$ -直接性”的晶格理论性质来描述不比$L_7$和$M_3$“宽”或“高”的晶格。我们耗尽了3-direct格L,但如果L还没有嵌入到所有非零r.e.度以下,它们也可以表征$>\omega $或$\geq \omega ^\omega $级别。我们还考虑了上半格(USLs),通过去除一些3-直格的底部会合,但去除并没有改变表征的水平。这使我们推测,USL的特征与USL所基于的晶格具有相同的r.e.度。除了$M_3$之外,我们还发现了三个3-直格,它们也表征了$\geq \omega ^\omega $ -水平。因此,我们对$>\omega ^2$ -候选者的搜索涉及到寻找不包含四个$\geq \omega ^\omega $ -格中的任何一个作为子格的格的晶格理论问题。[摘要]柯丽玲。电子邮件:ko.390@osu.edu URL: http://sites.nd.edu/liling-ko/
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Towards Finding a Lattice that Characterizes the ${>}\ \omega ^2$ -Fickle Recursively Enumerable Turing Degrees
Abstract Given a finite lattice L that can be embedded in the recursively enumerable (r.e.) Turing degrees $\langle \mathcal {R}_{\mathrm {T}},\leq _{\mathrm {T}}\rangle $ , we do not in general know how to characterize the degrees $\mathbf {d}\in \mathcal {R}_{\mathrm {T}}$ below which L can be bounded. The important characterizations known are of the $L_7$ and $M_3$ lattices, where the lattices are bounded below $\mathbf {d}$ if and only if $\mathbf {d}$ contains sets of “fickleness” $>\omega $ and $\geq \omega ^\omega $ respectively. We work towards finding a lattice that characterizes the levels above $\omega ^2$ , the first non-trivial level after $\omega $ . We introduced a lattice-theoretic property called “ $3$ -directness” to describe lattices that are no “wider” or “taller” than $L_7$ and $M_3$ . We exhaust the 3-direct lattices L, but they turn out to also characterize the $>\omega $ or $\geq \omega ^\omega $ levels, if L is not already embeddable below all non-zero r.e. degrees. We also considered upper semilattices (USLs) by removing the bottom meet(s) of some 3-direct lattices, but the removals did not change the levels characterized. This leads us to conjecture that a USL characterizes the same r.e. degrees as the lattice on which the USL is based. We discovered three 3-direct lattices besides $M_3$ that also characterize the $\geq \omega ^\omega $ -levels. Our search for a $>\omega ^2$ -candidate therefore involves the lattice-theoretic problem of finding lattices that do not contain any of the four $\geq \omega ^\omega $ -lattices as sublattices. Abstract prepared by Liling Ko. E-mail: ko.390@osu.edu URL: http://sites.nd.edu/liling-ko/
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
POUR-EL’S LANDSCAPE CATEGORICAL QUANTIFICATION POINCARÉ-WEYL’S PREDICATIVITY: GOING BEYOND A TOPOLOGICAL APPROACH TO UNDEFINABILITY IN ALGEBRAIC EXTENSIONS OF John MacFarlane, Philosophical Logic: A Contemporary Introduction, Routledge Contemporary Introductions to Philosophy, Routledge, New York, and London, 2021, xx + 238 pp.
×
引用
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