|
|
Publications in Math-Net.Ru |
Citations |
|
2023 |
1. |
P. E. Alaev, “The complexity of inversion in groups”, Algebra Logika, 62:2 (2023), 155–178 |
|
2022 |
2. |
P. E. Alaev, “Êðèòåðèé $\mathrm{P}$-âû÷èñëèìîñòè ñòðóêòóð”, Algebra Logika, 61:5 (2022), 640–646 |
3. |
P. E. Alaev, “Finitely generated structures computable in polynomial time”, Sibirsk. Mat. Zh., 63:5 (2022), 953–974 ; Siberian Math. J., 63:5 (2022), 801–818 |
8
|
|
2021 |
4. |
P. E. Alaev, V. L. Selivanov, “Fields of algebraic numbers computable in polynomial time. II”, Algebra Logika, 60:6 (2021), 533–548 |
2
|
|
2020 |
5. |
P. E. Alaev, “Polynomially computable structures with finitely many generators”, Algebra Logika, 59:3 (2020), 385–394 ; Algebra and Logic, 59:3 (2020), 266–272 |
9
|
|
2019 |
6. |
P. E. Alaev, V. L. Selivanov, “Fields of algebraic numbers computable in polynomial time. I”, Algebra Logika, 58:6 (2019), 673–705 ; Algebra and Logic, 58:6 (2020), 447–469 |
18
|
|
2018 |
7. |
P. E. Alaev, “Categoricity for primitive recursive and polynomial Boolean algebras”, Algebra Logika, 57:4 (2018), 389–425 ; Algebra and Logic, 57:4 (2018), 251–274 |
12
|
8. |
P. E. Alaev, V. L. Selivanov, “Polynomial computability of fields of algebraic numbers”, Dokl. Akad. Nauk, 481:4 (2018), 355–357 ; Dokl. Math., 98:1 (2018), 341–343 |
2
|
|
2017 |
9. |
P. E. Alaev, “Structures computable in polynomial time. II”, Algebra Logika, 56:6 (2017), 651–670 ; Algebra and Logic, 56:6 (2018), 429–442 |
12
|
|
2016 |
10. |
P. E. Alaev, “Structures computable in polynomial time. I”, Algebra Logika, 55:6 (2016), 647–669 ; Algebra and Logic, 55:6 (2017), 421–435 |
34
|
11. |
P. E. Alaev, “Existence and uniqueness of structures computable in polynomial time”, Algebra Logika, 55:1 (2016), 106–112 ; Algebra and Logic, 55:1 (2016), 72–76 |
20
|
12. |
P. E. Alaev, “Atomless Boolean algebras computable in polynomial time”, Sib. Èlektron. Mat. Izv., 13 (2016), 1035–1039 |
3
|
|
2015 |
13. |
P. E. Alaev, “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 ; Algebra and Logic, 54:5 (2015), 353–369 |
|
2014 |
14. |
P. E. Alaev, “On Sums of Computable Ordinals”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 14:2 (2014), 3–8 ; J. Math. Sci., 211:6 (2015), 719–723 |
|
2010 |
15. |
P. E. Alaev, “Computable ideals in $I$-algebras”, Algebra Logika, 49:2 (2010), 157–174 ; Algebra and Logic, 49:2 (2010), 103–114 |
1
|
|
2009 |
16. |
P. E. Alaev, J. Thurber, A. N. Frolov, “Computability on linear orderings enriched with predicates”, Algebra Logika, 48:5 (2009), 549–563 ; Algebra and Logic, 48:5 (2009), 313–320 |
21
|
|
2008 |
17. |
P. E. Alaev, “Countably categorical and autostable Boolean algebras with distinguished ideals”, Mat. Tr., 11:1 (2008), 3–24 ; Siberian Adv. Math., 18:4 (2008), 227–241 |
2
|
18. |
P. E. Alaev, “A generalized Feiner hierarchy”, Sibirsk. Mat. Zh., 49:2 (2008), 243–255 ; Siberian Math. J., 49:2 (2008), 191–201 |
|
2005 |
19. |
P. E. Alaev, “Strongly constructive Boolean algebras”, Algebra Logika, 44:1 (2005), 3–23 ; Algebra and Logic, 44:1 (2005), 1–12 |
5
|
|
2004 |
20. |
P. E. Alaev, “Autostable $\rm I$-Algebras”, Algebra Logika, 43:5 (2004), 511–550 ; Algebra and Logic, 43:5 (2004), 285–306 |
13
|
21. |
P. E. Alaev, “Computable Homogeneous Boolean Algebras and a Metatheorem”, Algebra Logika, 43:2 (2004), 133–158 ; Algebra and Logic, 43:2 (2004), 73–87 |
11
|
22. |
P. E. Alaev, “Decidable Boolean Algebras of Characteristic $(1,0,1)$”, Mat. Tr., 7:1 (2004), 3–12 ; Siberian Adv. Math., 15:1 (2005), 1–10 |
6
|
23. |
P. E. Alaev, “Hyperarithmetical Boolean algebras with a distinguished ideal”, Sibirsk. Mat. Zh., 45:5 (2004), 963–976 ; Siberian Math. J., 45:5 (2004), 795–805 |
7
|
|
2003 |
24. |
P. E. Alaev, “Constructive and Non-Constructive Infinite Formulas in Computable Structures”, Algebra Logika, 42:4 (2003), 391–412 ; Algebra and Logic, 42:4 (2003), 219–231 |
1
|
25. |
P. E. Alaev, “Computable families of superatomic Boolean algebras”, Sibirsk. Mat. Zh., 44:4 (2003), 717–725 ; Siberian Math. J., 44:4 (2003), 561–567 |
|
1999 |
26. |
P. E. Alaev, “Complexity of Boolean algebras and their Scott rank”, Algebra Logika, 38:6 (1999), 643–666 |
|
1996 |
27. |
P. E. Alaev, “Scott ranks of Boolean algebras”, Trudy Inst. Mat. SO RAN, 30 (1996), 3–25 |
|
|
|
2019 |
28. |
Yu. L. Ershov, S. S. Goncharov, V. D. Mazurov, B. S. Baizhanov, B. Sh. Kulpeshov, P. E. Alaev, A. V. Vasil'ev, E. V. Vasil'ev, E. P. Vdovin, V. V. Verbovskii, A. A. Vikent'ev, D. Yu. Vlasov, M. A. Grechkoseeva, V. N. Zhelyabin, P. S. Kolesnikov, V. M. Kopytov, L. L. Maksimova, I. A. Mal'tsev, A. S. Morozov, A. A. Nikitin, E. V. Ovchinnikova, S. P. Odintsov, D. E. Pal'chunov, N. A. Peryazev, A. G. Pinus, L. N. Pobedin, A. P. Pozhidaev, B. Poizat, V. G. Puzarenko, D. O. Revin, V. N. Remeslennikov, N. S. Romanovskii, A. N. Ryaskin, S. S. Starchenko, A. A. Stepanova, S. V. Sudoplatov, E. I. Timoshenko, D. A. Tusupov, N. G. Khisamiev, V. A. Churkin, Z. Chatzidakis, M. V. Schwidefsky, K. M. Shegirov, I. P. Shestakov, “Evgenii Andreevich Palyutin (1945–2018)”, Sib. Èlektron. Mat. Izv., 16 (2019), 1–10 |
|
2013 |
29. |
P. E. Alaev, O. V. Bogopolski, A. V. Vasil'ev, S. S. Goncharov, Yu. L. Ershov, V. D. Mazurov, L. L. Maksimova, A. S. Morozov, S. P. Odintsov, D. E. Palchunov, V. G. Puzarenko, V. V. Rybakov, K. L. Rychkov, A. N. Ryaskin, I. A. Taimanov, A. S. Filyurin, D. G. Khramtsov, V. A. Churkin, “Sergei Ilyich Mardaev (6.04.1962–10.04.2013)”, Sib. Èlektron. Mat. Izv., 10 (2013), 30–34 |
|
2011 |
30. |
Yu. L. Ershov, V. D. Mazurov, P. E. Alaev, L. L. Maksimova, A. S. Morozov, S. P. Odintsov, D. E. Pal'chunov, E. A. Palyutin, S. Yu. Podzorov, “Sergei Savost'yanovich Goncharov (on the occasion of his 60th birthday)”, Sibirsk. Mat. Zh., 52:5 (2011), 959–961 |
|
Presentations in Math-Net.Ru |
|
|
Organisations |
|
|
|
|