- Barbara F. Csima, Bakhadyr Khoussainov, Jiamou Liu, 5028, Logic and Theory of Algorithms, 2008, 139
- Sergey Goncharov, Valentina Harizanov, Julia Knight, Charles McCoy, Russell Miller, Reed Solomon, “Enumerations in computable structure theory”, Annals of Pure and Applied Logic, 136, no. 3, 2005, 219
- Barbara F. Csima, Jonathan Stephenson, “Finite computable dimension and degrees of categoricity”, Annals of Pure and Applied Logic, 170, no. 1, 2019, 58
- Dan Turetsky, “Coding in the automorphism group of a computably categorical structure”, J. Math. Log., 20, no. 03, 2020, 2050016
- Ekaterina B. Fokina, Valentina Harizanov, Alexander Melnikov, Turing's Legacy, 2014, 124
- Denis R. Hirschfeldt, “Degree spectra of relations on structures of finite computable dimension”, Annals of Pure and Applied Logic, 115, no. 1-3, 2002, 233
- Nikolay Bazhenov, Hsing‐Chien Tsai, “On the effective universality of mereological theories”, Mathematical Logic Qtrly, 68, no. 1, 2022, 48
- Bakhadyr Khoussainov, Tomasz Kowalski, “Computable Isomorphisms of Boolean Algebras with Operators”, Stud Logica, 100, no. 3, 2012, 481
- 144, Computable Structures and the Hyperarithmetical Hierarchy, 2000, 323
- Douglas Cenzer, Valentina Harizanov, David Marker, Carol Wood, “Preface”, Arch. Math. Logic, 48, no. 1, 2009, 1