The subTuring degrees
Takayuki Kihara, Keng Meng Ng

TL;DR
This paper introduces subTuring reducibility for partial functions on natural numbers, revealing a complex lattice structure of realizability subtoposes of the effective topos with novel properties.
Contribution
It defines subTuring degrees and demonstrates their structure as a dense, non-modular lattice, highlighting new insights into realizability subtoposes.
Findings
SubTuring degrees form a dense, non-modular lattice.
Existence of a nonzero join-irreducible subTuring degree.
Realizability subtoposes have complex lattice properties.
Abstract
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).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · History and Theory of Mathematics
