This publication is cited in the following articles:
M. N. Leont'eva, “Relatively intrinsically computable relations on boolean algebras with a distinguished set of atoms”, Siberian Math. J., 61:3 (2020), 490–498
Fokina E.B. Harizanov V. Melnikov A., “Computable Model Theory”, Turing'S Legacy: Developments From Turing'S Ideas in Logic, Lecture Notes in Logic, 42, ed. Downey R., Cambridge Univ Press, 2014, 124–194
Csima B.F., Harizanov V.S., Miller R., Montalban A., “Computability of Fraisse Limits”, J Symbolic Logic, 76:1 (2011), 66–93
P. E. Alaev, “Computable ideals in $I$-algebras”, Algebra and Logic, 49:2 (2010), 103–114
Downey R., Lempp S., Wu G., “On the Complexity of the Successivity Relation in Computable Linear Orderings”, Journal of Mathematical Logic, 10:1–2 (2010), 83–99
Cenzer D., Harizanov V., Marker D., Wood C., “Special Issue: The workshop on Model Theory and Computable Model Theory, 2007 Preface”, Archive For Mathematical Logic, 48:1 (2009), 1–6
Chubb J., Frolov A., Harizanov V., “Degree spectra of the successor relation of computable linear orderings”, Archive For Mathematical Logic, 48:1 (2009), 7–13
Chisholm J., Chubb J., Harizanov V.S., Hirschfeldt D.R., Jockusch Carl G. Jr., Mcnicholl T., Pingrey S., “Pi(0)(1) classes and strong degree spectra of relations”, Journal of Symbolic Logic, 72:3 (2007), 1003–1018
Harizanov V.S., Miller R.G., “Spectra of structures and relations”, Journal of Symbolic Logic, 72:1 (2007), 324–348
P. M. Semukhin, “The degree spectra of definable relations on Boolean algebras”, Siberian Math. J., 46:4 (2005), 740–750
