Boolean rig

Boolean rigs

Boolean rigs


As a Boolean ring is a ring in which multiplication is idempotent, so a Boolean rig is a rig in which multiplication is idempotent; that is, a rig in which x 2=xx^2 = x always holds.

While many further properties follow from the idempotence of multiplication in a ring, most of these require subtraction (or at least cancellation of addition), so these will not necessarily hold for a Boolean rig. As such, it might be proper to add some of them as axioms for a Boolean rig.


Even without subtraction, we may define the Boolean join operation xyx+xy+yx \vee y \coloneqq x + x y + y; however, it also seems to have no nice properties without additional axioms. In a commutative Boolean rig, however, we can prove that multiplication distributes over join, meaning that multiplication and join together form another rig structure. But we cannot prove that this rig is also Boolean, or that join is a semilattice operation.


The main examples are probably distributive lattices. In this case, the join operation called \vee above will match the original join/addition operation called ++ above.

Of course, a Boolean ring is a Boolean rig, since any ring is a rig. However, since it's also a distributive lattice, a Boolean ring is actually a Boolean rig in two different ways.


There seem to be none. The ‘Boolean semirings’ in the literature (by which I mean, what Google found for me that wasn't cloaked) are something much more complicated than what we're looking at here.

Last revised on August 15, 2020 at 05:16:56. See the history of this page for a list of all contributions to it.