$m$-Rigidity and Finite-One Degrees Inside Typical Many-One Degrees
Patrizio Cintioli

TL;DR
This paper investigates the structure of many-one degrees related to $m$-rigid sets, showing the existence of least finite-one degrees, infinitely many incomparable finite-one degrees, and ascending chains within a single finite-one degree.
Contribution
It provides new insights into the finite-one degree structure of $m$-rigid sets, including the existence of minimal degrees and infinite antichains, partially answering open problems.
Findings
Almost-sure existence of least finite-one degrees in many-one degrees.
Construction of infinitely many pairwise incomparable finite-one degrees.
Existence of strict ascending chains within a single finite-one degree.
Abstract
In recent work, the notion of -rigidity was introduced as a sufficient condition for the existence of infinite antichains of -degrees inside many-one degrees. Motivated by a recent preprint of Richter, Stephan, and Zhang on finite-one degrees inside many-one degrees, we study the finite-one structure of the many-one degree of an -rigid set. First, combining bi-immunity of -rigid sets with a theorem of Richter, Stephan, and Zhang, we show that for Lebesgue-almost every set , and for a comeager class of sets , the many-one degree contains a least finite-one degree. Second, we prove that if is -rigid, then contains infinitely many pairwise incomparable finite-one degrees. More precisely, we construct representatives , indexed by computable sets , such that infinite implies . Third,…
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 · semigroups and automata theory · Advanced Topology and Set Theory
