Boolean algebra - distribution

Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
12 replies · 2K views
Rectifier
Gold Member
Messages
313
Reaction score
4
The problem
I am trying to show that ##a'c' \vee c'd \vee ab'd ## is equivalent to ## (a \vee c')(b' \vee c')(a' \vee d) ##

The attempt
## (a \vee c')(b' \vee c')(a' \vee d) \\ (c' \vee (ab'))(a' \vee d)##
The following step is the step I am unsure about. I am distributing the left parenthesis over the right.
## (c' \vee (ab'))(a' \vee d) \\ c'a \vee c'd \vee ab'a' \vee ab'd##

I am almost there but the term ##ab'a'## differs. I suspect that you can remove that term since it does not afect the output because it is always false. What do you say about that?
 
Physics news on Phys.org
Unfortunately, I cant, but I know it is true for all values of 1 and 0 for a and b. Since ##a## is the opposite of ##a'## this means that ##a \wedge a'## will always be 0 and it does not matter which value b has . I can write a truth table but I am on my phone so its a bit hard.
 
Are you thinking about ##x \cdot x' = 0## ?
 
In boolean algebra variables can only have two values.
 
I am sorry that my answer didn't fit you but I can't come up with anything better. In any case, I am thankful for the help I have received so far.
 
Those are axioms for a structure that is called a bounded lattice. It's not the axioms for a Boolean algebra. Usually, there are 10 axioms for a Boolean algebra. They can be found here: https://en.wikipedia.org/wiki/Boolean_algebra_(structure)#Definition

Note that in this case, it is an axiom that ##x\wedge x' = 0##. This is why I asked for your definition, since you might adopt different (but equivalent) ways of doing things.
 
  • Like
Likes   Reactions: Rectifier
I didnt think they were different :). Thank you for you help kind stranger!

So now I can basically remove that ab'a'. Halleluja, I am done with that problen.