- Sergei S. Goncharov, 5, Mathematical Problems from Applied Logic II, 2007, 99
- Ekaterina B. Fokina, Iskander Kalimullin, Russell Miller, “Degrees of categoricity of computable structures”, Arch. Math. Logic, 49, № 1, 2010, 51
- Walker M. White, “On the complexity of categoricity in computable structures”, Mathematical Logic Qtrly, 49, № 6, 2003, 603
- Denis R. Hirschfeldt, “Degree Spectra of Relations on Computable Structures”, Bull. symb. log., 6, № 2, 2000, 197
- N. T. Kogabaev, “Freely Generated Projective Planes with Finite Computable Dimension”, Algebra Logic, 55, № 6, 2017, 461
- Peter Cholak, Richard A. Shore, Reed Solomon, “A computably stable structure with no Scott family of finitary formulas”, Arch. Math. Logic, 45, № 5, 2006, 519
- Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richard A. Shore, Arkadii M. Slinko, “Degree spectra and computable dimensions in algebraic structures”, Annals of Pure and Applied Logic, 115, № 1-3, 2002, 71
- Wesley Calvert, Douglas Cenzer, Valentina Harizanov, Andrei Morozov, “Effective categoricity of equivalence structures”, Annals of Pure and Applied Logic, 141, № 1-2, 2006, 61
- N. T. Kogabaev, “The Theory of Projective Planes is Complete with Respect to Degree Spectra and Effective Dimensions”, Algebra Logic, 54, № 5, 2015, 387
- MATTHEW HARRISON-TRAINOR, “AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS”, Bull. symb. log, 28, № 1, 2022, 71