Reductions between types of numberings (Q2326424)

In this article, the authors obtain a wide collection of results concerning \(k\)-r.e. numberings, \(k\) a positive integer, left-r.e. numberings and \(\alpha\)-r.e. numberings for recursive ordinals \(\alpha\geq \omega\). From the summary: ``This paper considers reductions between types of numberings; these reductions preserve the Rogers semilattice of the numberings reduced and also preserve the number of minimal and positive degrees in their semilattice. It is shown how to use these reductions to simplify some constructions of specific semilattices. Furthermore, it is shown that for the basic types of numberings, one can reduce the left-r.e. numberings to the r.e. numberings and the \(k\)-r.e. numberings to the \((k+1)\)-r.e. numberings; all further reductions are obtained by concatenating these reductions.''