Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Faizrahmanov, Marat Khaidarovich

Statistics Math-Net.Ru
Total publications: 24
Scientific articles: 24

Number of views:
This page:589
Abstract pages:4441
Full texts:1057
References:405
Faizrahmanov, Marat Khaidarovich
Doctor of physico-mathematical sciences (2020)
Speciality: 01.01.06 (Mathematical logic, algebra, and number theory)
Birth date: 8.11.1986
E-mail: ,
Website: http://www.mfaizrah.org
Keywords: numbering, degree of unsolvability, degree spectra
UDC: 510.5, 510.53, 510.57

Subject:

Computability Theory, Theory of Numberings

   
Main publications:
  1. Faizrakhmanov, M.K., “Khutoretskii’s Theorem for Generalized Computable Families”, Algebra and Logic, 58:4 (2019), 356-365
  2. Faizrakhmanov, M.K., “Universal Generalized Computable Numberings and Hyperimmunity”, Algebra and Logic, 56:4 (2017), 356-365
  3. Faizrahmanov M., Kalimullin I., “The enumeration spectrum hierarchy of n-families”, Mathematical Logic Quarterly, 62:4 (2016), 420-426

http://www.mathnet.ru/eng/person39760
https://scholar.google.com/citations?user=1kltXtcAAAAJ&hl=en
List of publications on ZentralBlatt
http://orcid.org/0000-0002-4519-9696
http://www.researcherid.com/rid/K-7976-2015
https://www.scopus.com/authid/detail.url?authorId=36706020100

