Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Expressions Simplifications Boolean Algebra
I started simplifying function and got to the detailed picture and wanted to know if I can reduce the above expressions, for example :

Y'.X'.Y = 0 ?
Y'.X'.Z.X = 0 ?


share|cite|improve this question
up vote 1 down vote accepted

Yes. Both disjunction and conjunction are commutative in a boolean algebra. Hence $$Y^\prime X^\prime Y = X^\prime YY^\prime=0$$ for instance.

share|cite|improve this answer
and YXY will be equal to XY ? because of YY=Y, and Y'Y'=Y' ? – Ofir Attia Apr 20 '13 at 13:03
Yes, exactly. ${}{}{}{}$ – Abel Apr 20 '13 at 13:04
Thank you, really helped me – Ofir Attia Apr 20 '13 at 13:05

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.