[1]Ambos-Spies, Klaus, , vol. 31 (1985), pp. 461–467.

[2]Ambos-Spies, Klaus, , vol. 22 (1986), pp. 113–117.

[3]Andrews, Uri, Lempp, Steffen, Miller, Joseph S., Ng, Keng Meng, SanMauro, Luca, and Sorbi, Andrea, .

[4]Balcázar, J. L., Díaz, J., and Gabarró, J., , vol. 11, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Heidelberg, 1988.

[5]Bernardi, Claudio and Sorbi, Andrea, Classifying positive equivalence relations, this Journal, vol. 48 (1983), no. 3, pp. 529–538.

[6]Buss, Sam, Chen, Yijia, Flum, Jörg, Friedman, Sy-David, and Müller, Moritz, Strong isomorphism reductions in complexity theory, this Journal, vol. 76 (2011), pp. 1381–1402.

[7]Calvert, Wesley, , vol. 43 (2004), no. 3, pp. 327–336.

[8]Calvert, Wesley, Harizanov, Valentina S., Knight, Julia F., and Miller, Sara, , vol. 353 (2001), pp. 491–518.

[9]Camerlo, Riccardo and Gao, Su, , vol. 67 (2001), no. 1, pp. 27–59.

[10]Cholak, Peter, Dzhafarov, Damir, Schweber, Noah, and Shore, Richard, , vol. 1 (2012), no. 2, pp. 99–107.

[11]Coskey, Samuel, Hamkins, Joel D., and Miller, Russell, , vol. 1 (2012), no. 1, pp. 15–38.

[12]Ershov, Yu. L., , 1977.

[13]Fokina, Ekaterina B., Friedman, Sy-David, Harizanov, Valentina, Knight, Julia F., McCoy, Charles, and Montalbán, Antonio, Isomorphism relations on computable structures, this Journal, vol. 77 (2012), no. 1, pp. 122–132.

[14]Fokina, Ekaterina B. and Friedman, Sy-David, *On* ${\rm{\Sigma }}_1^1 $, vol. 58 (2012), no. 1–2, pp. 113–124. [15]Fokina, Ekaterina B., Friedman, Sy-David, and Nies, André, *Equivalence relations that are* ${\rm{\Sigma }}_3^0 $ (Ong, Luke and de Queiroz, Ruy, editors), , vol. 7456, Springer, pp. 26–33. [16]Fortnow, Lance and Grochow, Joshua A., , vol. 209 (2011), no. 4, pp. 748–763.

[17]Gao, Su, , vol. 293, CRC Press, Boca Raton, FL, 2009.

[18]Gao, Su and Gerdes, Peter, , vol. 67 (2001), no. 1, pp. 27–59.

[20]Kuske, Dietrich, Liu, Jiamou, and Lohrey, Markus, , 2010, IEEE Computer Society, Los Alamitos, CA, pp. 160–169.

[21]Lyndon, Roger C. and Schupp, Paul E., Combinatorial group theory, Springer-Verlag, 1977.

[22]Maass, Wolfgang and Stob, Mike, , vol. 24 (1983), pp. 189–212.

[23]Melnikov, Alexander G. and Nies, André, , 2013, pp. 320–328.

[24]Montagna, Franco and Sorbi, Andrea, Universal recursion-theoretic properties of r.e. preordered structures, this Journal, vol. 50 (1985), no. 2, pp. 397–406.

[25]Nies, André, , vol. 187, Dekker, New York, 1997, pp. 261–276.

[26]Nies, André, Coding methods in computability theory and complexity theory, Habilitationsschrift, Universität Heidelberg, 1998, available at http://arxiv.org/abs/1308.6399. [27]Odifreddi, Piergiorgio, , vol. (1981), no. 1, pp. 37–86.

[28]Pour-El, Marian Boykan and Kripke, Saul, , vol. 61 (1967), pp. 141–163.

[29]Smullyan, Raymond, , vol. 47, Princeton University Press, Princeton, NJ, 1961.

[30]Soare, Robert I., , Omega Series, Springer-Verlag, Heidelberg, 1987.