|
|
Publications in Math-Net.Ru
-
An upper estimate of the finite-state complexity for a class of generating schemes containing complements and intersections
Zap. Nauchn. Sem. LOMI, 40 (1974), 14–23
-
A pseudo-rundamental sequence not equivalent to any monotone sequence
Zap. Nauchn. Sem. LOMI, 20 (1971), 263–271
-
The lower estimate of number of steps for reversing normal algorithms and other similar algorithms
Zap. Nauchn. Sem. LOMI, 20 (1971), 243–262
-
A reduced form of normal algorithms and a linear speed-up theorem
Zap. Nauchn. Sem. LOMI, 20 (1971), 234–242
-
Yet another constructive version of Cauchy theorem
Zap. Nauchn. Sem. LOMI, 20 (1971), 36–39
-
The upper bounds of enumerable sets of constructive real numbers
Trudy Mat. Inst. Steklov., 113 (1970), 102–172
-
On the disjunctive rank of formulas of constructive arithmetic
Zap. Nauchn. Sem. LOMI, 8 (1968), 260–271
-
On the complexity of proof in prepositional calculus
Zap. Nauchn. Sem. LOMI, 8 (1968), 234–259
-
Some properties of $F$-numbers
Zap. Nauchn. Sem. LOMI, 8 (1968), 107–120
-
Three theorems on constructive functions
Trudy Mat. Inst. Steklov., 72 (1964), 537–543
-
Concerning a generalized principle of constructive selection
Trudy Mat. Inst. Steklov., 72 (1964), 344–347
-
A method of presenting the theory of algorithms and enumerable sets
Trudy Mat. Inst. Steklov., 72 (1964), 69–98
-
Singular coverings and properties of constructive functions connected with them
Trudy Mat. Inst. Steklov., 67 (1962), 458–502
-
Mean-value theorems in constructive analysis
Trudy Mat. Inst. Steklov., 67 (1962), 362–384
-
Algorithmic operators in constructive metric spaces
Trudy Mat. Inst. Steklov., 67 (1962), 295–361
-
An associative calculus with an insoluble problem of equivalence
Trudy Mat. Inst. Steklov., 52 (1958), 172–189
-
Correction
Uspekhi Mat. Nauk, 11:2(68) (1956), 251–2511
© , 2024