Editing Combinational logic (section)

==Logic formula minimization==
Minimization (simplification) of combinational logic formulas is done using the following rules based on the [[Boolean algebra#Laws|laws of Boolean algebra]]:

: <math>\begin{align}
(A \vee B) \wedge (A \vee C) &= A \vee (B \wedge C) \\
(A \wedge B) \vee (A \wedge C) &= A \wedge (B \vee C)
\end{align}</math>

: <math>\begin{align}
A \vee (A \wedge B) &= A \\
A \wedge (A \vee B) &= A

\end{align}</math>

: <math>\begin{align} 

A \vee (\lnot A \wedge B) &= A \vee B \\
A \wedge(\lnot A \vee B) &= A \wedge B

\end{align}</math>

: <math>\begin{align} 

(A \vee B)\wedge(\lnot A \vee B)&=B \\
(A \wedge B) \vee (\lnot A \wedge B)&=B

\end{align}</math>

: <math>\begin{align}

(A \wedge B) \vee (\lnot A \wedge C) \vee (B \wedge C) &= (A \wedge B) \vee (\lnot A \wedge C) \\
(A \vee B) \wedge (\lnot A \vee C) \wedge (B \vee C) &= (A \vee B) \wedge (\lnot A \vee C)

\end{align}</math>

With the use of minimization (sometimes called [[logic optimization]]), a simplified logical function or circuit may be arrived upon, and the logic [[combinational circuit]] becomes smaller, and easier to analyse, use, or build.