Marat Mirzaevich Arslanov (on his eightieth birthday)
- Authors: Abyzov A.N.1, Beklemishev L.D.1, Goncharov S.S.1, Ershov Y.L.1, Kalimullin I.S.1, Selivanov V.L.1, Semenov A.L.1, Tuganbaev A.A.1, Faizrahmanov M.K.1
-
Affiliations:
- Issue: Vol 79, No 2 (2024)
- Pages: 189-193
- Section: Articles
- URL: https://journals.rcsi.science/0042-1316/article/view/255958
- DOI: https://doi.org/10.4213/rm10168
- ID: 255958
Cite item
Abstract
About the authors
Adel Nailevich Abyzov
Email: aabyzov@kpfu.ru
Scopus Author ID: http://www.scopus.com/authid/detail.url?authorId=1
Candidate of physico-mathematical sciences, Associate professor
Lev Dmitrievich Beklemishev
Email: lbekl@yandex.ru
ORCID iD: 0000-0002-2949-0600
Scopus Author ID: 6602096489
ResearcherId: F-7814-2013
Doctor of physico-mathematical sciences, no status
Sergey Savostyanovich Goncharov
Email: gonchar@math.nsc.ru
ORCID iD: 0000-0001-7465-1189
SPIN-code: 3645-1417
Scopus Author ID: 56377536800
ResearcherId: J-7221-2013
Doctor of physico-mathematical sciences, Professor
Yurii Leonidovich Ershov
Email: ershov@math.nsc.ru
Doctor of physico-mathematical sciences, Professor
Iskander Shagitovich Kalimullin
Email: Iskander.Kalimullin@kpfu.ru
Doctor of physico-mathematical sciences, Associate professor
Viktor L'vovich Selivanov
Email: vseliv@iis.nsk.su
Doctor of physico-mathematical sciences
Aleksei Lvovich Semenov
Email: alsemno@ya.ru
ORCID iD: 0000-0002-1785-2387
SPIN-code: 2289-1720
Scopus Author ID: 7402499019
ResearcherId: S-5268-2018
Doctor of physico-mathematical sciences, Professor
Askar Akanovich Tuganbaev
Email: tuganbaev@gmail.com
ORCID iD: 0000-0001-9582-3314
Scopus Author ID: 6701875762
ResearcherId: L-2435-2018
Doctor of physico-mathematical sciences, Professor
Marat Khaidarovich Faizrahmanov
Email: marat.faizrahmanov@gmail.com
ORCID iD: 0000-0002-4519-9696
SPIN-code: 7000-4283
Scopus Author ID: 36706020100
ResearcherId: K-7976-2015
Doctor of physico-mathematical sciences, no status
References
- М. М. Арсланов, “Об эффективно гиперпростых множествах”, Алгебра и логика, 8:2 (1969), 143–153
- М. М. Арсланов, Р. Ф. Надыров, В. Д. Соловьев, “Критерий полноты рекурсивно перечислимых множеств и некоторые обобщения теоремы о неподвижной точке”, Изв. вузов. Матем., 1977, № 4, 3–7
- М. М. Арсланов, “О некоторых обобщениях теоремы о неподвижной точке”, Изв. вузов. Матем., 1981, № 5, 9–16
- М. М. Арсланов, “Структурные свойства степеней ниже $O'$”, Докл. АН СССР, 283:2 (1985), 270–273
- M. M. Arslanov, “The recursion theorem, approximations, and classifying index sets of recursively enumerable sets”, Fundamentals of computation theory (Kazan', 1987), Lecture Notes in Comput. Sci., 278, Springer-Verlag, Berlin, 1987, 34–37
- М. М. Арсланов, “О структуре степеней ниже $0'$”, Изв. вузов. Матем., 1988, № 7, 27–33
- М. М. Арсланов, “Полнота в арифметической иерархии и неподвижные точки”, Алгебра и логика, 28:1 (1989), 3–17
- M. M. Arslanov, “On the structure of degrees below $0'$”, Recursion theory week (Oberwolfach, 1989), Lecture Notes in Math., 1432, Springer-Verlag, Berlin, 1990, 23–32
- M. M. Arslanov, S. Lempp, R. A. Shore, “Interpolating d-r.e. and REA degrees between r.e. degrees”, Ann. Pure Appl. Logic, 78:1-3 (1996), 29–56
- M. M. Arslanov, S. Lempp, R. A. Shore, “On isolating r.e. and isolated d-r.e. degrees”, Computability, enumerability, unsolvability, London Math. Soc. Lecture Note Ser., 224, Cambridge Univ. Press, Cambridge, 1996, 61–80
- M. Arslanov, “Degree structures in the local degree theory”, Complexity, logic, and recursion theory, Lecture Notes in Pure and Appl. Math., 187, Marcel Dekker, Inc., New York, 1997, 49–74
- M. M. Arslanov, G. L. LaForte, T. A. Slaman, “Relative enumerability in the difference hierarchy”, J. Symb. Log., 63:2 (1998), 411–420
- M. Arslanov, “Open questions about the $n$-c.e. degrees”, Computability theory and its applications (Boulder, CO, 1999), Contemp. Math., 257, Amer. Math. Soc., Providence, RI, 2000, 15–22
- М. М. Арсланов, “Таблично-полные множества и Колмогоровская сложность вычислений”, Юбилейный сборник избранных трудов членов Академии наук Республики Татарстан, Фолиант, Казань, 2002, 199–209
- M. M. Arslanov, “Truth-table complete computably enumerable sets”, Computability and models, Univ. Ser. Math., Kluwer Acad./Plenum Publ., New York, 2003, 1–10
- M. M. Arslanov, “Generalized tabular reducibilities in infinite levels of Ershov difference hierarchy”, Logical approaches to computational barriers (CiE' 2006), Report Series, Swansea, 2006, 15–23
- M. M. Arslanov, I. Sh. Kalimullin, S. Lempp, “On Downey's conjecture”, J. Symb. Log., 75:2 (2010), 401–441
- M. M. Arslanov, “The Ershov hierarchy”, Computability in context. Computation and logic in the real world, Imperial College Press, London, 2011, 49–100
- М. М. Арсланов, “Структурная теория степеней неразрешимости: достижения и открытые проблемы”, Алгебра и логика, 54:4 (2015), 529–535
- M. Arslanov, “Splitting and non-splitting in the difference hierarchy”, Math. Structures Comput. Sci., 28:3 (2018), 384–391
- M. M. Arslanov, M. M. Yamaleev, “On the problem of definability of the computably enumerable degrees in the difference hierarchy”, Lobachevskii J. Math., 39:5 (2018), 634–638
- M. M. Arslanov, “Fixed-point selection functions”, Lobachevskii J. Math., 42:4 (2021), 685–692
- M. M. Arslanov, “On a general method of constructing post reducibilities and the corresponding completeness criteria”, Lobachevskii J. Math., 43:12 (2022), 3430–3434
- М. М. Арсланов, “Критерии полноты для одного класса сводимостей”, Изв. вузов. Матем., 2022, № 10, 73–78
Supplementary files
