1. A maximal sequence of classes transformable by primitive recursion in a given class

   • A. P. Bel'tyukov

   OriginalPaper Pages: 1 - 10

2. A lower bound for the computational complexity of a set of disjunctives in a monotone basis

   • D. Yu. Grigor'ev

   OriginalPaper Pages: 11 - 14

3. Problem of path connections in graphs

   • D. Yu. Grigor'ev

   OriginalPaper Pages: 14 - 16

4. A majorizing semantics for hyperarithmetic sentences

   • L. N. Gordeev

   OriginalPaper Pages: 16 - 21

5. An approach to the constructivization of Cantor's set theory

   • L. N. Gordeev

   OriginalPaper Pages: 22 - 28

6. Herbrand strategies and the “greater deducibility” relation

   • S. Yu. Maslov
   • S. A. Norgela

   OriginalPaper Pages: 28 - 33

7. Primes are nonnegative values of a polynomial in 10 variables

   • Yu. V. Matijasevič

   OriginalPaper Pages: 33 - 44

8. Closed categories and the theory of proofs

   • G. E. Mints

   OriginalPaper Pages: 45 - 62

9. How to prove that two classes of simple primitive recursive functions are distinct

   • S. V. Pakhomov

   OriginalPaper Pages: 63 - 67

10. A simplified proof of the real-time recognizability of palindromes on turing machines

    • A. O. Slisenko

    OriginalPaper Pages: 68 - 77

11. Equational calculi for Grzegorczyk's classes ɛⁿ

    • M. H. Fahmy

    OriginalPaper Pages: 77 - 78