Reducing Boolean Expressions: Axioms and Simplification Techniques

[deathprog23]

I have been stumped by a simplification problem - well, I can solve it, but I'm not sure how to do it axiomatically!

The expression is A(B+C)+B'D+C'D'

I can see that the (B+C) is redundant in the first term - if A is true, the whole is true regardless of (B+C)'s value. So it reduces to A+B'D+C'D'

What axioms are used in the proof of this? Thanks!

 

[tiny-tim]

Hi deathprog23!

Hint: you need to prove that B'C' lies in B'D+C'D'

 

[deathprog23]

Hi deathprog23!

Hint: you need to prove that B'C' lies in B'D+C'D'

Nice hint! I got it now, thanks very much :)