Separation of clones by means of hyperidentities
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.
- Separation of clones of cooperations by cohyperidentities
- On the logical equivalence of functional clones
- Hyperidentities of quasilinear clones containing creative functions
- On separation of Boolean clones by means of hyperidentities
- scientific article; zbMATH DE number 32737 (Why is no real title available?)
- Hyperidentities of quasilinear clones on the three-element set.
This page was built for publication: Separation of clones by means of hyperidentities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1920692)
