Publications in Refereed Journals and Volumes




On c-simple theories, Algebra and Logic, submitted.

Processes and structures on approximation spaces, Algebra and Logic, v. 56, N1 (2017), pp. 93 - 109.

Generalized hyperarithmetical computability on structures, Algebra and Logic, v. 55, N6 (2016), pp. 769 - 799.

Properties of sSigma-reducibility, Algebra and Logic, v. 53, N5 (2014), pp. 405 - 417.

Quasiregular structures with computable signatures, Siberian Electronic Mathematical Reports, v. 11 (2014), pp. 444 - 450 (Russian).

On processes and structures, Lecture Notes in Computer Science, 2013, v. 7921, pp. 393 - 402.

Effective model theory: an approach via Sigma-definability, In N. Greenberg, J.D. Hamkins, D. Hirschfeldt and R. Miller (eds.): Effective Mathematics of the Uncountable, 2013, Cambridge University Press, Lecture Notes in Logic, v. 41, pp. 164 - 197.

HF-computability, co-authored with Yu.L. Ershov and V.G. Puzarenko, In S. B. Cooper and A. Sorbi (eds.): Computability in Context: Computation and Logic in the Real World, Imperial College Press/World Scientific (2011), pp. 173 - 248.

Sigma-definability of uncountable models of c-simple theories, Siberian Mathematical Journal, v. 51, N3 (2010), pp. 649 - 661.

A jump inversion theorem for the semilattices of Sigma-degrees, Siberian Advances in Mathematics, v. 20, N1 (2010), pp. 68 - 74.

A jump inversion theorem for the semilattices of Sigma-degrees, Siberian Electronic Mathematical Reports, v. 6 (2009), pp. 182 - 190 (Russian).

Degrees of presentability of structures. II, Algebra and Logic, v. 47, N1 (2008), pp. 65 - 74.

Degrees of presentability of structures. I, Algebra and Logic, v. 46, N6 (2007), pp. 419 - 432.

Effective reducibilities on structures and degrees of presentability, in S.B. Cooper, T.F. Kent, B. Lowe and A. Sorbi (eds.): Computation and Logic in the Real World, University of Siena, Italy, Technical report no. 478 (2007), pp. 332 - 339.

On inner constructivizability of admissible sets, in A. Beckmann, U. Berger, B. Lowe, and J.V. Tucker (eds.): Logical Approaches to Computational Barriers, University of Wales Swansea, Computer Science Report Series (2006), pp. 261 - 267.

On mass problems of presentability, in J.Y. Cai, S.B. Cooper, A. Li (Eds.): Theory and Applications of Models of Computation, Lecture Notes in Computer Science, v. 3959 (2006), pp. 774 - 784, Springer-Verlag, Berlin, Heidelberg.

Presentations of structures in admissible sets, in S.B.Cooper, B.Lowe, L.Torenvliet (Eds.): New Computational Paradigms, Lecture Notes in Computer Sciense, v. 3526 (2005), pp. 470 - 478, Springer-Verlag, Berlin, Heidelberg.

On inner constructivizability of admissible sets, Vestnik NGU, v. 5, N1 (2005), pp. 69 - 76 (Russian).

$\Sigma$-definability in hereditary finite superstructures and pairs of models, Algebra and Logic, v. 43, N4 (2004), pp. 258 - 270.

$\Sigma$-admissible families over linear orders, Algebra and Logic, v. 41, N2 (2002), pp. 127 - 139.

Uniformization property in heredidary finite superstructures, Siberian Advances in Mathematics, v.7, N1 (1997), pp. 123 - 132.