Kazan (Volga region) Federal University, KFU
KAZAN
FEDERAL UNIVERSITY
 
ON THE PROBLEM OF DEfiNABILITY OF THE COMPUTABLY ENUMERABLE DEGREES IN THE DIffERENCE HIERARCHY
Form of presentationArticles in Russian journals and collections
Year of publication2018
Языканглийский
  • Arslanov Marat Mirzaevich, author
  • Bibliographic description in the original language M.M. Arslanov, M.M. Yamaleev, On the Problem of Definability of the Computably Enumerable Degrees in the Difference Hierarchy// Lobachevskii Journal of Mathematics, 2018, Vol. 39, No. 5, pp. 634–638.
    Annotation Questions of definability of computably enumerable degrees in the difference hierarchy (degreesofsetsfromfinitelevelsofthe Ershovdifferencehierarchy)arestudied. Severalapproaches to the solutionof this problemare outlined
    Keywords computable function, Turing degree, semi-lattice, difference hierarchy
    The name of the journal Lobachevskii Journal of Math.
    URL https://www.springer.com/mathematics/journal/12202
    Please use this ID to quote from or refer to the card https://repository.kpfu.ru/eng/?p_id=179347&p_lang=2

    Full metadata record