RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 
Arslanov, Marat Mirzaevich

Statistics Math-Net.Ru
Total publications: 23
Scientific articles: 21

Number of views:
This page:2169
Abstract pages:3893
Full texts:1552
References:269
Professor
Doctor of physico-mathematical sciences (1988)
Speciality: 01.01.06 (Mathematical logic, algebra, and number theory)
Birth date: 7.02.1944
E-mail:
Website: http://www.kpfu.ru
Keywords: computably enumerable sets, algorithmic reducibilities, computable functions, decidable theories, Kolmogorov complexity, computable algebras, degrees of unsolvability.
UDC: 510.5, 510.54, 517.11, 517.929, 519, 519.92, 519.95
MSC: 03D25, 03D30

Subject:

Computability theory; complesity theory; constructive models.

   
Main publications:
  1. Arslanov M.M., Kalimullin I.Sh., Lempp S., “On Downey's Conjecture”, Journal of Symbolic Logic, 75 (2010), 401–441
  2. Arslanov M.M., “Definability and Elementary Equivalence in the Ershov Difference Hierarchy”, Lecture Notes in Logic, 32, 2009, 1–17
  3. Arslanov M.M., Omanadze R.Sh.,, “Q-degrees of n-c.e. sets”, Illinois J. of Math., 51 (2007), 1189–1206
  4. 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
  5. 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

http://www.mathnet.ru/eng/person19985
List of publications on Google Scholar
List of publications on ZentralBlatt

Publications in Math-Net.Ru
2018
1. M. M. Arslanov, M. M. Yamaleev, “Turing computability: structural theory”, Itogi Nauki i Tekhniki. Ser. Sovrem. Mat. Pril. Temat. Obz., 157 (2018),  8–41  mathnet  mathscinet
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  mathnet  mathscinet
2015
3. M. M. Arslanov, “Structural theory of degrees of unsolvability: advances and open problems”, Algebra Logika, 54:4 (2015),  529–535  mathnet  mathscinet; Algebra and Logic, 54:4 (2015), 343–346  isi  scopus
2014
4. M. M. Arslanov, “Definable relations in structures of Turing degrees”, Izv. Vyssh. Uchebn. Zaved. Mat., 2014, 2,  77–81  mathnet; Russian Math. (Iz. VUZ), 58:2 (2014), 64–67  scopus
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  mathnet
2011
6. M. M. Arslanov, “Model-Theoretic Properties of the Turing Degrees in the Ershov Difference Hierarchy”, Sovrem. Probl. Mat., 15 (2011),  5–14  mathnet  elib; Proc. Steklov Inst. Math., 278, suppl. 1 (2012), S57–S65  isi  scopus
2006
7. M. M. Arslanov, N. Kehayopulu, “Weak presentations of computable partially ordered semigroups”, Izv. Vyssh. Uchebn. Zaved. Mat., 2006, 3,  3–8  mathnet  mathscinet  zmath; 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  mathnet  mathscinet  zmath; Algebra and Logic, 42:1 (2003), 1–13  scopus
2002
9. M. M. Arslanov, N. Kehayopulu, “A note on minimal and maximal ideals of ordered semigroups”, Lobachevskii J. Math., 11 (2002),  3–6  mathnet  mathscinet  zmath
1993
10. M. M. Arslanov, “Completeness of arithmetic sets under set-theoretic operations”, Izv. Vyssh. Uchebn. Zaved. Mat., 1993, 9,  3–7  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 37:9 (1993), 1–5
1989
11. M. M. Arslanov, “Completeness in the arithmetical hierarchy, and fixed points”, Algebra Logika, 28:1 (1989),  3–17  mathnet  mathscinet
1988
12. M. M. Arslanov, “The lattice of the degrees below $0'$”, Izv. Vyssh. Uchebn. Zaved. Mat., 1988, 7,  27–33  mathnet  mathscinet  zmath; Soviet Math. (Iz. VUZ), 32:7 (1988), 43–53
1985
13. M. M. Arslanov, “Lattice properties of the degrees below $O'$”, Dokl. Akad. Nauk SSSR, 283:2 (1985),  270–273  mathnet  mathscinet  zmath
14. M. M. Arslanov, “Families of recursively enumerable sets and their degrees of unsolvability”, Izv. Vyssh. Uchebn. Zaved. Mat., 1985, 4,  13–19  mathnet  mathscinet  zmath; Soviet Math. (Iz. VUZ), 29:4 (1985), 13–21
15. M. M. Arslanov, “A class of hypersimple incomplete sets”, Mat. Zametki, 38:6 (1985),  872–874  mathnet  mathscinet  zmath; Math. Notes, 38:6 (1985), 984–985  isi
16. M. M. Arslanov, “Effectively hyperimmune sets and majorants”, Mat. Zametki, 38:2 (1985),  302–309  mathnet  mathscinet  zmath; Math. Notes, 38:2 (1985), 677–680  isi
1981
17. M. M. Arslanov, “Some generalizations of a fixed-point theorem”, Izv. Vyssh. Uchebn. Zaved. Mat., 1981, 5,  9–16  mathnet  mathscinet  zmath; Soviet Math. (Iz. VUZ), 25:5 (1981), 1–10
1977
18. 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  mathnet  mathscinet  zmath
1970
19. M. M. Arslanov, “Complete hypersimple sets”, Izv. Vyssh. Uchebn. Zaved. Mat., 1970, 4,  30–35  mathnet  mathscinet  zmath
1969
20. M. M. Arslanov, “Effectively hypersimple sets”, Algebra Logika, 8:2 (1969),  143–153  mathnet  mathscinet
1968
21. M. M. Arslanov, “Two theorems on recursively enumerable sets”, Algebra Logika, 7:3 (1968),  4–8  mathnet  mathscinet

2011
22. M. M. Arslanov, “Математическая жизнь в Казани в годы войны”, Mat. Pros., Ser. 3, 15 (2011),  20–34  mathnet
1997
23. 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  mathnet

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2021