\textit{CEA} operators and the ershov hierarchy

DOI10.3103/S1066369X21080089OpenAlexW3197368536MaRDI QIDQ2234455

I. I. Batyrshin, M. M. Yamaleev, Marat M. Arslanov

Publication date: 19 October 2021

Published in: Russian Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1066369x21080089

zbMATH Keywords

Ershov hierarchylow setcomputably enumerable setrelative enumerability

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX) Computability and recursion theory (03Dxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Turing jumps in the Ershov hierarchy
• Ershov hierarchy
• Interpolating \(d\)-r.e. and REA degrees between r.e. degrees
• Relative enumerability in Ershov's hierarchy
• On a hierarchy of sets. III
• Algorithmic Randomness and Complexity
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• Δ 2 0 -Mengen
• Relative enumerability in the difference hierarchy
• The Isolated D. R. E. Degrees are Dense in the R. E. Degrees
• Friedberg numberings in the Ershov hierarchy