Boolean Algebra

This is a quick post to sum up a few points about Boolean Algebra - a way to represent logic gates algebraically.

-AND is represented as a full stop/dot
-OR is represented as a + symbol
-NOT is represented as a line above the input or the whole equation

Using DeMorgan's laws we can convert equations, and through using these conversions we make everything the opposite and as such, A+B would become NOT over the equation, (NOT A . NOT B).  These can be a useful way to convert these expressions, as they can simplify them.  Lastly is the order of operations, as unless the OR symbol is in a bracket, then the AND is done first.  As such A+B.C = A+(B.C) and not (A+B).C.