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

Statistics Math-Net.Ru
Total publications: 40
Scientific articles: 39
Presentations: 1

Number of views:
This page:1221
Abstract pages:8968
Full texts:2402
References:1337
Faizrahmanov, Marat Khaidarovich
Doctor of physico-mathematical sciences (2020)
Speciality: 01.01.06 (Mathematical logic, algebra, and number theory)
E-mail: ,
Website: https://mathcenter.kpfu.ru/mfaizrah
Keywords: numbering, degree of unsolvability, degree spectra
UDC: 510.5, 510.53, 510.57

Subject:

Computability Theory, Theory of Numberings, Computable Model Theory

   
Main publications:
  1. M. Kh. Faizrahmanov, “A family with a single minimal but not least numbering”, Sibirsk. Mat. Zh., 65:2 (2024), 395–407  mathnet  crossref
  2. M. Kh. Faizrakhmanov, “Universal generalized computable numberings and hyperimmunity”, Algebra Logika, 56:4 (2017), 506–521  mathnet  crossref  mathscinet; Algebra and Logic, 56:4 (2017), 337–347  crossref  isi  scopus
  3. 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  crossref  isi  scopus

https://www.mathnet.ru/eng/person39760
https://scholar.google.com/citations?user=1kltXtcAAAAJ&hl=en
List of publications on ZentralBlatt
https://elibrary.ru/author_items.asp?spin=7000-4283
https://orcid.org/0000-0002-4519-9696
https://www.webofscience.com/wos/author/record/K-7976-2015
https://www.scopus.com/authid/detail.url?authorId=36706020100

