- Víctor A. Ocasio-González, 7318, How the World Computes, 2012, 539
- Antonio Montalbán, 5635, Mathematical Theory and Computational Practice, 2009, 372
- J. Johnson, J. F. Knight, V. Ocasio, J. Tussupov, S. VanDenDriessche, “Preserving Categoricity and Complexity of Relations”, Algebra Logic, 54, № 2, 2015, 140
- N. A. Bazhenov, “2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms”, J Math Sci, 211, № 6, 2015, 738
- N. A. Bazhenov, “Δ 2 0 -Categoricity of Boolean Algebras”, J Math Sci, 203, № 4, 2014, 444
- Antonio Montalbán, “Rice sequences of relations”, Phil. Trans. R. Soc. A., 370, № 1971, 2012, 3464
- N. A. Bazhenov, “Categoricity Spectra of Computable Structures”, J Math Sci, 256, № 1, 2021, 34
- J. A. Tussupov, “Categoricity and Complexity of Relations Over Algebraic Structures”, Algebra Logic, 54, № 5, 2015, 408
- Nikolay Bazhenov, Ekaterina Fokina, Dino Rossegger, Luca San Mauro, “Degrees of bi-embeddable categoricity”, COM, 10, № 1, 2021, 1
- Ekaterina Fokina, Valentina Harizanov, Daniel Turetsky, “Computability-theoretic categoricity and Scott families”, Annals of Pure and Applied Logic, 170, № 6, 2019, 699