Want to take part in these discussions? Sign in if you have an account, or apply for one below
Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.
Added as examples: 0, ℤ/2ℤ and 𝔹={0,1} with 1+1=0. Proved that they are exactly the boolean rigs of cardinal less or equal than 2.
I don’t know if boolean rigs in the sense of this entry are always commutative. In The variety of Boolean semirings, they show that they are commutative assuming that 1+x+x=1. If some noncommutative boolean rig exists, it must be of cardinal ≥3, not be a ring (because boolean rings are commutative) and not verify this equation.
1 to 2 of 2