20191. Faizrakhmanov M.Kh.
Khutoretskii's Theorem for Generalized Computable Families.
Algebra Logika. — 2019. — V. 58, No 4. — P. 528−541.
2. Faizrahmanov M.Kh.
Lattice Properties of Rogers Semilattices of Compuatble and Generalized Computable Families.
Sib. Electron. Math. Rep. — 2019. — V. 16. — P. 1927−1936.
3. Kalimullin I.Sh., Puzarenko V.G., Faizrahmanov M.Kh.
Partial Decidable Presentations in Hyperarithmetic.
Sib. Math. J. — 2019. — V. 60, No 3. — P. 599−609.
4. Faizrahmanov M., Kach A., Kalimullin I., Montalban A., Puzarenko V.
Jump Inversions of Algebraic Structures and Σ-definability.
Math. Log. Quart. — 2019. — V. 65, No 1. — P. 37−45.
20181. Kalimullin I.Sh., Puzarenko V.G., Faizrahmanov M.Kh.
Positive Presentations of Families Relative to e-oracles.
Sib. Math. J. — 2018. — V. 59, No 4. — P. 823−833.
2. Kalimullin I.Sh., Kach A., Montalbán A., Puzarenko, V.G., Faizrakhmanov M.Kh.
Jump Inversions of Algebraic Structures and the Σ-definability.
Algebra Logika. — 2018. — V. 57, No 2. — P. 243−249.
3. Kalimullin I.Sh., Puzarenko V.G., Faizrakhmanov M.Kh.
Positive Presentations of Families in Relation to Reducibility with Respect to Enumerability.
Algebra Logika. — 2018. — V. 57, No 4. — P. 492−498.
20171. Faizrakhmanov M.Kh.
Universal Generalized Computable Numberings and Hyperimmunity.
Algebra Logika. — 2017. — V. 56, No 4. — P. 506−521.
2. Faizrahmanov M.Kh.
The Rogers Semilattices of Generalized Computable Enumerations.
Sib. Math. J. — 2017. — V. 58, No 6. — P. 1418−1427.
3. Faizrahmanov M.Kh.
Minimal Generalized Computable Enumerations and High Degrees.
Sib. Math. J. — 2017. — V. 58, No 3. — P. 710−716.
4. Faizrahmanov M., Kalimullin I., Montalban A., Puzarenko V.
The Least Σ-jump Inversion Theorem for n-families.
J. Univ. Comp. Sci. — 2017. — V. 23, No 6. — P. 529−538.
20161. Faizrahmanov M., Kalimullin I.
The Enumeration Spectrum Hierarchy of n-families.
Math. Log. Quart. — 2016. — V. 62, No 4. — P. 420−426.
2. Faizrahmanov M., Kalimullin I.
The Enumeration Spectrum Hierarchy of α-families and Low_α Degrees.
J. Univ. Comp. Sci. — 2016. — V. 22, No 7. — P. 943−955.
3. Faizrakhmanov M.Kh.
Universal Computable Enumerations of Finite Classes of Families of Total Functions.
Russian Math. — 2016. — No 12. — P. 96−100.
20151. Faizrahmanov M., Kalimullin I.
Limitwise Monotonic Sets of Reals.
Math. Log. Quart. — 2015. — V. 61, No 3. — P. 224−229.
2. Kalimullin I.Sh., Faizrakhmanov M.Kh.
A Hierarchy of Classes of Families and n-low Degrees.
Algebra Logika. — 2015. — V. 54, No 4. — P. 536−541.
20141. Faizrahmanov M., Kalimullin I., Zainetdinov D.
Maximality and Minimality under Limitwise Monotonic Reducibility.
Lobachevskii J. Math. — 2014. — V. 35, No 4. — P. 333−338.
20131. Faizrahmanov M.Kh.
Complements for Enumeration Π-0−1-degrees.
Sib. Math. J. — 2013. — V. 54, No 6. — P. 1388−1395.
20121. Faizrahmanov M.Kh., Kalimullin I.Sh.
Turing and Enumeration Jumps in the Ershov Hierarchy.
J. Log. Comput. — 2012. — V. 22, No 4. — P. 737−743.
2. Kalimullin I.Sh., Faizrakhmanov M.Kh.
Limitwise Monotonic Spectra of Σ-0−2-sets.
Uchen. Zapiski Kazan. Univ.. Seriya Fiz.-Mat. Nauki. — 2012. — V. 154. No 2. — P. 107−116.
20111. Faizrakhmanov M.Kh.
Turing Jumps in the Ershov Hierarchy.
Algebra Logika. — 2011. — V. 50, No 3. — P. 399−414.
2. Faizrakhmanov M.Kh.
A Semilattice Generated by Superlow Computably Enumerable Degrees.
Russian Math. — 2011. No 1. — P. 85−90.
20101. Faizrahmanov M.Kh.
Computable Numberings of Families of Low Sets and Turing Jumps in the Ershov Hierarchy. — 2010.
Sib. Math. J. — V. 51, No 6. — P. 1435−1439.
2. Faizrakhmanov M.Kh.
Decomposability of Low 2-computably Enumerable Degrees and Turing Jumps in the Ershov Hierarchy.
Russian Math. — 2010. — No 12. — P. 58−66.