|
|
Publications in Math-Net.Ru
-
Major Sets, Classes of Simple Sets, and $Q$-Complete Sets
Mat. Zametki, 71:1 (2002), 100–108
-
Complexity properties of recursively enumerable sets and $bsQ$-completeness
Mat. Zametki, 68:4 (2000), 554–559
-
Some reducibilities and splittings of recursively enumerable sets
Mat. Zametki, 66:2 (1999), 220–230
-
Complexity properties of recursively enumerable sets and $sQ$-completeness
Mat. Zametki, 62:3 (1997), 425–429
-
On a strengthening of $Q$-reducibility
Algebra Logika, 34:1 (1995), 79–87
-
Relations between some reducibilities
Algebra Logika, 33:6 (1994), 681–688
-
On $sQ$-completeness of recursively enumerable sets
Mat. Zametki, 52:3 (1992), 102–107
-
On the upper semilattice of recursively enumerable ${\rm
sQ}$-degrees
Algebra Logika, 30:4 (1991), 405–413
-
Classes of recursively enumerable sets and $Q$-reducibility
Mat. Zametki, 45:2 (1989), 79–82
-
The upper semilattice of recursively enumerable ${\rm
Q}$-degrees
Algebra Logika, 23:2 (1984), 175–184
-
Some generalizations of the concept of productivity of a set
Izv. Vyssh. Uchebn. Zaved. Mat., 1978, no. 9, 84–88
© , 2026