|
|
Publications in Math-Net.Ru
-
Negative numberings in admissible sets. II
Mat. Tr., 26:2 (2023), 86–128
-
Negative numberings in admissible sets. I
Mat. Tr., 26:1 (2023), 47–92
-
О степенях относительной вычислимой категоричности
Algebra Logika, 61:3 (2022), 353–358
-
Punctual categoricity spectra of computably categorical structures
Algebra Logika, 60:3 (2021), 335–343
-
Constructing punctually categorical semigroups
Algebra Logika, 59:5 (2020), 600–605
-
Semidecidable numberings in admissible sets
Algebra Logika, 59:3 (2020), 395–402
-
Computable positive and Friedberg numberings in hyperarithmetic
Algebra Logika, 59:1 (2020), 66–83
-
Positive numberings in admissible sets
Sibirsk. Mat. Zh., 61:3 (2020), 607–621
-
Primitive recursive fields and categoricity
Algebra Logika, 58:1 (2019), 132–138
-
Punctual copies of algebraic structures
Sibirsk. Mat. Zh., 60:6 (2019), 1271–1285
-
Partial decidable presentations in hyperarithmetic
Sibirsk. Mat. Zh., 60:3 (2019), 599–609
-
Positive presentations of families in relation to reducibility with respect to enumerability
Algebra Logika, 57:4 (2018), 492–498
-
Jump inversions of algebraic structures and the $\Sigma$-definability
Algebra Logika, 57:2 (2018), 243–249
-
Degree spectra of structures
Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 158 (2018), 23–39
-
Degrees of enumerations of countable Wehner-like families
Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 157 (2018), 59–69
-
Positive presentations of families relative to $e$-oracles
Sibirsk. Mat. Zh., 59:4 (2018), 823–833
-
Computable embedding of classes of algebraic structures with congruence relation
Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 160:4 (2018), 731–737
-
The diversity of categoricity without delay
Algebra Logika, 56:2 (2017), 256–266
-
Computability of distributive lattices
Sibirsk. Mat. Zh., 58:6 (2017), 1236–1251
-
Degrees of categoricity vs. strong degrees of categoricity
Algebra Logika, 55:2 (2016), 257–263
-
A hierarchy of classes of families and $n$-low degrees
Algebra Logika, 54:4 (2015), 536–541
-
On limitwise monotonic reducibility of $\Sigma_2^0$-sets
Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 156:1 (2014), 22–30
-
Limitwise monotonic spectra of $\Sigma^0_2$-sets
Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 154:2 (2012), 107–116
-
Reducibility on families
Algebra Logika, 48:1 (2009), 31–53
-
Relations between algorithmic reducibilities of algebraic systems
Izv. Vyssh. Uchebn. Zaved. Mat., 2009, no. 6, 71–72
-
Uniform reducibility of representability problems for algebraic structures
Sibirsk. Mat. Zh., 50:2 (2009), 334–343
-
Almost computably enumerable families of sets
Mat. Sb., 199:10 (2008), 33–40
-
Restrictions on the degree spectra of algebraic structures
Sibirsk. Mat. Zh., 49:6 (2008), 1296–1309
-
Spectra of degrees of some structures
Algebra Logika, 46:6 (2007), 729–744
-
Computability Principles on Admissible Sets
Mat. Tr., 7:2 (2004), 35–71
-
Splitting Properties of Total Enumeration Degrees
Algebra Logika, 42:1 (2003), 3–25
-
On elementary theories of semilattices of $n$-recursively enumerable degrees with respect to enumerability
Izv. Vyssh. Uchebn. Zaved. Mat., 2001, no. 4, 24–27
-
Relative complements in $\Delta_2^0$-degrees with respect to enumerability
Algebra Logika, 39:5 (2000), 547–566
-
Marat Mirzaevich Arslanov (on his eightieth birthday)
Uspekhi Mat. Nauk, 79:2(476) (2024), 189–193
-
On the 75th birth anniversary of Marat Mirzaevich Arslanov
Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 161:1 (2019), 152–160
-
Professor M. M. Arslanov and a fixed-point theorem
Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 156:1 (2014), 154–156
© , 2024