|
|
Publications in Math-Net.Ru
-
A note on joins and meets for positive linear preorders
Sib. Èlektron. Mat. Izv., 20:1 (2023), 1–16
-
A class of low linear orders having computable presentations
Algebra Logika, 61:5 (2022), 552–570
-
Spectral universality of linear orders with one binary relation
Sibirsk. Mat. Zh., 61:3 (2020), 587–593
-
Punctual copies of algebraic structures
Sibirsk. Mat. Zh., 60:6 (2019), 1271–1285
-
Computable linear orders and limitwise monotonic functions
Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 157 (2018), 70–105
-
Sufficient conditions for the existence of $\mathbf0'$-limitwise monotonic functions for computable $\eta$-like linear orders
Sibirsk. Mat. Zh., 58:1 (2017), 107–121
-
Strongly $\eta$-representable degrees and limitwise monotonic functions
Algebra Logika, 50:4 (2011), 504–520
-
Initial segments of computable linear orders with additional computable predicates
Algebra Logika, 48:5 (2009), 564–579
-
One theorem about strongly $\eta$-representable sets
Izv. Vyssh. Uchebn. Zaved. Mat., 2009, no. 7, 77–81
© , 2024