A combinatorial characterization of Boolean algebras

Structure theory of Boolean algebras (06E05) Operations and polynomials in algebraic structures, primal algebras (08A40) Finitary algebras (08A62) Loops, quasigroups (20N05)

Review text

\textit{G. Grätzer} and \textit{A. Kisielewicz} asked in 1992 if every finitely generated variety in which for every \(n\geq 0\) the free algebra on \(n\) free generators has \(2^{2^n}\) elements is term equivalent to the variety of Boolean algebras. Although the problem is still open, the author proves a nice result: Theorem. A groupoid is term equivalent to a Boolean algebra iff the number of \(n\)-ary term operations is equal to \(2^{2^n}\) for \(n=0,1,2,3\). The theorem has two consequences for the so-called \(p_n\)-sequences: Corollary 1. A groupoid is term equivalent to a Boolean algebra iff it represents the sequence \((2,2,10,218)\). Corollary 2. The minimal extension of the sequence \((2,2)\) in the class of all groupoids is the \(p_n\)-sequence of a Boolean algebra.

Recommendations

Cited in

(16)

This page was built for publication: A combinatorial characterization of Boolean algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5932473)