Kazan (Volga region) Federal University, KFU
KAZAN
FEDERAL UNIVERSITY
 
CEA-OPERATORS AND THE ERSHOV HIERARCHY
Form of presentationArticles in international journals and collections
Year of publication2025
Языканглийский
  • Arslanov Marat Mirzaevich, author
  • Yamaleev Mars Mansurovich, author
  • Batyrshin Ilnur Ildarovich, author
  • Bibliographic description in the original language Arslanov M.M, Batyrshin I.I, Yamaleev M.M., CEA-Operators and the Ershov Hierarchy. II//Algebra and Logic. - 2024. - Vol.63, Is.4. - P.235-248.
    Annotation the main result: there is a computably enumerable set A such that any CEA(A) set W have a computably enumerable degree. This theorem answers to an open problem posed in several papers.
    Keywords Turing degree, CEA-set, Ershov hierarchy, reducibility
    The name of the journal Algebra and Logic
    Please use this ID to quote from or refer to the card https://repository.kpfu.ru/eng/?p_id=317263&p_lang=2

    Full metadata record