Separation of clones by means of hyperidentities (Q1920692): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Klaus Denecke / rank
Normal rank
 
Property / author
 
Property / author: Klaus Denecke / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3979090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperidentities and hypervarieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpretations of module varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On congruences in closed Post classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3988517 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:09, 24 May 2024

scientific article
Language Label Description Also known as
English
Separation of clones by means of hyperidentities
scientific article

    Statements

    Separation of clones by means of hyperidentities (English)
    0 references
    0 references
    0 references
    5 January 1997
    0 references
    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.
    0 references
    clones of Boolean functions
    0 references
    hyperidentities
    0 references
    separation of clones
    0 references
    Boolean clones
    0 references

    Identifiers