| RUS ENG |
| Full version |
|
|
|
| JOURNALS // Zapiski Nauchnykh Seminarov POMI // Archive |
|
1977, Volume 68
|
| | | General information | | | Contents | | |
|
A maximal sequence of classes transformable by primitive recursion in a given class A. P. Beltiukov |
3 | |
|
|
A lower bound for the computational complexity of a set of disjunctives in a monotone basis D. Yu. Grigor'ev |
19 | |
|
|
Problem of path connections in graphs D. Yu. Grigor'ev |
26 | |
|
|
A majorizing semantics for hyperarithmetic sentences L. N. Gordeev |
30 | |
|
|
An approach to the constructivization of Cantor's set theory L. N. Gordeev |
38 | |
|
|
Herbrand strategies and the “greater deducibility” relation S. Yu. Maslov, S. A. Norgela |
51 | |
|
|
Primes are nonnegative values of a polynomial in 10 variables Yu. V. Matiyasevich |
62 | |
|
|
Closed categories and the theory of proofs G. E. Mints |
83 | |
|
|
How to prove that two classes of simple primitive recursive functions are distinct S. V. Pakhomov |
115 | |
|
|
A simplified proof of the real-time recognizability of palindromes on turing machines A. O. Slisenko |
123 | |
|
|
Equational calculi for Grzegorczyk's classes M. Kh. Fakhmi |
140 | |