Speciality: 01.01.06 (Mathematical logic, algebra, and number theory)
Birth date: 7.02.1944
Phone: +7 (843) 233 77 14
E-mail:
Website: https://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

Publications in Math-Net.Ru

Presentations in Math-Net.Ru

Personal pages:

• 

Organisations:

• N. G. Chebotarev Research Institute of Mathematics and Mechanics, Kazan State University
• Institute of Mathematics and Mechanics, Kazan (Volga Region) Federal University