- Ekaterina B. Fokina, Iskander Kalimullin, Russell Miller, “Degrees of categoricity of computable structures”, Arch. Math. Logic, 49, № 1, 2010,
51 
- N. A. Bazhenov, “2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms”, J Math Sci, 211, № 6, 2015,
738 - DAVID GONZALEZ, DINO ROSSEGGER, “SCOTT SENTENCE COMPLEXITIES OF LINEAR ORDERINGS”, J. symb. log., 2024,
1