There exists a nonrecursive c.e. set A such that for every X ≡_m A there is a c.e. B ≡_m A with X ≰_fo B, so the m-degree of A contains no least finite-one degree.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.LO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Nonrecursive D-maximal many-one degrees contain least finite-one degrees.
citing papers explorer
-
A computably enumerable many-one degree with no least finite-one degree
There exists a nonrecursive c.e. set A such that for every X ≡_m A there is a c.e. B ≡_m A with X ≰_fo B, so the m-degree of A contains no least finite-one degree.
-
\texorpdfstring{$D$}{D}-maximal many-one degrees contain least finite-one degrees
Nonrecursive D-maximal many-one degrees contain least finite-one degrees.