This article is about Boolean semirings as defined by Fernando Guzmán. For other notions of “Boolean rig” or “Boolean semiring”, see Boolean semiring.
A Boolean semiring or Boolean rig is a multiplicatively idempotent semiring such that .
Every Boolean semiring is commutative.
By definition of a Boolean semiring, we have , and by commutativity and associativity of , we have . In addition, for all elements and , we have
and
Thus, we have , showing that Boolean semirings are commutative.
Even without subtraction, we may define the join operation . We can prove that multiplication distributes over join, meaning that multiplication and join together form another rig structure. But we cannot prove that this semiring is also Boolean, or that join is a semilattice operation; in fact, if the Boolean semiring is a distributive lattice, then the “join” operation defined above is the same as the addition operation.
The main examples are probably distributive lattices. In this case, the join operation called above will match the original join/addition operation called above.
Of course, a Boolean ring is a Boolean semiring, since any ring is a rig. However, since it's also a distributive lattice, a Boolean ring is actually a Boolean semiring in two different ways.
Fernando Guzmán, The variety of Boolean semirings, Journal of Pure and Applied Algebra, Volume 78, Issue 3, 20 April 1992, Pages 253-270 [doi:10.1016/0022-4049(92)90108-R]
Morgan Rogers, From free idempotent monoids to free multiplicatively idempotent rigs [arXiv:2408.17440]
J-B Vienney, Are Boolean rigs commutative?, Category theory Zulip, (web)
Last revised on June 13, 2025 at 05:23:32. See the history of this page for a list of all contributions to it.