Separation of clones by means of hyperidentities (Q1920692)

It was shown by \textit{K. Denecke}, \textit{D. Lau}, \textit{R. Pöschel} and \textit{D. Schweigert} [Contrib. Gen. Algebra 7, 97-118 (1991; Zbl 0759.08005)] that, given two nonisomorphic clones \(C\) and \(C'\) of Boolean functions with \(C'\not\cong C\), \(C'\nsubseteq C\), and \(C\nsubseteq C'\), the clone \(C\) can be separated from \(C'\) by hyperidentities. This fact is not true for arbitrary clones of functions defined on a finite set with more than two elements. In this paper we give a more general criterion for separation of clones by means of hyperidentities and we use this result to obtain a new proof of the theorem stating that Boolean clones can be separated by hyperidentities.