Simplifiying and comparing boolean logical expressions

Discussion in 'Homework Help' started by JustForFun2000, Sep 8, 2015.

  1. JustForFun2000

    Thread Starter New Member

    Sep 8, 2015
    2
    0
    Hey guys,
    First off, sorry for the overly easy question.
    I need to prove this boolean expression using the Boolean logic rules.
    (Commutative, Associative, Distributive, Identity, Redundance, De Morgan...)

    (a or b) and (c or (not b)) = (a and (not b)) or (b and c)
    (a + b)(c + ¬b) = a(¬b) + bc

    I really can't figure a way around it. It seams pretty simple so i figured i'm probably missing something quite obvious...
    I keep ending up with:
    ca + bc + a(¬b) = a(¬b) + bc
    but i can't figure out how to get rid of ca.

    The other partial solution i had come across was:
    (a + b)(c + (¬b)) = ¬b(a + b) + b(c + ¬b)

    I spent quite a lot of time on it and eventually gave up.
    Please tell me what i'm doing wrong.
    Thanks alot!
     
  2. WBahn

    Moderator

    Mar 31, 2012
    17,755
    4,799
  3. JustForFun2000

    Thread Starter New Member

    Sep 8, 2015
    2
    0
    Thanks for that WBahn, I knew i was missing something. I hadn't even heard of a consensus term before reading your post. This helped me alot as i have a class test coming up. Thanks alot!
     
  4. WBahn

    Moderator

    Mar 31, 2012
    17,755
    4,799
    Good. I'm glad you found that useful.
     
Loading...