Boolean Algebra
Sets of rules to simplify the given logic Complement \(A\) complement \(= \overline{A}\) or \(A’\) \((A’)’ = A\) AND \(\begin{aligned} A.A&=A \\ A.0&=0 \\ A.1&=A \\ A.A’&=0 \end{aligned}\) OR \(\begin{aligned} A+A&=A \\ A+0&=A \\ A+1&=1 \\ A+A’&=1 \end{aligned}\) Distributive Law \(\begin{aligned} A.(B+C) &= A.B+A.C \\ A+(B.C) &= (A+B).(A+C) \end{aligned}\) from there, we can get \(\begin{aligned} … Read more