Multilevel descriptions of classes are considered in the framework of the logic-axiomatic approach to pattern recognition. Such descriptions reduce certain patter-recognition problems to a sequence of similar problems of lower dimension. For problems described by propositional (Boolean) formulas, conditions for decreasing the number of steps required to solve such a problem by an algorithm based on a multilevel description are obtained.