In the boolean logic
$ab + ac + \bar a \bar b c$
is equivalent to the simpler
$ab + \bar b c$
This can be confirmed by looking at the truth table (below).
The $ab$ and $\bar b c$ minterms cover the $ac$ minterm.
My question is, in general/practice, how can one make this simplification algebraically, that is without having to resort to looking at truth table, Karnaugh maps, which set of minterms possibly cover another minterm, etc.
I tried to manipulate $ab + ac + \bar b c$ algebraically, but only got as far as $a(b + c) + \bar b c\ $ or $\ ab + (a + \bar b)c$ and couldn't really simplify further from there.
Notation:
- $ab$ means $a \wedge b$
- $a + b$ means $a \vee b$
- $\bar b$ means $\neg b$
Truth table:
| a | b | c | ab | ac | ¬b c | ab + ac + ¬b c | ab + ¬b c | |||
|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 0 | 0 | ||||||||
| 0 | 0 | 1 | 1 | 1 | 1 | |||||
| 0 | 1 | 0 | ||||||||
| 0 | 1 | 1 | ||||||||
| 1 | 0 | 0 | ||||||||
| 1 | 0 | 1 | 1 | 1 | 1 | 1 | ||||
| 1 | 1 | 0 | 1 | 1 | 1 | |||||
| 1 | 1 | 1 | 1 | 1 | 1 | 1 |