|
|
|
Publications in Math-Net.Ru |
Citations |
|
1978 |
| 1. |
S. D. Denisov, “Structure of the upper semilattice of recursively enumerable
$m$-degrees and related questions. I”, Algebra Logika, 17:6 (1978), 643–683   |
8
|
|
1975 |
| 2. |
S. D. Denisov, “A two-element separable enumerated set $\gamma $ with an
unsolvable problem $P(\gamma ,\gamma )$”, Algebra Logika, 14:5 (1975), 523–532 |
|
1974 |
| 3. |
S. D. Denisov, “Three theorems on elementary theories and $tt$-reducibility”, Algebra Logika, 13:1 (1974), 5–8 |
3
|
|
1972 |
| 4. |
S. D. Denisov, “Models of a noncontradictory formula and the hierarchy of Eršov”, Algebra Logika, 11:6 (1972), 648–655 |
|
1970 |
| 5. |
S. D. Denisov, I. A. Lavrov, “Complete numerations with an infinite number of special elements”, Algebra Logika, 9:5 (1970), 503–509 |
1
|
| 6. |
S. D. Denisov, “The $m$-degrees of recursively enumerable sets”, Algebra Logika, 9:4 (1970), 422–427 |
4
|
|
Contact us: