Suppose I have this boolean expression:
W'XYZ + WX'YZ + WXY'Z + WXYZ' + WXYZ
How would I go about simplifying this without using a K-map? Using K-map, the simplified form is XYZ + WXY + WXZ + WYZ. I read about the redundancy theorem somewhere, would rather not use that as well.
Here is a good law for you to use:
Adjacency
$PQ +PQ'=P$
It's called Adjacency because if you were to put it on a K-map, the two terms in the left hand side would pick out cells that are adjacent in the K-Map and that can be combined into one larger group of cells ... hence the much simpler expression.