[AKMS89]Ash, Chris, Knight, Julia, Manasse, Mark, and Slaman, Theodore, Generic copies of countable structures, Annals of Pure and Applied Logic, vol. 42 (1989), no. 3, pp. 195–205.
[AK00]Ash, C.J. and Knight, J., Computable structures and the hyperarithmetical hierarchy, Studies in Logic and the Foundations of Mathematics, vol. 144, Elsevier Science, 2000.
[Bal06]Baleva, V., The jump operation for structure degrees, Archive for Mathematical Logic, vol. 45 (2006), no. 3, pp. 249–265.
[Chi90]Chisholm, John, Effective model theory vs. recursive model theory, this Journal, vol. 55 (1990), no. 3, pp. 1168–1191.
[Dev84]Devlin, Keith J., Constructibility, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1984.
[DJ94]Downey, Rod and Jockusch, Carl G., Every low Boolean algebra is isomorphic to a recursive one. Proceedings of the American Mathematical Society, vol. 122 (1994), no. 3, pp. 871–880.
[EP70]Enderton, H. B. and Putnam, Hilary, A note on the hyperarithmetical hierarchy, this Journal, vol. 35 (1970), pp. 429–430.
[Har68]Harrison, J., Recursive pseudo-well-orderings, Transactions of the American Mathematical Society, vol. 131 (1968), pp. 526–543.
[Kal09]Kalimullin, I. Sh., Relations between algebraic reducibilities of algebraic systems, Izvestiya Vysshikh Uchebnykh ZavedeniǏ. Matematika, vol. 53 (2009), no. 6, pp. 71–72.
[Khi04]Khisamiev, A. N., On the Ershov upper semilattice LE, SibirskiǏ MatematicheskiǏ Zhurnal, vol. 45 (2004), no. 1, pp. 211–228.
[Mon09]Montalbán, Antonio, Notes on the jump of a structure. Mathematical theory and computational practice, CiE 2009 (Ambos-Spies, Klaus, Löwe, Benedikt, and Merkle, Wolfgang, editors), Lecture Notes in Computer Science, vol. 5635, Springer, 2009, pp. 372–378.
[Mon10]Montalbán, Antonio, Coding and definability in computable structures, Notre Dame Journal of Formal Logic, to be published. Notes from a course at Notre Dame University, 2010.
[Mor04]Morozov, A. S., On the relation of Σ-reducibility between admissible sets, SibirskiǏ MatematicheskiǏ Zhurnal, vol. 45 (2004), no. 3, pp. 634–652.
[Puz09]Puzarenko, V. G., On a certain reducibility on admissible sets, SibirskiǏ MatematicheskiǏ Zhurnal, vol. 50 (2009), no. 2, pp. 415–429.
[Puz11]Puzarenko, Vadim, Fixed points of the jump operator, Algebra and Logic, vol. 50 (2011), no. 5, pp. 418–438.
[Ric77]Richter, Linda, Degrees of unsolvability of models, Ph.D. thesis, University of Illinois at Urbana-Champaign, 1977.
[Sos07]Soskova, Alexandra A., A jump inversion theorem for the degree spectra, Computation and logic in the real world, CiE 2007 (Cooper, S. Barry, Löwe, Benedikt, and Sorbi, Andrea, editors), Lecture Notes in Computer Science, vol. 4497, Springer-Verlag, 2007, pp. 716–726.
[SS09]Soskova, Alexandra A. and Soskov, Ivan N., A jump inversion theorem for the degree spectra, Journal of Logic and Computation, vol. 19 (2009), no. 1, pp. 199–215.
[Stu07]Stukachev, A. I., Degrees of presentability of models. I, Algebra Logika, vol. 46 (2007), no. 6, pp. 763–788 and 793–794.
[Stu08]Stukachev, A. I., On degrees of presentability of models. II, Algebra Logika, vol. 47 (2008), no. 1, pp. 108–126 and 131.
[Stu10]Stukachev, A. I., A jump inversion theorem for the semilattices of Sigma-degrees, Siberian Advances in Mathematics, vol. 20 (2010), no. 1, pp. 68–74.
[Stu]Stukachev, A. I., Effective model theory via the σ-definability approach, in a Lecture Notes in Logic volume, Association of Symbolic Logic and Cambridge University Press, to appear.