The 1-st form of the paper "The tree equivalence of linear recursive schemata is polinomial-time decidable".

"The logic-termal equivalence is polynomial-time decidable".

The authors inform that the papers were airmailed on the 17th of February. /Handwritten text./

from Novosibirsk colleagues, "coffee-clubbers". (With a hand-written Ershov's explanatory remark addressed to his mother. The list of authors does not contain persons not identified by their signatures.)

suggestion of a place where to stay overnight on Sunday

Thanks for the pre-print and some questions; proposal to write a paper for Theoretical Computer Science journal; proposal to arrange for his graduate students' presentation on standard schemata transformation at the seminar

on international collaboration on the project "Development of multiuser systems" between Computing Center of SBAS USSR and Center of Computing Machinery of GDR AS

Information about A.Eremeev - a student engaged on degree thesis

Preparing to the lectures on the BETA system.

to put on the staff list V.K. Sabelfeld as junior teaching staff member