Alaev Pavel Evgen'evich

Publications in Math-Net.Ru

1. The complexity of inversion in groups
   
   Algebra Logika, 62:2 (2023),  155–178
2. Критерий $\mathrm{P}$-вычислимости структур
   
   Algebra Logika, 61:5 (2022),  640–646
3. Finitely generated structures computable in polynomial time
   
   Sibirsk. Mat. Zh., 63:5 (2022),  953–974
4. Fields of algebraic numbers computable in polynomial time. II
   
   Algebra Logika, 60:6 (2021),  533–548
5. Polynomially computable structures with finitely many generators
   
   Algebra Logika, 59:3 (2020),  385–394
6. Fields of algebraic numbers computable in polynomial time. I
   
   Algebra Logika, 58:6 (2019),  673–705
7. Categoricity for primitive recursive and polynomial Boolean algebras
   
   Algebra Logika, 57:4 (2018),  389–425
8. Polynomial computability of fields of algebraic numbers
   
   Dokl. Akad. Nauk, 481:4 (2018),  355–357
9. Structures computable in polynomial time. II
   
   Algebra Logika, 56:6 (2017),  651–670
10. Structures computable in polynomial time. I
    
    Algebra Logika, 55:6 (2016),  647–669
11. Existence and uniqueness of structures computable in polynomial time
    
    Algebra Logika, 55:1 (2016),  106–112
12. Atomless Boolean algebras computable in polynomial time
    
    Sib. Èlektron. Mat. Izv., 13 (2016),  1035–1039
13. Ash’s theorem on $\Delta^0_\alpha$-categorical structures and a condition for infinite $\Delta^0_\alpha$-dimension
    
    Algebra Logika, 54:5 (2015),  551–574
14. On Sums of Computable Ordinals
    
    Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 14:2 (2014),  3–8
15. Computable ideals in $I$-algebras
    
    Algebra Logika, 49:2 (2010),  157–174
16. Computability on linear orderings enriched with predicates
    
    Algebra Logika, 48:5 (2009),  549–563
17. Countably categorical and autostable Boolean algebras with distinguished ideals
    
    Mat. Tr., 11:1 (2008),  3–24
18. A generalized Feiner hierarchy
    
    Sibirsk. Mat. Zh., 49:2 (2008),  243–255
19. Strongly constructive Boolean algebras
    
    Algebra Logika, 44:1 (2005),  3–23
20. Autostable $\rm I$-Algebras
    
    Algebra Logika, 43:5 (2004),  511–550
21. Computable Homogeneous Boolean Algebras and a Metatheorem
    
    Algebra Logika, 43:2 (2004),  133–158
22. Decidable Boolean Algebras of Characteristic $(1,0,1)$
    
    Mat. Tr., 7:1 (2004),  3–12
23. Hyperarithmetical Boolean algebras with a distinguished ideal
    
    Sibirsk. Mat. Zh., 45:5 (2004),  963–976
24. Constructive and Non-Constructive Infinite Formulas in Computable Structures
    
    Algebra Logika, 42:4 (2003),  391–412
25. Computable families of superatomic Boolean algebras
    
    Sibirsk. Mat. Zh., 44:4 (2003),  717–725
26. Complexity of Boolean algebras and their Scott rank
    
    Algebra Logika, 38:6 (1999),  643–666
27. Scott ranks of Boolean algebras
    
    Trudy Inst. Mat. SO RAN, 30 (1996),  3–25


28. Evgenii Andreevich Palyutin (1945–2018)
    
    Sib. Èlektron. Mat. Izv., 16 (2019),  1–10
29. Sergei Ilyich Mardaev (6.04.1962–10.04.2013)
    
    Sib. Èlektron. Mat. Izv., 10 (2013),  30–34
30. Sergei Savost'yanovich Goncharov (on the occasion of his 60th birthday)
    
    Sibirsk. Mat. Zh., 52:5 (2011),  959–961