107 citations to https://www.mathnet.ru/rus/al201
-
Calvert W., “Pac Learning, Vc Dimension, and the Arithmetic Hierarchy”, Arch. Math. Log., 54:7-8 (2015), 871–883
-
Goncharov S.S. Bazhenov N.A. Marchuk M.I., “Index Sets of Autostable Relative To Strong Constructivizations Constructive Models For Familiar Classes”, Dokl. Math., 92:2 (2015), 525–527
-
Goncharov S.S., Marchuk M.I., “Index Sets of Constructive Models of Nontrivial Signature Autostable Relative To Strong Constructivizations”, Dokl. Math., 91:2 (2015), 158–159
-
М. В. Доржиева, “Элиминация метарекурсии из теоремы Оуинса”, Вестн. НГУ. Сер. матем., мех., информ., 14:1 (2014), 35–43
-
Melnikov A.G., “Computable Abelian Groups”, Bull. Symb. Log., 20:3 (2014), 315–356
-
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
-
J. F. Knight, “Using computability to measure complexity of algebraic structures and classes of structures”, Lobachevskii J Math, 35:4 (2014), 304
-
Ekaterina B. Fokina, Valentina Harizanov, Alexander Melnikov, Turing's Legacy, 2014, 124
-
Н. Т. Когабаев, “Сложность проблемы изоморфизма вычислимых проективных плоскостей”, Вестн. НГУ. Сер. матем., мех., информ., 13:1 (2013), 68–75 ; N. T. Kogabaev, “The complexity of isomorphism problem for computable projective planes”, J. Math. Sci., 203:4 (2014), 509–515
-
Kuske D., Liu J., Lohrey M., “The Isomorphism Problem for Omega-Automatic Trees”, Ann. Pure Appl. Log., 164:1 (2013), 30–48