|
|
Publications in Math-Net.Ru
-
A note on joins and meets for positive linear preorders
Sib. Èlektron. Mat. Izv., 20:1 (2023), 1–16
-
On universal positive graphs
Sibirsk. Mat. Zh., 64:1 (2023), 98–112
-
Minimal generalized computable numberings and families of positive preorders
Algebra Logika, 61:3 (2022), 280–307
-
Index sets for classes of positive preorders
Algebra Logika, 61:1 (2022), 42–76
-
One-element rogers semilattices in the Ershov hierarchy
Algebra Logika, 60:4 (2021), 433–437
-
Special classes of positive preorders
Sib. Èlektron. Mat. Izv., 18:2 (2021), 1657–1666
-
The structure of computably enumerable preorder relations
Algebra Logika, 59:3 (2020), 293–314
-
Weakly precomplete equivalence relations in the Ershov hierarchy
Algebra Logika, 58:3 (2019), 297–319
-
Rogers semilattices for families of equivalence relations in the Ershov hierarchy
Sibirsk. Mat. Zh., 60:2 (2019), 290–305
-
On dark computably enumerable equivalence relations
Sibirsk. Mat. Zh., 59:1 (2018), 29–40
-
Embeddability of the semilattice $\mathbf{L^0_m}$ in Rogers semilattices
Algebra Logika, 55:3 (2016), 328–340
© , 2024