The synthesis of correct algorithms in the closure of recognition algorithms with representative samples and systems of supporting sets

The correctness of algebraic closure of various subclasses of recognition algorithms of the “Kora” type as applied to problems with binary training information is proved. An explicity form of a correct algorithm for these problems is explained.