Total tense algebras and symmetric semiassociative relation algebras (Q1905987)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Total tense algebras and symmetric semiassociative relation algebras
scientific article

    Statements

    Total tense algebras and symmetric semiassociative relation algebras (English)
    0 references
    0 references
    0 references
    0 references
    2 May 1996
    0 references
    A Boolean algebra \((B,+, \cdot, -)\) with two unary operators \(f\) and \(g\) is called a tense algebra if \(f\) and \(g\) are conjugate operations, i.e., for any \(x,y \in B\), \(y \cdot f(x) = 0\) iff \(x \cdot g(y) = 0\). A tense algebra is called total if it satisfies the condition: if \(x \neq 0\) then \(f(x) + g(x) = 1\). In this paper the authors study varieties generated by total tense algebras and show, among other things, that thare are exactly four finitely generated varieties and infinitely many nonfinitely generated varieties of height two. The authors show also that tense algebras are term-equivalent to certain generalized relation algebras and extend the results to varieties of these algebras.
    0 references
    complex algebra
    0 references
    lattice of varieties
    0 references
    tense algebra
    0 references
    conjugate operations
    0 references
    generalized relation algebras
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references