Kudinov Oleg Viktorovich

Publications in Math-Net.Ru

1. Order positive fields. I
   
   Algebra Logika, 62:3 (2023),  307–322
2. On the computability of ordered fields
   
   Sib. Èlektron. Mat. Izv., 20:2 (2023),  1341–1360
3. On mutual definability of operations on fields
   
   Sibirsk. Mat. Zh., 60:6 (2019),  1324–1334
4. On images of partial computable functions over computable Polish spaces
   
   Sib. Èlektron. Mat. Izv., 14 (2017),  418–432
5. Spectrum of the field of computable real numbers
   
   Algebra Logika, 55:6 (2016),  738–759
6. Index sets for $n$-decidable structures categorical relative to $m$-decidable presentations
   
   Algebra Logika, 54:4 (2015),  520–528
7. Definability of closure operations in the $h$-quasiorder of labeled forests
   
   Algebra Logika, 49:2 (2010),  181–194
8. Definability in the structure of words with the inclusion relation
   
   Sibirsk. Mat. Zh., 51:3 (2010),  575–583
9. The Effectively Enumerable Topological Spaces
   
   Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 8:2 (2008),  74–83
10. The Computable Dimension of $I$-Trees of Infinite Height
    
    Algebra Logika, 43:6 (2004),  702–729
11. The problem of describing autostable models
    
    Algebra Logika, 36:1 (1997),  26–36
12. Some properties of autostable models
    
    Algebra Logika, 35:6 (1996),  685–698
13. An autostable $1$-decidable model without a computable Scott family of $\exists$-formulas
    
    Algebra Logika, 35:4 (1996),  458–467
14. Compressed systems of finite approximations for sets in the class $\Sigma_2^0$
    
    Trudy Inst. Mat. SO RAN, 30 (1996),  111–113
15. Algebraic dependences and reducibilities of constructivizations in universal domains
    
    Trudy Inst. Mat. SO RAN, 25 (1993),  74–81
16. A criterion for the autostability of $1$-decidable models
    
    Algebra Logika, 31:5 (1992),  479–492