Voir la notice de l'article provenant de la source Math-Net.Ru
[1] I. Kalimullin, A. Melnikov, K. M. Ng, “Algebraic structures computable without delay”, Theoret. Comput. Sci., 674 (2017), 73–98
[2] I. Sh. Kalimullin, “Punctual structures and primitive recursive reducibility”, Lobachevskii J. Math., 43:3 (2022), 582–586
[3] I. Kalimullin, A. Melnikov, A. Montalbán, “Punctual definability on structures”, Ann. Pure Appl. Logic, 172:8 (2021), 102987, 18 pp.
[4] I. Sh. Kalimullin, “Ogranicheniya na spektry stepenei algebraicheskikh struktur”, Sib. matem. zh., 49:6 (2008), 1296–1310
[5] I. Sh. Kalimullin, A. G. Melnikov, “Punctual categoricity relative to a computable oracle”, Lobachevskii J. Math., 42:4 (2021), 735–742
[6] N. A. Bazhenov, I. Sh. Kalimullin, “Spektry punktualnoi kategorichnosti vychislimo kategorichnykh struktur”, Algebra i logika, 60:3 (2021), 335–343
[7] I. Sh. Kalimullin, A. G. Melnikov, K. M. Ng, “Razlichnye versii kategorichnosti bez zaderzhek”, Algebra i logika, 56:2 (2017), 256–266
[8] J. N. Y. Franklin, R. Solomon, “Degrees that are low for isomorphism”, Computability, 3:2 (2014), 73–89