This publication is cited in the following 12 articles:
Ekaterina B. Fokina, Valentina Harizanov, Alexander Melnikov, Turing's Legacy, 2014, 124
Michael Rathjen, “2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10”, Bull. symb. log, 17:2 (2011), 272
S. S. Goncharov, “Algoritmicheskaya slozhnost schetnykh modelei silno minimalnykh teorii”, Vestn. NGU. Ser. matem., mekh., inform., 8:2 (2008), 38–53
Helmut Schwichtenberg, “2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06”, Bull. symb. log., 13:2 (2007), 251
Sergei S. Goncharov, International Mathematical Series, 5, Mathematical Problems from Applied Logic II, 2007, 99
E. B. Fokina, “O spektrakh vychislimykh modelei”, Vestn. NGU. Ser. matem., mekh., inform., 6:4 (2006), 93–97
Bakhadyr Khoussainov, Denis R. Hirschfeldt, Pavel Semukhin, “An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated”, Notre Dame J. Formal Logic, 47:1 (2006)
E. B. Fokina, “O slozhnosti kategorichnykh teorii s vychislimymi modelyami”, Vestn. NGU. Ser. matem., mekh., inform., 5:2 (2005), 77–85
S. S. Goncharov, B. Khoussainov, “Complexity of Categorical Theories with Computable Models”, Algebra and Logic, 43:6 (2004), 365–373
Valentina S. Harizanov, “Computability-Theoretic Complexity of Countable Structures”, Bull. symb. log., 8:4 (2002), 457
Y.L. Ershov, S.S. Goncharov, A. Nerode, J.B. Remmel, Studies in Logic and the Foundations of Mathematics, 138, Handbook of Recursive Mathematics - Volume 1: Recursive Model Theory, 1998, vii
Valentina S. Harizanov, Studies in Logic and the Foundations of Mathematics, 138, Handbook of Recursive Mathematics - Volume 1: Recursive Model Theory, 1998, 3