On the 75th birth anniversary of Marat Mirzaevich Arslanov
The paper describes the biography and the main scientific achievements of Marat Mirzaevich Arslanov, the Head of the Department of Algebra and Mathematical Logic of Kazan Federal University, Professor, who is the founder of the Kazan School of Mathematical Logic and Computability Theory. The main...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Kazan Federal University
2019-03-01
|
| Series: | Учёные записки Казанского университета: Серия Физико-математические науки |
| Online Access: | https://kpfu.ru/uz-eng-phm-2019-1-12.html |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841563112495382528 |
|---|---|
| author | I.Sh. Kalimullin V.L. Selivanov |
| author_facet | I.Sh. Kalimullin V.L. Selivanov |
| author_sort | I.Sh. Kalimullin |
| collection | DOAJ |
| description | The paper describes the biography and the main scientific achievements of Marat Mirzaevich Arslanov, the Head of the Department of Algebra and Mathematical Logic of Kazan Federal University, Professor, who is the founder of the Kazan School of Mathematical Logic and Computability Theory.
The main scientific finding of M.M. Arslanov that gave him international fame, is Arslanov's fixed point theorem (also known as Arslanov's completeness criterion), which was first formulated and proved by M.M. Arslanov in 1977. Numerous generalizations and unexpected applications of this theorem have been found by many authors in various areas of mathematics and computer science. M.M. Arslanov was one of the first of Russian mathematics who actively participated in the investigations of the local theory of (Turing) unsolvability degrees, i.e., the degrees reducible to the degree of creative sets. This research area is closely related to the investigation of Turing degrees in Ershov's hierarchy. He has solved a whole series of problems in this area. In particular, he found a structural difference between the semilattice of computably enumerable degrees and the semilattice of n-c.e. degrees, n > 1. One of the most important results of M.M. Arslanov's research activity is the solution of Downey's problem on the elementary non-equivalence between the degrees of finite Boolean combinations of computably enumerable sets, which was obtained by him jointly with I.Sh. Kalimullin, his former postgraduate student, and S. Lempp, Professor of Wisconsin University, United States. |
| format | Article |
| id | doaj-art-db5c495b98924243a14cd630ed463433 |
| institution | Kabale University |
| issn | 2541-7746 2500-2198 |
| language | English |
| publishDate | 2019-03-01 |
| publisher | Kazan Federal University |
| record_format | Article |
| series | Учёные записки Казанского университета: Серия Физико-математические науки |
| spelling | doaj-art-db5c495b98924243a14cd630ed4634332025-01-03T00:14:26ZengKazan Federal UniversityУчёные записки Казанского университета: Серия Физико-математические науки2541-77462500-21982019-03-01161115216010.26907/2541-7746.2019.1.152-160On the 75th birth anniversary of Marat Mirzaevich ArslanovI.Sh. Kalimullin0V.L. Selivanov1Kazan Federal University, Kazan, 420008 RussiaKazan Federal University, Kazan, 420008 RussiaThe paper describes the biography and the main scientific achievements of Marat Mirzaevich Arslanov, the Head of the Department of Algebra and Mathematical Logic of Kazan Federal University, Professor, who is the founder of the Kazan School of Mathematical Logic and Computability Theory. The main scientific finding of M.M. Arslanov that gave him international fame, is Arslanov's fixed point theorem (also known as Arslanov's completeness criterion), which was first formulated and proved by M.M. Arslanov in 1977. Numerous generalizations and unexpected applications of this theorem have been found by many authors in various areas of mathematics and computer science. M.M. Arslanov was one of the first of Russian mathematics who actively participated in the investigations of the local theory of (Turing) unsolvability degrees, i.e., the degrees reducible to the degree of creative sets. This research area is closely related to the investigation of Turing degrees in Ershov's hierarchy. He has solved a whole series of problems in this area. In particular, he found a structural difference between the semilattice of computably enumerable degrees and the semilattice of n-c.e. degrees, n > 1. One of the most important results of M.M. Arslanov's research activity is the solution of Downey's problem on the elementary non-equivalence between the degrees of finite Boolean combinations of computably enumerable sets, which was obtained by him jointly with I.Sh. Kalimullin, his former postgraduate student, and S. Lempp, Professor of Wisconsin University, United States.https://kpfu.ru/uz-eng-phm-2019-1-12.html |
| spellingShingle | I.Sh. Kalimullin V.L. Selivanov On the 75th birth anniversary of Marat Mirzaevich Arslanov Учёные записки Казанского университета: Серия Физико-математические науки |
| title | On the 75th birth anniversary of Marat Mirzaevich Arslanov |
| title_full | On the 75th birth anniversary of Marat Mirzaevich Arslanov |
| title_fullStr | On the 75th birth anniversary of Marat Mirzaevich Arslanov |
| title_full_unstemmed | On the 75th birth anniversary of Marat Mirzaevich Arslanov |
| title_short | On the 75th birth anniversary of Marat Mirzaevich Arslanov |
| title_sort | on the 75th birth anniversary of marat mirzaevich arslanov |
| url | https://kpfu.ru/uz-eng-phm-2019-1-12.html |
| work_keys_str_mv | AT ishkalimullin onthe75thbirthanniversaryofmaratmirzaevicharslanov AT vlselivanov onthe75thbirthanniversaryofmaratmirzaevicharslanov |