Boolean algebra - distribution

AI Thread Summary
The discussion revolves around proving the equivalence of two Boolean expressions: a'c' ∨ c'd ∨ ab'd and (a ∨ c')(b' ∨ c')(a' ∨ d). The user attempts to simplify the expression but encounters a term, ab'a', which they believe can be eliminated since it always evaluates to zero due to the property x ∧ x' = 0 in Boolean algebra. The conversation highlights the importance of defining Boolean algebra and its axioms, particularly regarding the behavior of variables. Ultimately, the user concludes that they can remove the ab'a' term, successfully completing their proof.
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
Can you show ##ab'a' = 0##?
 
  • Like
Likes Rectifier
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.
 
What are your axioms for Boolean algebra?
 
  • Like
Likes Rectifier
Are you thinking about ##x \cdot x' = 0## ?
 
I don't know, how did you define a boolean algebra?
 
In boolean algebra variables can only have two values.
 
Either you tell me how you defined a boolean algebra, or I'm out of this thread.
 
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.
 
  • #10
How are you supposed to prove anything about a Boolean algebra if you're not given its definition or anything??
 
  • #12
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 Rectifier
  • #13
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.
 
Back
Top