Geodesic
Marat Mirzaevich Arslanov (on his eightieth birthday)
Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 79 (2024) no. 2, pp. 369-373 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{RM_2024_79_2_a6,
     author = {A. N. Abyzov and L. D. Beklemishev and S. S. Goncharov and Yu. L. Ershov and I. Sh. Kalimullin and V. L. Selivanov and A. L. Semenov and A. Tuganbaev and M. Kh. Faizrahmanov},
     title = {Marat {Mirzaevich} {Arslanov} (on his eightieth birthday)},
     journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova},
     pages = {369--373},
     year = {2024},
     volume = {79},
     number = {2},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/RM_2024_79_2_a6/}
}
TY  - JOUR
AU  - A. N. Abyzov
AU  - L. D. Beklemishev
AU  - S. S. Goncharov
AU  - Yu. L. Ershov
AU  - I. Sh. Kalimullin
AU  - V. L. Selivanov
AU  - A. L. Semenov
AU  - A. Tuganbaev
AU  - M. Kh. Faizrahmanov
TI  - Marat Mirzaevich Arslanov (on his eightieth birthday)
JO  - Trudy Matematicheskogo Instituta imeni V.A. Steklova
PY  - 2024
SP  - 369
EP  - 373
VL  - 79
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/RM_2024_79_2_a6/
LA  - en
ID  - RM_2024_79_2_a6
ER  - 
%0 Journal Article
%A A. N. Abyzov
%A L. D. Beklemishev
%A S. S. Goncharov
%A Yu. L. Ershov
%A I. Sh. Kalimullin
%A V. L. Selivanov
%A A. L. Semenov
%A A. Tuganbaev
%A M. Kh. Faizrahmanov
%T Marat Mirzaevich Arslanov (on his eightieth birthday)
%J Trudy Matematicheskogo Instituta imeni V.A. Steklova
%D 2024
%P 369-373
%V 79
%N 2
%U http://geodesic.mathdoc.fr/item/RM_2024_79_2_a6/
%G en
%F RM_2024_79_2_a6
A. N. Abyzov; L. D. Beklemishev; S. S. Goncharov; Yu. L. Ershov; I. Sh. Kalimullin; V. L. Selivanov; A. L. Semenov; A. Tuganbaev; M. Kh. Faizrahmanov. Marat Mirzaevich Arslanov (on his eightieth birthday). Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 79 (2024) no. 2, pp. 369-373. http://geodesic.mathdoc.fr/item/RM_2024_79_2_a6/

[1] M. M. Arslanov, “On effectively hypersimple sets”, Algebra and Logic, 8 (1969), 79–85 | DOI | MR | Zbl

[2] M. M. Arslanov, R. F. Nadyrov, and V. D. Solov'ev, “Criterion for the completeness of recursively enumerable sets and several generalizations of the fixed-point theorem”, Izv. Vyssh. Uchebn. Zaved. Mat., 1977, no. 4, 3–7 (Russian) | MR | Zbl

[3] M. M. Arslanov, “Some generalizations of a fixed-point theorem”, Soviet Math. (Iz. VUZ), 25:5 (1981), 1–10 | MR | Zbl

[4] M. M. Arslanov, “Lattice properties of degrees below $O'$”, Soviet Math. Dokl., 32 (1985), 58–62 | MR | Zbl

[5] 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 | DOI | MR | Zbl

[6] M. M. Arslanov, “The lattice of the degrees below $0'$”, Soviet Math. (Iz. VUZ), 32:7 (1988), 43–53 | MR | Zbl

[7] M. M. Arslanov, “Completeness in the arithmetical hierarchy and fixed points”, Algebra and Logic, 28:1 (1989), 1–9 | DOI | MR | Zbl

[8] 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 | DOI | MR | Zbl

[9] M. M. Arslanov, S. Lempp, and R. A. Shore, “Interpolating d-r.e. and REA degrees between r.e. degrees”, Ann. Pure Appl. Logic, 78:1-3 (1996), 29–56 | DOI | MR | Zbl

[10] M. M. Arslanov, S. Lempp, and 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 | DOI | MR | Zbl

[11] 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 | MR | Zbl

[12] M. M. Arslanov, G. L. LaForte, and T. A. Slaman, “Relative enumerability in the difference hierarchy”, J. Symb. Log., 63:2 (1998), 411–420 | DOI | MR | Zbl

[13] 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 | DOI | MR | Zbl

[14] M. M. Arslanov, “Table complete sets of Kolmogorov complexity of conputations”, Collection of selected papers by members of the Academy of Science of the Republic of Tatarstan, Foliant, Kazan, 2002, 199–209 (Russian)

[15] M. M. Arslanov, “Truth-table complete computably enumerable sets”, Computability and models, Univ. Ser. Math., Kluwer Acad./Plenum Publ., New York, 2003, 1–10 | DOI | MR | Zbl

[16] 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

[17] M. M. Arslanov, I. Sh. Kalimullin, and S. Lempp, “On Downey's conjecture”, J. Symb. Log., 75:2 (2010), 401–441 | DOI | MR | Zbl

[18] M. M. Arslanov, “The Ershov hierarchy”, Computability in context. Computation and logic in the real world, Imperial College Press, London, 2011, 49–100 | DOI | MR | Zbl

[19] M. M. Arslanov, “Structural theory of degrees of unsolvability: advances and open problems”, Algebra and Logic, 54:4 (2015), 342–346 | DOI | MR | Zbl

[20] M. Arslanov, “Splitting and non-splitting in the difference hierarchy”, Math. Structures Comput. Sci., 28:3 (2018), 384–391 | DOI | MR

[21] M. M. Arslanov and 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 | DOI | MR | Zbl

[22] M. M. Arslanov, “Fixed-point selection functions”, Lobachevskii J. Math., 42:4 (2021), 685–692 | DOI | MR | Zbl

[23] M. M. Arslanov, “On a general method of constructing post reducibilities and the corresponding completeness criteria”, Lobachevskii J. Math., 43:12 (2022), 3430–3434 | DOI | MR | Zbl

[24] M. M. Arslanov, “Completeness criterions for a class of reducibilities”, Russian Math. (Iz. VUZ), 66:10 (2022), 62–66 | DOI | MR | Zbl