107 citations to https://www.mathnet.ru/rus/al201
-
Е. Б. Фокина, “Индексные множества разрешимых моделей”, Сиб. матем. журн., 48:5 (2007), 1167–1179 ; E. B. Fokina, “Index sets of decidable models”, Siberian Math. J., 48:5 (2007), 939–948
-
Khoussainov B., Nies A., Rubin S., Stephan F., “Automatic Structures: Richness and Limitations”, Logical Methods in Computer Science, 3:2 (2007), 2
-
Calvert W., Fokina E., Goncharov S.S., Knight J.F., Kudinov O., Morozov A.S., Puzarenko V., “Index sets for classes of high rank structures”, Journal of Symbolic Logic, 72:4 (2007), 1418–1432
-
Calvert W., Goncharov S.S., Knight J.F., “Computable structures of Scott rank omega(CK)(1) in familiar classes”, Advances in Logic, Contemporary Mathematics Series, 425, 2007, 49–66
-
Fokina E.B., “Index sets of computable structures with decidable theories”, Computation and Logic in the Real World, Proceedings, Lecture Notes in Computer Science, 4497, 2007, 290–296
-
Sergei S. Goncharov, International Mathematical Series, 5, Mathematical Problems from Applied Logic II, 2007, 99
-
У. Калверт, В. С. Харизанова, Д. Ф. Найт, С. Миллер, “Индексные множества вычислимых моделей”, Алгебра и логика, 45:5 (2006), 538–574 ; W. Calvert, V. S. Harizanova, J. F. Knight, S. Miller, “Index sets of computable structures”, Algebra and Logic, 45:5 (2006), 306–325
-
Н. Т. Когабаев, “Сложность некоторых естественных проблем на классе вычислимых $I$-алгебр”, Сиб. матем. журн., 47:2 (2006), 352–360 ; N. T. Kogabaev, “Complexity of some natural problems on the class of computable $I$-algebras”, Siberian Math. J., 47:2 (2006), 291–297
-
Н. С. Винокуров, “Индексные множества классов автоматных структур”, Сиб. матем. журн., 47:5 (2006), 1019–1030 ; N. S. Vinokurov, “Index sets of classes of automatic structures”, Siberian Math. J., 47:5 (2006), 835–843
-
Calvert W., Knight J.F., “Classification from a computable viewpoint”, Bulletin of Symbolic Logic, 12:2 (2006), 191–218