Boolean lattices vs boolean rings

175 Views Asked by At

Which kinds of theorems about boolean algebras are easier to prove with boolean rings (than with actual boolean lattices)?

Give me at least one example, as an answer.

1

There are 1 best solutions below

3
On

The size of any finite Boolean algebra is a power of $2$. This follows from the fact that any Boolean ring is an associative algebra over the field with two elements.