- Искандер Шагитович Калимуллин, Iskander Shagitovich Kalimullin, “Почти вычислимо перечислимые семейства множеств”, Матем. сб., 199, № 10, 2008, 33
- N. A. Bazhenov*, “Degrees of categoricity for superatomic Boolean algebras”, Algebra Logic, 52, № 3, 2013, 179
- J. A. Tussupov, “Isomorphisms, definable relations, and Scott families for integral domains and commutative semigroups”, Sib. Adv. Math., 17, № 1, 2007, 49
- NOAM GREENBERG, ASHER M. KACH, STEFFEN LEMPP, DANIEL D. TURETSKY, “COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA”, J. symb. log., 80, № 1, 2015, 145
- NIKOLAY BAZHENOV, “Autostability spectra for decidable structures”, Math. Struct. Comp. Sci., 28, № 3, 2018, 392
- Iskander Kalimullin, 4497, Computation and Logic in the Real World, 2007, 389
- I. Sh. Kalimullin, “Relations between algorithmic reducibilities of algebraic systems”, Russ Math., 53, № 6, 2009, 58
- D. I. Dushenin, “Relative autostability of direct sums of Abelian p-groups”, J Math Sci, 186, № 3, 2012, 416
- I. Kalimullin, “Algorithmic reducibilities of algebraic structures”, Journal of Logic and Computation, 22, № 4, 2012, 831
- Mariya I. Soskova, 7921, The Nature of Computation. Logic, Algorithms, Applications, 2013, 371