Электронный архив

Просмотр Публикации сотрудников КФУ Scopus по автору "Yamaleev M.M."

Просмотр Публикации сотрудников КФУ Scopus по автору "Yamaleev M.M."

Отсортировать по:Сортировать:Результаты поиска на странице:

  • CEA Operators and the Ershov Hierarchy 
    Arslanov M.M.; Batyrshin I.I.; Yamaleev M.M. (2021)
    We examine the relationship between the CEA hierarchy and the Ershov hierarchy within $\Delta_2^0$ Turing degrees. We study the long-standing problem raised in [1] about the existence of a low computably enumerable (c.e.) ...
  • Isolation from Side in 2-Computably Enumerable Degrees 
    Yamaleev M.M. (2020)
    © 2020, Allerton Press, Inc. In this work we consider isolation from side in different degree structures, in particular, in the 2-computably enumerable wtt-degrees and in low Turing degrees. Intuitively, a 2-computably ...
  • Minimal Equivalence Relations in Hyperarithmetical and Analytical Hierarchies 
    Bazhenov N.A.; Mustafa M.; San Mauro L.; Yamaleev M.M. (2020)
    © 2020, Pleiades Publishing, Ltd. Abstract: A standard tool for classifying the complexity of equivalence relations on ω is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The ...
  • Numberings in the Analytical Hierarchy 
    Bazhenov N.A.; Mustafa M.; Ospichev S.S.; Yamaleev M.M. (2020)
  • Strong Degrees of Categoricity and Weak Density 
    Bazhenov N.A.; Kalimullin I.S.; Yamaleev M.M. (2020)
    © 2020, Pleiades Publishing, Ltd. Abstract: It is well-known that every c.e. Turing degree is the degree of categoricity of a rigid structure. In this work we study the possibility of extension of this result to properly ...
  • Turing Computability: Structural Theory 
    Arslanov M.M.; Yamaleev M.M. (2021)
    In this work, we review results of the last years related to the development of the structural theory of n-c.e. Turing degrees for n > 1. We also discuss possible approaches to solution of the open problems.
  • Turing reducibility in the fine hierarchy 
    Melnikov A.G.; Selivanov V.L.; Yamaleev M.M. (2020)
    © 2019 Elsevier B.V. In the late 1980s, Selivanov used typed Boolean combinations of arithmetical sets to extend the Ershov hierarchy beyond Δ20 sets. Similar to the Ershov hierarchy, Selivanov's fine hierarchy {Σγ}γ<ε0 ...

Поиск в электронном архиве


Расширенный поиск

Просмотр

Моя учетная запись