Relative enumerability in Ershov's hierarchy
From MaRDI portal
Publication:2518068
DOI10.1134/S0001434608090198zbMath1160.03025MaRDI QIDQ2518068
Publication date: 12 January 2009
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434608090198
Turing degree; constructive ordinal; limit ordinal; Ershov's hierarchy; computable function; relative enumerability; \(n\)-computable enumerability
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
03D55: Hierarchies of computability and definability
Related Items
A classification of low c.e. sets and the Ershov hierarchy, \textit{CEA} operators and the ershov hierarchy
Cites Work