Affine completeness of Kleene algebras (Q1272129)

From MaRDI portal





scientific article; zbMATH DE number 1226220
Language Label Description Also known as
default for all languages
No label defined
    English
    Affine completeness of Kleene algebras
    scientific article; zbMATH DE number 1226220

      Statements

      Affine completeness of Kleene algebras (English)
      0 references
      23 November 1998
      0 references
      An algebra \(K\) is called (locally) affine complete if every compatible function on \(K\) is a (local) polynomial. A Kleene algebra is a bounded distributive lattice with an additional operation \('\) satisfying the identities \((x\vee y)' = x' \wedge y'\), \((x\wedge x') \vee (y\vee y')=y\vee y'\), \(0'=1\), \(x''=x\) and their duals. For every Kleene algebra let be \(K^{\vee } = \{x\vee x'; x\in K\}\). It was proved by \textit{M. Haviar} [Acta Math. Univ. Comen., New Ser. 62, No. 2, 179-190 (1993; Zbl 0821.06010)] that a finite Kleene algebra is affine complete iff it is a Boolean algebra. The aim of the paper under review is to study the general case. Let \(A\) be a subalgebra of an algebra \(B\). We say that \(A\) is affine complete in \(B\) if every compatible function on \(A\) can be interpolated by a polynomial of \(B\). The main theorems are the following: {Theorem}. Let \(K\) be a Kleene algebra. Then the following conditions are equivalent: (1) \(K\) is locally affine complete (2) \(K^{\vee }\) is a locally affine complete lattice (3) \(K^{\vee }\) does not contain a proper Boolean interval. {Theorem}. Let \(K\) be a Kleene algebra. Then the following conditions are equivalent: (1) \(K\) is affine complete (2) \(K^{\vee }\) is affine complete in \(K\) (3) \(K^{\vee }\) does not contain proper Boolean intervals and for every proper almost principal filter \(F\) in \(K^{\vee }\) there exists \(b\in K\) such that \(F=K^{\vee } \cap \uparrow b\).
      0 references
      affine complete algebra
      0 references
      Kleene algebra
      0 references
      0 references
      0 references
      0 references

      Identifiers