1. R. G. Downey, S. S. Goncharov, A. M. Kach, J. F. Knight, O. V. Kudinov,
A. G. Melnikov, and D. Turetsky, “Decidability and computability of certain torsion-free abelian
groups,” Notre Dame J. Formal Logic 51, 85
(2010).
2. R. G. Downey, A. M. Kach, S. Lempp, A. E. M. Lewis-Pye,
A Montalbá’n, and D. D. Turetsky, “The complexity of computable categoricity,” Adv.
Math. 268, 423 (2015).
3. Yu. L. Ershov and S. S. Goncharov, Constructive
Models (Nauchnaya Kniga, Novosibirsk, 1999) [Constructive Models (Consultants Bureau, New York, 2000)].
4. S. S. Goncharov, “Problem of the number of non-self-equivalent
constructivizations,” Algebra i logika 19, 621 (1980)
[Algebra and Logic 19, 401 (1980)].
5. S. S. Goncharov, “ The problem of the number of nonautoequivalent
constructivizations,” Dokl. Akad. Nauk SSSR 251,
271 (1980) [Soviet Math., Dokl. 21, 411
(1980)].