Relative enumerability in Ershov's hierarchy

DOI10.1134/S0001434608090198zbMath1160.03025OpenAlexW2081466021MaRDI QIDQ2518068

I. I. Batyrshin

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

zbMATH Keywords

Turing degreeconstructive ordinallimit ordinalErshov's hierarchycomputable functionrelative enumerability\(n\)-computable enumerability

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Hierarchies of computability and definability (03D55)

Related Items (2)

A classification of low c.e. sets and the Ershov hierarchy ⋮ \textit{CEA} operators and the ershov hierarchy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ershov hierarchy
• Relative enumerability in the difference hierarchy

This page was built for publication: Relative enumerability in Ershov's hierarchy