Badaev Serikzhan Agybaevich

Publications in Math-Net.Ru

1. Полурешётки Роджерса с наименьшим и наибольшим элементами в иерархии Ершова
   
   Algebra Logika, 61:3 (2022),  334–340
2. One-element rogers semilattices in the Ershov hierarchy
   
   Algebra Logika, 60:4 (2021),  433–437
3. Special classes of positive preorders
   
   Sib. Èlektron. Mat. Izv., 18:2 (2021),  1657–1666
4. The structure of computably enumerable preorder relations
   
   Algebra Logika, 59:3 (2020),  293–314
5. Some absolute properties of $A$-computable numberings
   
   Algebra Logika, 57:4 (2018),  426–447
6. Generalized computable universal numberings
   
   Algebra Logika, 53:5 (2014),  555–569
7. Families without minimal numberings
   
   Algebra Logika, 53:4 (2014),  427–450
8. Some remarks on completion of numberings
   
   Sibirsk. Mat. Zh., 49:5 (2008),  986–991
9. Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
   
   Algebra Logika, 45:6 (2006),  637–654
10. Elementary Theories for Rogers Semilattices
    
    Algebra Logika, 44:3 (2005),  261–268
11. Minimal coverings in the Rogers semilattices of $\Sigma_n^0$-computable numberings
    
    Sibirsk. Mat. Zh., 43:4 (2002),  769–778
12. Rogers Semilattices of Families of Arithmetic Sets
    
    Algebra Logika, 40:5 (2001),  507–522
13. Families with a one-element Rogers semilattice
    
    Algebra Logika, 37:1 (1998),  36–62
14. Minimal enumerations of positively computable families
    
    Algebra Logika, 33:3 (1994),  233–254
15. Minimal enumerations
    
    Trudy Inst. Mat. SO RAN, 25 (1993),  3–34
16. On cardinality of semilattices of enumerations of nondiscrete families
    
    Sibirsk. Mat. Zh., 34:5 (1993),  3–10
17. On a problem of S. S. Goncharov
    
    Sibirsk. Mat. Zh., 32:3 (1991),  212–214
18. Weakly precomplete positive equivalences
    
    Sibirsk. Mat. Zh., 32:2 (1991),  166–169
19. Computable enumerations of families of general recursive functions
    
    Algebra Logika, 16:2 (1977),  129–148
20. Positive numerations
    
    Sibirsk. Mat. Zh., 18:3 (1977),  483–496
21. Incomparable numerations
    
    Sibirsk. Mat. Zh., 15:4 (1974),  730–738