Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Boolean expression reduction

  1. Nov 10, 2009 #1
    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!
     
  2. jcsd
  3. Nov 10, 2009 #2

    tiny-tim

    User Avatar
    Science Advisor
    Homework Helper

    Hi deathprog23! :smile:

    Hint: you need to prove that B'C' lies in B'D+C'D' :wink:
     
  4. Nov 10, 2009 #3
    Nice hint! I got it now, thanks very much :)
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: Boolean expression reduction
  1. Boolean Algebra (Replies: 1)

Loading...