subTuring度
The subTuring degrees
AI总结:
本文提出自然数上部分函数的subTuring可归约性,证明subTuring度构成稠密非模格,并构造出不可分解为两个更小可实现性子拓扑斯的非零并不可约度。
摘要:
在本文中,我们为自然数上的部分函数引入一种可归约性概念,称之为subTuring可归约性。一个重要方面是,subTuring度对应于有效拓扑斯(effective topos)的可实现性子拓扑斯结构。我们证明subTuring度(即有效拓扑斯的可实现性子拓扑斯)构成一个稠密的非模格(因此也是非分配格)。我们还证明存在一个非零的并不可约subTuring度(这意味着存在一个有效拓扑斯的可实现性子拓扑斯,它不能被分解为两个更小的可实现性子拓扑斯)。
英文摘要:
In this article, we introduce a notion of reducibility for partial functions on the natural numbers, which we call subTuring reducibility. One important aspect is that the subTuring degrees correspond to the structure of the realizability subtoposes of the effective topos. We show that the subTuring degrees (that is, the realizability subtoposes of the effective topos) form a dense non-modular (thus, non-distributive) lattice. We also show that there is a nonzero join-irreducible subTuring degree (which implies that there is a realizability subtopos of the effective topos that cannot be decomposed into two smaller realizability subtoposes).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。