Publications in Math-Net.Ru Citations
2024
1. M. Kh. Faizrahmanov, “On $e$-principal and $e$-complete numberings”, Mat. Zametki, 116:3 (2024),  461–476  mathnet; Math. Notes, 116:3 (2024), 541–553
2. M. Kh. Faizrahmanov, “A family with a single minimal but not least numbering”, Sibirsk. Mat. Zh., 65:2 (2024),  395–407  mathnet
2023
3. M. Kh. Faizrahmanov, “Effectively infinite classes of numberings of computable families of reals”, Izv. Vyssh. Uchebn. Zaved. Mat., 2023, no. 5,  96–100  mathnet 1
4. I. Sh. Kalimullin, V. G. Puzarenko, M. Kh. Faizrahmanov, “Negative numberings in admissible sets. II”, Mat. Tr., 26:2 (2023),  86–128  mathnet; Siberian Adv. Math., 34:1 (2024), 41–66
5. M. Kh. Faizrahmanov, “Positive reducibilities, extreme numberings, and completeness”, Mat. Tr., 26:1 (2023),  176–191  mathnet  elib; Siberian Adv. Math., 33:3 (2023), 204–213 1
6. I. Sh. Kalimullin, V. G. Puzarenko, M. Kh. Faizrahmanov, “Negative numberings in admissible sets. I”, Mat. Tr., 26:1 (2023),  47–92  mathnet  elib; Siberian Adv. Math., 33:4 (2023), 293–321 1
7. M. Kh. Faizrahmanov, “On the Embedding of the First Nonconstructive Ordinal in the Rogers Semilattices”, Mat. Zametki, 113:5 (2023),  764–774  mathnet  mathscinet; Math. Notes, 113:5 (2023), 723–730  scopus 1
8. M. Kh. Faizrahmanov, “Effectively infinite classes of numberings and fixed point theorems”, Sib. Èlektron. Mat. Izv., 20:2 (2023),  1519–1536  mathnet
9. M. Kh. Faizrahmanov, “Embedding of the first nonconstructive ordinal into the Rogers semilattices of families of arithmetic sets”, Sibirsk. Mat. Zh., 64:4 (2023),  830–840  mathnet
10. M. Kh. Faizrahmanov, “Enumeration reducibility and positive reducibility of the numberings of families of arithmetic sets”, Sibirsk. Mat. Zh., 64:1 (2023),  204–212  mathnet  mathscinet; Siberian Math. J., 64:1 (2023), 174–180 4
11. M. Kh. Faizrahmanov, “Two theorems on minimal generally-computable numberings”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2023, no. 3,  28–35  mathnet  zmath  elib; Moscow University Mathematics Bulletin, 78:3 (2023), 136–143 2
2022
12. A. S. Morozov, V. G. Puzarenko, M. Kh. Faizrahmanov, “Families of permutations and ideals of Turing degrees”, Algebra Logika, 61:6 (2022),  706–719  mathnet
13. M. Kh. Faizrahmanov, “On numberings for classes of families of total functions”, Mat. Tr., 25:1 (2022),  177–197  mathnet
14. M. Kh. Faizrahmanov, “Splitting of c.e. degrees and superlowness”, Sib. Èlektron. Mat. Izv., 19:2 (2022),  578–585  mathnet  mathscinet
15. M. Kh. Faizrahmanov, “On $p$-universal and $p$-minimal numberings”, Sibirsk. Mat. Zh., 63:2 (2022),  427–436  mathnet  mathscinet; Siberian Math. J., 63:2 (2022), 365–373 4
2021
16. M. Kh. Faizrakhmanov, “Some properties of the upper semilattice of computable families of computably enumerable sets”, Algebra Logika, 60:2 (2021),  195–209  mathnet; Algebra and Logic, 60:2 (2021), 128–138  isi  scopus
17. 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
18. 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
19. 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 3
20. I. Sh. Kalimullin, V. G. Puzarenko, M. Kh. Faizrahmanov, “Positive numberings in admissible sets”, Sibirsk. Mat. Zh., 61:3 (2020),  607–621  mathnet  elib; Siberian Math. J., 61:3 (2020), 478–489  isi  scopus 3
2019
21. 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 9
22. M. Kh. Faizrahmanov, “Lattice properties of Rogers semilattices of compuatble and generalized computable familie”, Sib. Èlektron. Mat. Izv., 16 (2019),  1927–1936  mathnet
23. 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 3
2018
24. 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 1
25. 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 1
26. I. Sh. Kalimullin, M. Kh. Faizrakhmanov, “Degrees of enumerations of countable Wehner-like families”, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 157 (2018),  59–69  mathnet  mathscinet; J. Math. Sci. (N. Y.), 256:1 (2021), 51–60 1
27. 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 4
2017
28. 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 12
29. 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 9
30. 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 13
2016
31. M. Kh. Faizrakhmanov, “Universal computable enumerations of finite classes of families of total functions”, Izv. Vyssh. Uchebn. Zaved. Mat., 2016, no. 12,  96–100  mathnet; Russian Math. (Iz. VUZ), 60:12 (2016), 79–83  isi  scopus 2
2015
32. 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 4
2014
33. M. Kh. Faizrakhmanov, “Arithmetical level of a class of superhigh sets”, Izv. Vyssh. Uchebn. Zaved. Mat., 2014, no. 5,  53–58  mathnet; Russian Math. (Iz. VUZ), 58:5 (2014), 43–47  scopus
2013
34. 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
35. 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 1
2011
36. 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 2
37. M. Kh. Faizrakhmanov, “A semilattice generated by superlow computably enumerable degrees”, Izv. Vyssh. Uchebn. Zaved. Mat., 2011, no. 1,  85–90  mathnet  mathscinet; Russian Math. (Iz. VUZ), 55:1 (2011), 74–78  scopus 3
2010
38. M. Kh. Faizrakhmanov, “Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy”, Izv. Vyssh. Uchebn. Zaved. Mat., 2010, no. 12,  58–66  mathnet  mathscinet; Russian Math. (Iz. VUZ), 54:12 (2010), 51–58  scopus 4
39. 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 2

2024
40. A. N. Abyzov, L. D. Beklemishev, S. S. Goncharov, Yu. L. Ershov, I. Sh. Kalimullin, V. L. Selivanov, A. L. Semenov, A. Tuganbaev, M. Kh. Faizrahmanov, “Marat Mirzaevich Arslanov (on his eightieth birthday)”, Uspekhi Mat. Nauk, 79:2(476) (2024),  189–193  mathnet  mathscinet; Russian Math. Surveys, 79:2 (2024), 369–373  isi  scopus

Presentations in Math-Net.Ru
1. Generalized computable numberings and fixed points
M. Kh. Faizrahmanov
Second Conference of Russian Mathematical Centers. Section «Mathematical Logic and Theoretical Computer Science»
November 11, 2022 15:30   

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