1. S. Lempp and T. Slaman, “The complexity of the index sets of ℵ0-categorical theories and of Ehrenfeucht theories,” to appear in Adv. Log., Proc. North Texas Log. Conf., October 8–10, 2004, Cont. Math., Am. Math. Soc.
2. B. F. Csima, A. Montalbán, and R. A. Shore, “Boolean algebras, Tarski invariants, and index sets,” to appear in Notre Dame J. Formal Logic.
3. W. Calvert, “The isomorphism problem for computable Abelian p-groups of bounded length,” J. Symb. Log., 70, No. 1, 331–345 (2005).
4. W. Calvert, “The isomorphism problem for classes of computable fields,” Arch. Math. Log., 75, No. 3, 327–336 (2004).
5. W. Calvert, D. Cummins, J. F. Knight, and S. Miller, “Comparing classes of finite structures,” Algebra Logika, 43, No. 6, 666–701 (2004).