An iterative description of the class ξ′ of Grzegorczyk's hierarchy A. P. Bel'tyukov OriginalPaper Pages: 1429 - 1436
Decidability of the universal theory of natural numbers with addition and divisibility A. P. Bel'tyukov OriginalPaper Pages: 1436 - 1444
Kolmogoroff algorithms are stronger than turing machines D. Yu. Grigor'ev OriginalPaper Pages: 1445 - 1450
Application of separability and independence notions for proving lower bounds of circuit complexity D. Yu. Grigor'ev OriginalPaper Pages: 1450 - 1457
On an approximative version of the notion of constructive analytic function E. Ya. Dantsin OriginalPaper Pages: 1457 - 1463
A new proof of the theorem on exponential diophantine representation of enumerable sets Yu. V. Matiyasevich OriginalPaper Pages: 1475 - 1486
On the approximation of reduction classes of RPC by decidable classes S. A. Norgela OriginalPaper Pages: 1493 - 1496
Approximability of operators in constructive metric spaces S. V. Pakhomov OriginalPaper Pages: 1539 - 1546
Hierarchies of operators in constructive metric spaces S. V. Pakhomov OriginalPaper Pages: 1547 - 1554
Continuity of operators in separable constructive metric spaces S. V. Pakhomov OriginalPaper Pages: 1554 - 1556
On the recognition of the tautological nature of propositional formulas P. Yu. Suvorov OriginalPaper Pages: 1556 - 1562
Example of a constructive separable space with an inseparable completion V. P. Chernov OriginalPaper Pages: 1563 - 1564
