Basic Laws of Boolean Algebra
Order by
11 terms
Terms | Definitions |
|---|---|
Commutative | A || B = B || AA && B = B && A |
Distributive | A || (B && C) = (A || B) && (A || C)A && (B || C) = (A && B) || (A && C) |
Identity | A || 0 = AA && 1 = A |
Inverse | A || !A = 1A && !A = 0 |
Idempotent | A || A = AA && A = A |
Boundedness | A || 1 = 1A && 0 = 0 |
Absorption | A || (A && B) = AA && (A || B) = A |
Associative | A || (B || C) = (A || B) || CA && (B && C) = (A && B) && C |
Involution | ! (!A) = A |
Derived | A || (!A && B) = A || BA && (!A || B) = A && B |
DeMorgan's | ! (A || B || C....) = !A && !B && !C &&....) ! (A && B && C &&....) = !A || !B || !C ||.... ! (A || B) = !A && !B The NOT of the Ors equals the AND of the NOTs. "Since it is false that either thing is true, then both things must be false." ! (A && B) = !A || !B The NOT of the ANDs equals the OR of the NOTs. "Since it is false that two things together are true, at least one of them must be false." |
First Time Here?
Welcome to Quizlet, a fun, free place to study. Try these flashcards, find others to study, or make your own.