A sufficient condition for closed classes of $k$-valued logic to have only trivial congruences

In this paper the author obtains a classification of $M$-classes of closed classes of $k$-valued logic that are minimal (with respect to inclusion) relative to the property “all superclasses have only trivial congruences”, and an algorithm for constructing $M$-classes is proposed. On the basis of a description of $M$-classes, a sufficient condition is obtained for triviality of congruences of closed classes of $k$-valued logic.
Bibliography: 11 titles.