Alaev Pavel Evgen'evich

Publications in Math-Net.Ru

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


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