Bounded lattice structured discriminator varieties (Q616628)

From MaRDI portal





scientific article; zbMATH DE number 5835010
Language Label Description Also known as
default for all languages
No label defined
    English
    Bounded lattice structured discriminator varieties
    scientific article; zbMATH DE number 5835010

      Statements

      Bounded lattice structured discriminator varieties (English)
      0 references
      0 references
      12 January 2011
      0 references
      The paper deals with bounded lattice-structured discriminator varieties, i.e., discriminator varieties \(\mathcal V\) interpreting the variety \(\mathcal{L}_{01}\) of bounded lattices. The main results are as follows: {\parindent4mm \begin{itemize}\item[{\(\bullet\)}] Discriminator varieties \(\mathcal V\) are characterized by equational conditions on a binary term. \item[{\(\bullet\)}] A discriminator variety interpreting \(\mathcal{L}_{01}\) which is interpretable in every \(\mathcal V\) is described. \item[{\(\bullet\)}] Four special unary terms for a variety \(\mathcal V\) are derived from a special binary term: a term defining an existencial quantifier, a term defining a universal quantifier, a term defining a weak pseudocomplementation, and a term defining a dual weak pseudocomplementation. All these terms determine in any algebra the same subreduct which is a Boolean algebra. \item[{\(\bullet\)}] The Boolean subreduct \(B(\mathbb A)\) of an algebra \(\mathbb{A}\in \mathcal V\) is isomorphic to the lattice of principal congruences on \(\mathbb A\), and it determines all congruences of \(\mathbb A\). \item[{\(\bullet\)}] A term operation of weak implication for any variety \(\mathcal V\) is considered and the deductive systems relative to this operation are characterized. \end{itemize}}
      0 references
      discriminator variety
      0 references
      equivalence of varieties
      0 references
      congruence lattice
      0 references
      pseudocomplementation
      0 references
      Boolean subreduct
      0 references
      weak implication
      0 references
      deductive systems
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references