|
|
Publications in Math-Net.Ru
-
Boolean algebras autostable relative to $n$-decidable presentations
Algebra Logika, 61:4 (2022), 443–460
-
Relatively intrinsically computable relations on boolean algebras with a distinguished set of atoms
Sibirsk. Mat. Zh., 61:3 (2020), 622–633
-
Strong constructivizability of Boolean algebras of elementary characteristic $(\infty,0,0)$
Algebra Logika, 53:2 (2014), 185–205
-
A remark on a paper of I. V. Latkin
Algebra Logika, 52:5 (2013), 642–645
-
The minimality of certain decidability conditions for Boolean algebras
Sibirsk. Mat. Zh., 53:1 (2012), 132–147
-
Boolean algebras of elementary characteristic (1,0,1) whose set of atoms and Ershov–Tarski ideal are computable
Algebra Logika, 50:2 (2011), 133–151
-
Sufficient Conditions of Decidability of Boolean Algebras
Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 11:4 (2011), 63–68
-
Boolean Algebras of Elementary Characteristic $(1,0,1)$ with the Computable Set of Atoms and the Ideal of Atomic Elements
Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 10:1 (2010), 65–69
© , 2024