Calvert W., Knight J.F., Millar J., “Computable trees of Scott rank omega(CK)(1), and computable approximation”, Journal of Symbolic Logic, 71:1 (2006), 283–298
Barbara F. Csima, Antonio Montalbán, Richard A. Shore, “Boolean Algebras, Tarski Invariants, and Index Sets”, Notre Dame J. Formal Logic, 47:1 (2006)
Calvert W., “The isomorphism problem for computable Abelian p-groups of bounded length”, Journal of Symbolic Logic, 70:1 (2005), 331–345
Goncharov SS, Harizanov VS, Knight JF, et al, “Pi(1)(1) relations and paths through O”, Journal of Symbolic Logic, 69:2 (2004), 585–611
Calvert W, “The isomorphism problem for classes of computable fields”, Archive For Mathematical Logic, 43:3 (2004), 327–336
Khoussainov B., Nies A., Rubin S., Stephan F., “Automatic structures: Richness and limitations”, 19th Annual IEEE Symposium on Logic in Computer Science, Proceedings, Proceedings/Symposium on Logic in Computer Science, 2004, 44–53
White WM, “On the complexity of categoricity in computable structures”, Mathematical Logic Quarterly, 49:6 (2003), 603–614