Marat Faizrahmanov

Chief Researcher
Volga Region Scientific-Educational Centre of Mathematics

Professor
Kazan Federal University, Department of Algebra and Mathematical Logic

Research Interests
Computability Theory, Theory of Numberings, Computable Model Theory, Admissible Sets

Orcid ID: 0000-0002-4519-9696
Researcher ID: K-7976-2015
Publications
1. Some Properties of Precompletely and Positively Numbered Sets. Ann. Pure Appl. Logic. (2024), 103523 (15 pages).
2. On Computable Numberings of Families of Turing Degrees. Arch. Math. Logic. 63:5-6 (2024), 609-622.
3. On e-principal and e-complete Numberings. Math. Notes. 116:3 (2024), 461-476.
4. Some Properties of Classes of Minimal Numberings of Arithmetical Set Families. Math. Theor. Comp. Sci. 2:1 (2024), 94-108 (with Sh. Nodirov).
5. Negative Numberings in Admissible Sets. II. Sib. Adv. Math. 34:1 (2024), 41-66 (with I. Kalimullin and V. Puzarenko).
6. A Family with a Single Minimal but Not Least Numbering. Sib. Math. J. 65:2 (2024), 395-407.
7. On Non-principal Arithmetical Numberings and Families. Theory Comput. Syst. 68:2 (2024), 271-282.
Contacts


Russia, 420008, Kazan, 35 Kremlievskaia st., Office 703
Phone: +7 (843) 292-72-79
Email: marat.faizrahmanov@gmail.com
2024 © mathcenter.kpfu.ru | 0+