1. Adian, S.I.: The unsolvability of certain algorithmic problems in the theory of groups. Trudy Moskov. Mat. Obsc. 6, 231–298 (1957)
2. Adian, S.I.: Finitely presented groups and algorithms. Dokl. Akad. Nauk SSSR 117, 9–12 (1957)
3. Ash, C., Knight, J.F.: Computable Structures and the Hyperarithmetical Hierarchy. Elsevier, Amsterdam (2000)
4. Boone, W.W., Rogers Jr., H.: On a problem of J.H.C. Whitehead and a problem of Alonzo Church. Math. Scand. 19, 185–192 (1966)
5. Calvert, W., Harizanov, V.S., Knight, J.F., Miller, S.: Index sets of computable structures. Algebra Logic 45, 306–325 (2006)