\textit{CEA} operators and the ershov hierarchy

DOI10.3103/S1066369X21080089MaRDI QIDQ2234455zbMATH OpenOpenAlexFDO

Authors I. I. Batyrshin, M. M. Yamaleev, M. 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

computably enumerable setErshov hierarchylow setrelative enumerability

Mathematics Subject Classification ID

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

Recommendations

• Post's Programme for the Ershov Hierarchy
• Relative enumerability in Ershov's hierarchy
• Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy
• Classifying equivalence relations in the Ershov hierarchy
• Turing degrees and the Ershov hierarchy

Cites work

• Algorithmic randomness and complexity.
• Ershov hierarchy
• Friedberg numberings in the Ershov hierarchy
• scientific article; zbMATH DE number 3809539 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 841082 (Why is no real title available?)
• scientific article; zbMATH DE number 3342831 (Why is no real title available?)
• Interpolating d-r.e. and REA degrees between r.e. degrees
• On a hierarchy of sets. III
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• Relative enumerability in Ershov's hierarchy
• Relative enumerability in the difference hierarchy
• The Ershov hierarchy
• The Isolated D. R. E. Degrees are Dense in the R. E. Degrees
• Turing jumps in the Ershov hierarchy
• Δ 2 0 -Mengen

This page was built for publication: \textit{CEA} operators and the ershov hierarchy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2234455)