|
|
Publications in Math-Net.Ru
-
Fields of algebraic numbers computable in polynomial time. II
Algebra Logika, 60:6 (2021), 533–548
-
Effective Wadge hierarchy in computable quasi-Polish spaces
Sib. Èlektron. Mat. Izv., 18:1 (2021), 121–135
-
Fields of algebraic numbers computable in polynomial time. I
Algebra Logika, 58:6 (2019), 673–705
-
Turing degrees in refinements of the arithmetical hierarchy
Algebra Logika, 57:3 (2018), 338–361
-
Polynomial computability of fields of algebraic numbers
Dokl. Akad. Nauk, 481:4 (2018), 355–357
-
Degree spectra of structures
Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 158 (2018), 23–39
-
Precomplete numberings
Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 157 (2018), 106–134
-
Boolean algebras of regular languages
Algebra Logika, 52:6 (2013), 676–711
-
Definability of closure operations in the $h$-quasiorder of labeled forests
Algebra Logika, 49:2 (2010), 181–194
-
Definability in the structure of words with the inclusion relation
Sibirsk. Mat. Zh., 51:3 (2010), 575–583
-
The quotient algebra of labeled forests modulo $h$-equivalence
Algebra Logika, 46:2 (2007), 217–243
-
Classifying Countable Boolean Terms
Algebra Logika, 44:2 (2005), 173–197
-
Variations on the Wadge Reducibility
Mat. Tr., 8:1 (2005), 135–175
-
Difference Hierarchy in $\varphi$-Spaces
Algebra Logika, 43:4 (2004), 425–444
-
Boolean Hierarchies of Partitions over a Reducible Base
Algebra Logika, 43:1 (2004), 77–109
-
Decidability of Hierarchies of Regular Aperiodic Languages
Algebra Logika, 41:5 (2002), 610–631
-
Refining the polynomial hierarchy
Algebra Logika, 38:4 (1999), 456–475
-
Precomplete numberings and functions without fixed points
Mat. Zametki, 51:1 (1992), 149–155
-
The fine hierarchy and definable index sets
Algebra Logika, 30:6 (1991), 705–725
-
Fine hierarchy of formulas
Algebra Logika, 30:5 (1991), 568–582
-
Jumps of certain classes of $\Delta^0_2$-sets
Mat. Zametki, 50:6 (1991), 122–125
-
Index sets of classes of hyperhypersimple sets
Algebra Logika, 29:2 (1990), 220–240
-
Applications of precomplete numerations to $tt$-degrees and
index sets
Algebra Logika, 28:1 (1989), 75–82
-
Fine hierarchies of arithmetic sets, and definable index sets
Trudy Inst. Mat. Sib. Otd. AN SSSR, 12 (1989), 165–185
-
The arithmetical hierarchy and ideals of enumerated Boolean algebras
Sibirsk. Mat. Zh., 30:6 (1989), 140–149
-
Ershov's hierarchy and $\rm T$-jumps
Algebra Logika, 27:4 (1988), 464–478
-
Index sets of quotient-objects of the Post numeration
Algebra Logika, 27:3 (1988), 343–358
-
Algorithmic complexity of algebraic systems
Mat. Zametki, 44:6 (1988), 823–832
-
Automorphism groups of numbered sets
Mat. Zametki, 41:4 (1987), 592–597
-
The Ershov hierarchy
Sibirsk. Mat. Zh., 26:1 (1985), 134–149
-
On the hierarchy of limit computations
Sibirsk. Mat. Zh., 25:5 (1984), 146–156
-
Index sets in the hyperarithmetical hierarchy
Sibirsk. Mat. Zh., 25:3 (1984), 164–181
-
Hierarchies of hyperarithmetic sets and functions
Algebra Logika, 22:6 (1983), 666–692
-
The structure of degrees of generalized index sets
Algebra Logika, 21:4 (1982), 472–491
-
Index sets in the Kleene–Mostowski hierarchy
Trudy Inst. Mat. Sib. Otd. AN SSSR, 2 (1982), 135–158
-
The structure of degrees of unsolvability of index sets
Algebra Logika, 18:4 (1979), 463–480
-
Several remarks on classes of recursively enumerable sets
Sibirsk. Mat. Zh., 19:1 (1978), 153–160
-
Enumerations of canonically computable families of finite sets
Sibirsk. Mat. Zh., 18:6 (1977), 1373–1380
-
Two theorems on computable numerations
Algebra Logika, 15:4 (1976), 470–484
-
The numerations of families of general recursive functions
Algebra Logika, 15:2 (1976), 205–226
-
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
© , 2024