|
|
|
Publications in Math-Net.Ru |
Citations |
|
1994 |
| 1. |
Yu. G. Ventsov, “Constructive models of regularly infinite algorithmic
dimension”, Algebra Logika, 33:2 (1994), 135–146   |
1
|
| 2. |
Yu. G. Ventsov, “Computable classes of constructivizations of models of
infinite algorithmic dimension”, Algebra Logika, 33:1 (1994), 37–75 |
2
|
| 3. |
Yu. G. Ventsov, “Constructive models of infinite algorithmic complexity”, Dokl. Akad. Nauk, 335:2 (1994), 135–137  ; Dokl. Math., 49:2 (1994), 251–254 |
|
1993 |
| 4. |
Yu. G. Ventsov, “Effective selection operations on constructive and positive
models”, Algebra Logika, 32:1 (1993), 45–53 |
1
|
| 5. |
Yu. G. Ventsov, “The problem of effective choice of constructivizations”, Trudy Inst. Mat. SO RAN, 25 (1993), 35–40 |
|
1992 |
| 6. |
Yu. G. Ventsov, “The effective choice problem for relations and reducibilities
in classes of constructive and positive models”, Algebra Logika, 31:2 (1992), 101–118 |
8
|
| 7. |
Yu. G. Ventsov, “A problem on the effective choice of constructivizations, and
recursive consistency of problems on constructive models”, Algebra Logika, 31:1 (1992), 3–20 |
3
|
|
1989 |
| 8. |
Yu. G. Ventsov, “Algorithmic dimension of models”, Dokl. Akad. Nauk SSSR, 305:1 (1989), 21–24 ; Dokl. Math., 39:2 (1989), 237–239 |
|
1987 |
| 9. |
Yu. G. Ventsov, “Nonuniform autostability of models”, Algebra Logika, 26:6 (1987), 684–714 |
|
1986 |
| 10. |
Yu. G. Ventsov, “Algorithmic properties of branching models”, Algebra Logika, 25:4 (1986), 369–383 |
1
|
|
| Organisations |
|
| |
|
|
Contact us: