Russell Miller, “d-computable categoricity for algebraic fields”, J. symb. log., 74, № 4, 2009, 1325
Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov, Andrei Morozov, “Effective categoricity of Abelian p-groups”, Annals of Pure and Applied Logic, 159, № 1-2, 2009, 187
Noam Greenberg, Matthew Harrison-Trainor, Alexander Melnikov, Dan Turetsky, “Non-density in punctual computability”, Annals of Pure and Applied Logic, 172, № 9, 2021, 102985
Rod Downey, Alexander G. Melnikov, Keng Meng Ng, “Iterated effective embeddings of abelian p-groups”, Int. J. Algebra Comput., 24, № 07, 2014, 1055
Matthew Harrison-Trainor, Alexander Melnikov, Antonio Montalbán, “Independence in computable algebra”, Journal of Algebra, 443, 2015, 441
ALEXANDER G. MELNIKOV, “COMPUTABLE ABELIAN GROUPS”, Bull. symb. log, 20, № 3, 2014, 315
Hakim J. Walker, “Computable isomorphisms for certain classes of infinite graphs”, J. Knot Theory Ramifications, 27, № 07, 2018, 1841012
Alexander G. Melnikov, 6158, Programs, Proofs, Processes, 2010, 321
Steffen Lempp, Charles McCoy, Russell Miller, Reed Solomon, “Computable categoricity of trees of finite height”, J. symb. log., 70, № 1, 2005, 151
Bakhadyr Khoussainov, Tomasz Kowalski, “Computable Isomorphisms of Boolean Algebras with Operators”, Stud Logica, 100, № 3, 2012, 481