|
|
Publications in Math-Net.Ru
-
Computably enumerable sets and related issues
Algebra Logika, 50:6 (2011), 733–758
-
The Creation on Database on General Theory of Computability
Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 11:1 (2011), 58–63
-
On a property of creative sets
Algebra Logika, 35:3 (1996), 294–307
-
Computability of partial functions and enumerability of sets in Peano arithmetic
Sibirsk. Mat. Zh., 20:6 (1979), 1269–1274
-
Certain properties of retracts of Post numerations
Algebra Logika, 13:6 (1974), 662–675
-
The upper semilattice $L(\gamma )$
Algebra Logika, 12:2 (1973), 167–189
-
Complete numerations with an infinite number of special elements
Algebra Logika, 9:5 (1970), 503–509
-
Computable enumerations. II
Algebra Logika, 8:1 (1969), 65–71
-
Answer to a question of P. R. Young
Algebra Logika, 7:2 (1968), 48–54
-
Utilization of arithmetic progressions of $k$ th order for construction of bases of an algebra of primitively-recursive functions
Dokl. Akad. Nauk SSSR, 172:2 (1967), 279–282
-
Bases of algebras of recursive functions
Sibirsk. Mat. Zh., 7:5 (1966), 1059–1067
-
Elementary theories
Uspekhi Mat. Nauk, 20:4(124) (1965), 37–108
-
The effective non-separability of the set of identically true
formulae and the set of finitely refutable formulae for certain
elementary theories
Algebra i Logika. Sem., 2:1 (1963), 5–18
-
Undecidability of elementary theories of certain rings
Algebra i Logika. Sem., 1:3 (1962), 39–45
-
Yurii Leonidovich Ershov (on his seventieth birthday)
Uspekhi Mat. Nauk, 66:1(397) (2011), 201–204
-
Yurii Leonidovich Ershov (on his seventieth birthday)
Vladikavkaz. Mat. Zh., 12:2 (2010), 75–78
-
Yuri Leonidovich Ershov (on his 60th birthday)
Uspekhi Mat. Nauk, 55:6(336) (2000), 173–182
-
Yuriĭ Leonidovich Ershov (on the occasion of his sixtieth birthday)
Vladikavkaz. Mat. Zh., 2:2 (2000), 3–9
© , 2024