- On
complexity of categorical
theories with
computable models, Vestnik NGU, 5
(2005), no.2,
pp. 78-86 (in Russian).
- On
spectra of computable
models, Vestnik NGU, 6 (2006), no.6, pp. 69-73 (in
Russian).
- Arithmetical
Turing degrees
and categorical
teories of computable models, Mathematical Logic in Asia.
Proceedings of the
9th Asian Logic Conference, 2006, pp. 58-69.
- Index
sets of decidable
structures, Siberian Mathematical
Journal, 48 (2007), no. 5, pp. 939-948.
- Index
Sets of Computable
Structures with
Decidable Theories, Computation and Logic in the Real World -
Third Conference of Computability in Europe, CiE 2007, Siena, Italy,
June 2007,
Proceedings, LNCS, v. 4497, pp. 290-296.
- Index
sets for classes of
high rank structures (with W. Calvert, S. S. Goncharov, J. F.
Knight, O. Kudinov, A. S. Morozov, V. Puzarenko), Journal of Symbolic
Logic, 72 (2007), no. 4, pp. 1418-1446.
- Algorithmic
properties of
structures for the
languages with two unary
functional symbols, Vestnik NGU, 8
(2008), no. 1, pp. 90-101 (in Russian).
- Algorithmic
properties of
structures for the
languages with two unary
functional symbols, Logic and Theory of
Algorithms, Local Proceedings of CiE'08, 2008, pp. 127-136.
- Index
sets for some classes of structures, Ann. Pure Applied Logic,
157 (2009), 139--147.
- Intrinsic
bounds on complexity and definability
at limit levels (with J. Chisholm, S. S. Goncharov, V.S.
Harizanov,
J. F. Knight, S. Miller), to appear in J. Symbolic Logic.
- Computable
embedding problem (with J. Carson, V. Harizanov, J. F.
Knight,
C. Maher, S. Quinn, J. Wallbaum), submitted.
- Equivalence Relations on Classes
of Computable Structures(with S. D. Friedman), submitted.
- Degrees of Categoricity of
Computable Structures (with I. Kalimullin and R. Miller),
submitted.
- Rank homogeneous trees, Boolean
algebras, and torsion-free Abelian groups (with
J. F. Knight, C. Maher, A. Melnikov, S. M. Quinn), submitted.
- Effective Theory of Borel
Equivalence Relations (with S. D. Friedman, A. Törnquist),
in preparation.
|