In this paper the logic — termal (LT) equivalence of some class of program schemata is introduced and the solvability of recognizing the problem of this equivalence is proved. To the LT -equivalence belongs, for example, the operator and recognizer decomposition, the translation and permutation of operators, the memory redistribution, "untwisting of cycles", economy due to coinciding parts of computations.