Boolean Algebra Laws

Named after the nineteenth-century mathematician George Boole, it is a form of algebra in which all values are reduced to either TRUE or FALSE.

Method to simplify Boolean algebra expressions, leveraging pattern recognition to minimize calculations. Reduces real-world logic requirements for efficient implementation with minimal logic gates.

A set of rules for manipulating truth values according to truth tables. Very important in computing as truth values in Boolean algebra are True and false, and can thus easily be represented as the binary digits 1 and 0.

Two laws stating the duality of AND and OR operations. In English: 1) ‘Not (A and B)’ equals ‘(Not A) or (Not B)’ and 2) ‘Not (A or B)’ equals ‘(Not A) and (Not B)’. Designed to simplify electronic circuit design.”

A rule or law in Boolean algebra which permits the multiplying or factoring out of an expression.

A rule or law in Boolean algebra which permits the removal of brackets from an expression and regrouping of the variables.

A rule or law in Boolean algebra which stats that the order of application of two separate terms is not important: A AND B = B AND A

A rule or law in Boolean algebra where if you invert a term twice it is equal to its original term: (NOT NOT A) = A

A method of expression Boolean Logic in a diagrammatic form using a set of standard symbols representing the various Logic Gates such as AND NOT OR NAND etc.

A notation used in Boolean algebra for defining the output of a logic gate or logic circuit for all possible combinations of inputs.

Also known as a data or delay flip flop. This is a circuit or logic design which can be viewed as a memory cell. It has two stable states. Using appropriate input signals, you can trigger the flip-flop from one state to the other.

A unit which adds together two input variables. A half adder can only add the inputs together.

A unit which adds together two input variables. A full adder can a bit carried from another addition as well as the two inputs.