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