- Peter A. Cholak, Rodney Downey, Leo A. Harrington, “The Complexity of Orbits of Computably Enumerable Sets”, Bull. symb. log., 14, № 1, 2008, 69
- Ekaterina B. Fokina, Valentina Harizanov, Alexander Melnikov, Turing's Legacy, 2014, 124
- J. Johnson, J. F. Knight, V. Ocasio, J. Tussupov, S. VanDenDriessche, “Preserving Categoricity and Complexity of Relations”, Algebra Logic, 54, № 2, 2015, 140
- Ekaterina Fokina, Dino Rossegger, Luca San Mauro, “Bi‐embeddability spectra and bases of spectra”, Mathematical Logic Qtrly, 65, № 2, 2019, 228
- W. Calvert, S. S. Goncharov, J. F. Knight, Jessica Millar, “Categoricity of computable infinitary theories”, Arch. Math. Logic, 48, № 1, 2009, 25
- Wesley Calvert, Douglas Cenzer, Valentina Harizanov, Andrei Morozov, “Effective categoricity of equivalence structures”, Annals of Pure and Applied Logic, 141, № 1-2, 2006, 61
- Peter Cholak, Rodney Downey, Leo Harrington, “On the orbits of computably enumerable sets”, J. Amer. Math. Soc., 21, № 4, 2008, 1105
- Julia F. Knight, Vikram Saraph, “Scott sentences for certain groups”, Arch. Math. Logic, 57, № 3-4, 2018, 453
- Sergei S. Goncharov, 5, Mathematical Problems from Applied Logic II, 2007, 99
- 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