Abstract
In this paper we prove the following theorem: For every notation of a constructive ordinal there exists a low 2-computably enumerable degree that is not splittable into two lower 2-computably enumerable degrees whose jumps belong to the corresponding Δ-level of the Ershov hierarchy.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have