Kazan (Volga region) Federal University, KFU
KAZAN
FEDERAL UNIVERSITY
 
CEA OPERATORS AND THE ERSHOV HIERARCHY, I
Form of presentationArticles in international journals and collections
Year of publication2024
Языканглийский
  • Arslanov Marat Mirzaevich, author
  • Yamaleev Mars Mansurovich, author
  • Batyrshin Ilnur Ildarovich, author
  • Bibliographic description in the original language Arslanov M.M./CEA Operators and the Ershov Hierarchy, I/ M.M. Arslanov, I.I. Batyrshin , M.M. Yamaleev// Algebra an Logic. 2024. - v. 63.- №3. - P. 164-178
    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 CEA set, Turing degree, Ershov hierarchy, Turing degree of unsolvability of
    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=317260&p_lang=2

    Full metadata record