Minimal clones generated by majority operations (Q1866826): Difference between revisions

A function \(f\) is called minimal if the clone \([f]\) generated by \(f\) is a minimal one. It was shown by I. G. Rosenberg in 1986 that every minimal clone on a finite set is generated by a nontrivial minimal function of a certain type. The author proves that if \(C\) is a minimal clone on a four-element set \(A\) and contains a majority function, then \(C=[f]\), where \(f\) is either a conservative function or \((A,f)\) is isomorphic to one of three algebras given by a table.