Publications in Math-Net.Ru
2021
1. M. Kh. Faizrakhmanov, “Some properties of the upper semilattice of computable families of computably enumerable sets”, Algebra Logika, 60:2 (2021),  195–209  mathnet
2. Z. K. Ivanova, M. Kh. Faizrahmanov, “Weak reducibility of computable and generalized computable numberings”, Sib. Èlektron. Mat. Izv., 18:1 (2021),  112–120  mathnet  isi
2020
3. I. Sh. Kalimullin, V. G. Puzarenko, M. Kh. Faizrahmanov, “Semidecidable numberings in admissible sets”, Algebra Logika, 59:3 (2020),  395–402  mathnet; Algebra and Logic, 59:3 (2020), 273–277  isi  scopus
4. I. Sh. Kalimullin, V. G. Puzarenko, M. Kh. Faizrakhmanov, “Computable positive and Friedberg numberings in hyperarithmetic”, Algebra Logika, 59:1 (2020),  66–83  mathnet; Algebra and Logic, 59:1 (2020), 46–58  isi  scopus
5. I. Sh. Kalimullin, V. G. Puzarenko, M. Kh. Faizrahmanov, “Позитивные нумерации в допустимых множествах”, Sibirsk. Mat. Zh., 61:3 (2020),  607–621  mathnet
2019
6. M. Kh. Faizrakhmanov, “Khutoretskii's theorem for generalized computable families”, Algebra Logika, 58:4 (2019),  528–541  mathnet; Algebra and Logic, 58:4 (2019), 356–365  isi  scopus
7. M. Kh. Faizrahmanov, “Lattice properties of Rogers semilattices of compuatble and generalized computable familie”, Sib. Èlektron. Mat. Izv., 16 (2019),  1927–1936  mathnet
8. I. Sh. Kalimullin, V. G. Puzarenko, M. Kh. Faizrahmanov, “Partial decidable presentations in hyperarithmetic”, Sibirsk. Mat. Zh., 60:3 (2019),  599–609  mathnet  elib; Siberian Math. J., 60:3 (2019), 464–471  isi  scopus
2018
9. I. Sh. Kalimullin, V. G. Puzarenko, M. Kh. Faizrakhmanov, “Positive presentations of families in relation to reducibility with respect to enumerability”, Algebra Logika, 57:4 (2018),  492–498  mathnet; Algebra and Logic, 57:4 (2018), 320–323  isi  scopus
10. I. Sh. Kalimullin, A. Kach, A. Montalbán, V. G. Puzarenko, M. Kh. Faizrakhmanov, “Jump inversions of algebraic structures and the $\Sigma$-definability”, Algebra Logika, 57:2 (2018),  243–249  mathnet; Algebra and Logic, 57:2 (2018), 161–165  isi  scopus
11. I. Sh. Kalimullin, M. Kh. Faizrakhmanov, “Degrees of enumerations of countable Wehner-like families”, Itogi Nauki i Tekhniki. Ser. Sovrem. Mat. Pril. Temat. Obz., 157 (2018),  59–69  mathnet  mathscinet
12. I. Sh. Kalimullin, V. G. Puzarenko, M. Kh. Faizrahmanov, “Positive presentations of families relative to $e$-oracles”, Sibirsk. Mat. Zh., 59:4 (2018),  823–833  mathnet  elib; Siberian Math. J., 59:4 (2018), 648–656  isi  scopus
2017
13. M. Kh. Faizrakhmanov, “Universal generalized computable numberings and hyperimmunity”, Algebra Logika, 56:4 (2017),  506–521  mathnet  mathscinet; Algebra and Logic, 56:4 (2017), 337–347  isi  scopus
14. M. Kh. Faizrahmanov, “The Rogers semilattices of generalized computable enumerations”, Sibirsk. Mat. Zh., 58:6 (2017),  1418–1427  mathnet  elib; Siberian Math. J., 58:6 (2017), 1104–1110  isi  scopus
15. M. Kh. Faizrahmanov, “Minimal generalized computable enumerations and high degrees”, Sibirsk. Mat. Zh., 58:3 (2017),  710–716  mathnet  elib; Siberian Math. J., 58:3 (2017), 553–558  isi  elib  scopus
2016
16. M. Kh. Faizrakhmanov, “Universal computable enumerations of finite classes of families of total functions”, Izv. Vyssh. Uchebn. Zaved. Mat., 2016, 12,  96–100  mathnet; Russian Math. (Iz. VUZ), 60:12 (2016), 79–83  isi  scopus
2015
17. I. Sh. Kalimullin, M. Kh. Faizrakhmanov, “A hierarchy of classes of families and $n$-low degrees”, Algebra Logika, 54:4 (2015),  536–541  mathnet  mathscinet; Algebra and Logic, 54:4 (2015), 347–350  isi  scopus
2014
18. M. Kh. Faizrakhmanov, “Arithmetical level of a class of superhigh sets”, Izv. Vyssh. Uchebn. Zaved. Mat., 2014, 5,  53–58  mathnet; Russian Math. (Iz. VUZ), 58:5 (2014), 43–47  scopus
2013
19. M. Kh. Faizrahmanov, “Complements for enumeration $\Pi^0_1$-degrees”, Sibirsk. Mat. Zh., 54:6 (2013),  1388–1395  mathnet  mathscinet  elib; Siberian Math. J., 54:6 (2013), 1104–1109  isi  elib  scopus
2012
20. I. Sh. Kalimullin, M. Kh. Faizrakhmanov, “Limitwise monotonic spectra of $\Sigma^0_2$-sets”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 154:2 (2012),  107–116  mathnet
2011
21. M. Kh. Faizrakhmanov, “Turing jumps in the Ershov hierarchy”, Algebra Logika, 50:3 (2011),  399–414  mathnet  mathscinet  zmath; Algebra and Logic, 50:3 (2011), 279–289  isi  scopus
22. M. Kh. Faizrakhmanov, “A semilattice generated by superlow computably enumerable degrees”, Izv. Vyssh. Uchebn. Zaved. Mat., 2011, 1,  85–90  mathnet  mathscinet; Russian Math. (Iz. VUZ), 55:1 (2011), 74–78  scopus
2010
23. M. Kh. Faizrakhmanov, “Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy”, Izv. Vyssh. Uchebn. Zaved. Mat., 2010, 12,  58–66  mathnet  mathscinet; Russian Math. (Iz. VUZ), 54:12 (2010), 51–58  scopus
24. M. Kh. Faizrahmanov, “Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy”, Sibirsk. Mat. Zh., 51:6 (2010),  1435–1439  mathnet  mathscinet; Siberian Math. J., 51:6 (2010), 1135–1138  isi  scopus

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