A coherence theorem for canonical morphisms in cartesian closed categories A. A. BabaevS. V. Solov'ev OriginalPaper Pages: 2263 - 2279
A machine description and the hierarchy of initial Grzegorczyk classes A. P. Bel'tyukov OriginalPaper Pages: 2280 - 2289
Time complexity of multidimensional Turing machines D. Yu. Grigor'ev OriginalPaper Pages: 2290 - 2295
Two reductions of graph isomorphism to problems on polynomials D. Yu. Grigor'ev OriginalPaper Pages: 2296 - 2298
Theorems on the time hierarchy for random access machines A. G. Ivanov OriginalPaper Pages: 2299 - 2304
Decision-procedures for invariant properties of short algorithms N. K. Kosovskii OriginalPaper Pages: 2304 - 2307
Calculi with monotone deductions and their economic interpretation S. Yu. Maslov OriginalPaper Pages: 2314 - 2321
Primitive recursive estimate of strong normalization for predicate calculus G. E. Mints OriginalPaper Pages: 2334 - 2336
Lower bounds for increasing complexity of derivations after cut elimination V. P. Orevkov OriginalPaper Pages: 2337 - 2350
Three ways of recognizing inessential formulas in sequents V. P. Orevkov OriginalPaper Pages: 2351 - 2357
Machine-independent description of certain machine complexity classes S. V. Pakhomov OriginalPaper Pages: 2358 - 2363
Positive rudimentarity of the graphs of Ackermann and Grzegorczyk A. V. Proskurin OriginalPaper Pages: 2363 - 2366
Growth of length of sequential derivation transformed into natural one S. V. Solov'ev OriginalPaper Pages: 2367 - 2369
Preservation of equivalence of derivations under reduction of depth of formulas S. V. Solov' ev OriginalPaper Pages: 2370 - 2376
Representation of proofs by colored graphs and the hadwiger conjecture P. Yu. Suvorov OriginalPaper Pages: 2376 - 2381
