Beta Phase: Square45 is currently in beta testing. Expect some features or content to be incomplete or missing.
45

Algebraic Simplification Laws

The set of rules (e.g., Idempotence, Complementarity) used to reduce complex Boolean expressions to their simplest equivalent form, minimizing gate count.
📜

The statement of the theorem

Let A,B,CA, B, C be Boolean variables. The fundamental laws governing simplification include:\n1. Idempotence: AA=AA \land A = A and AA=AA \lor A = A.\n2. Complementarity: A¬A=0A \land \neg A = 0 and A¬A=1A \lor \neg A = 1.\n3. Commutativity: AB=BAA \land B = B \land A and AB=BAA \lor B = B \lor A.\n4. Associativity: (AB)C=A(BC)(A \land B) \land C = A \land (B \land C) and (AB)C=A(BC)(A \lor B) \lor C = A \lor (B \lor C).\n5. Absorption: A(AB)=AA \land (A \lor B) = A and A(AB)=AA \lor (A \land B) = A.\n6. Distributivity: A(BC)=(AB)(AC)A \land (B \lor C) = (A \land B) \lor (A \land C) and A(BlandC)=(AB)(AC)A \lor (B land C) = (A \lor B) \land (A \lor C).\nThese laws ensure that any complex expression can be reduced to its minimal equivalent form.