Arslanov M.M., “Definability and Elementary Equivalence in the Ershov Difference Hierarchy”, Lecture Notes in Logic, 32, 2009, 1–17
Arslanov M.M., Omanadze R.Sh.,, “Q-degrees of n-c.e. sets”, Illinois J. of Math., 51 (2007), 1189–1206
M.M. Arslanov, S. Barry Cooper, I.Sh. Kalimullin, M.I. Soskova, “Total degrees and nonsplitting properties of Sigma-2-0 enumeration degrees”, Lecture Notes in Computer Science, 4978, 2008, 568–578
Arslanov M.M., Chong, C.T., Cooper, S.B., Yang Y., “The minimal e-degree problem in fragments of Peano arithmetic”, Annals of Pure and Applied Math, 131 (2005), 159–175
M. M. Arslanov, M. M. Yamaleev, “Turing computability: structural theory”, Itogi Nauki i Tekhniki. Ser. Sovrem. Mat. Pril. Temat. Obz., 157 (2018), 8–41
2.
A. N. Abyzov, M. M. Arslanov, “Studies in algebra and mathematical logic at the Kazan University”, Itogi Nauki i Tekhniki. Ser. Sovrem. Mat. Pril. Temat. Obz., 157 (2018), 3–7
2015
3.
M. M. Arslanov, “Structural theory of degrees of unsolvability: advances and open problems”, Algebra Logika, 54:4 (2015), 529–535; Algebra and Logic, 54:4 (2015), 343–346
2014
4.
M. M. Arslanov, “Definable relations in structures of Turing degrees”, Izv. Vyssh. Uchebn. Zaved. Mat., 2014, 2, 77–81; Russian Math. (Iz. VUZ), 58:2 (2014), 64–67
2012
5.
M. M. Arslanov, “Relative enumerability and the $d$-c. e. degrees”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 154:2 (2012), 152–158
2011
6.
M. M. Arslanov, “Model-Theoretic Properties of the Turing Degrees in the Ershov Difference Hierarchy”, Sovrem. Probl. Mat., 15 (2011), 5–14; Proc. Steklov Inst. Math., 278, suppl. 1 (2012), S57–S65
2006
7.
M. M. Arslanov, N. Kehayopulu, “Weak presentations of computable partially ordered semigroups”, Izv. Vyssh. Uchebn. Zaved. Mat., 2006, 3, 3–8; Russian Math. (Iz. VUZ), 50:3 (2006), 1–6
2003
8.
M. M. Arslanov, I. Sh. Kalimullin, S. B. Cooper, “Splitting Properties of Total Enumeration Degrees”, Algebra Logika, 42:1 (2003), 3–25; Algebra and Logic, 42:1 (2003), 1–13
2002
9.
M. M. Arslanov, N. Kehayopulu, “A note on minimal and maximal ideals of ordered semigroups”, Lobachevskii J. Math., 11 (2002), 3–6
1993
10.
M. M. Arslanov, “Completeness of arithmetic sets under set-theoretic operations”, Izv. Vyssh. Uchebn. Zaved. Mat., 1993, 9, 3–7; Russian Math. (Iz. VUZ), 37:9 (1993), 1–5
1988
11.
M. M. Arslanov, “The lattice of the degrees below $0'$”, Izv. Vyssh. Uchebn. Zaved. Mat., 1988, 7, 27–33; Soviet Math. (Iz. VUZ), 32:7 (1988), 43–53
1985
12.
M. M. Arslanov, “Lattice properties of the degrees below $O'$”, Dokl. Akad. Nauk SSSR, 283:2 (1985), 270–273
13.
M. M. Arslanov, “Families of recursively enumerable sets and their degrees of unsolvability”, Izv. Vyssh. Uchebn. Zaved. Mat., 1985, 4, 13–19; Soviet Math. (Iz. VUZ), 29:4 (1985), 13–21
14.
M. M. Arslanov, “A class of hypersimple incomplete sets”, Mat. Zametki, 38:6 (1985), 872–874; Math. Notes, 38:6 (1985), 984–985
15.
M. M. Arslanov, “Effectively hyperimmune sets and majorants”, Mat. Zametki, 38:2 (1985), 302–309; Math. Notes, 38:2 (1985), 677–680
1981
16.
M. M. Arslanov, “Some generalizations of a fixed-point theorem”, Izv. Vyssh. Uchebn. Zaved. Mat., 1981, 5, 9–16; Soviet Math. (Iz. VUZ), 25:5 (1981), 1–10
1977
17.
M. M. Arslanov, R. F. Nadyrov, V. D. Solov'ev, “A criterion for the completeness of recursively enumerable sets, and some generalizations of a fixed point theorem”, Izv. Vyssh. Uchebn. Zaved. Mat., 1977, 4, 3–7
1970
18.
M. M. Arslanov, “Complete hypersimple sets”, Izv. Vyssh. Uchebn. Zaved. Mat., 1970, 4, 30–35
2011
19.
M. M. Arslanov, “Математическая жизнь в Казани в годы войны”, Mat. Pros., Ser. 3, 15 (2011), 20–34
1997
20.
M. M. Arslanov, A. A. Razborov, “International School-Conference “Recursion Theory and Theory of Complexity” (WRTCT'97)”, Uspekhi Mat. Nauk, 52:6(318) (1997), 213–214
Terms of Use