Projective bichains
A bisemilatice is algebra with two binary operations, \(+\) and \(\cdot\), that are commutative, associative and idempotent. Each bisemilattice determines and is determined by two semilattices. If each of these semilattices is a chain then a bisemilattice is called a bichain. If a bisemilattice satisfies the equation \(x\cdot(x+y)=x+(x\cdot y)\) it is called a Birkhoff system. The authors prove that a finite bichain is weakly projective in the variety of Birkhoff systems if and only if it does not contain a three-element bichain with elements \(a,b,c\) such that \(b\cdot c=b\), \(b+c=c\) and \(a\) is absorbing. They also present a recursive method to construct the \(n\)-element weakly projective bichains having some special properties.
- A representation theorem for distributive quasi-lattices
- Bisemilattices of subsemilattices
- scientific article; zbMATH DE number 3829984 (Why is no real title available?)
- scientific article; zbMATH DE number 3652395 (Why is no real title available?)
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- scientific article; zbMATH DE number 5268066 (Why is no real title available?)
- On bisemilattices with one distributive law
- On distributive quad-lattices
- Regular Identities in Lattices
- The concept of a linguistic variable and its application to approximate reasoning. I
- The variety generated by the truth value algebra of type-2 fuzzy sets
This page was built for publication: Projective bichains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q451076)