[eigrieves]

This a problem from my intro to computer science course. I am new with this and I am supposed to simplify this expression:
(A ∨ ¬B ) ∧ (B ∨ ¬C) ∧ (C ∨ ¬A)

I have already drawn out the circuits of the expression, and that part is correct. However, I tried to simplify it to (¬A v ¬B v ¬C) ∧ (A v B v C) but I don't think that is correct. Both terms are supposed to contain all three letters yet I don't know how to exactly to do this and make sure it is right.

Any help or tips would be greatly appreciated!

This post has been edited by eigrieves: 03 October 2011 - 02:18 PM

[anonymous26]

As an initial step, have you tried representing the above logic expression in a truth table?

[elgose]

It might be a little painstaking, but I agree with - when in doubt, work it out. And especially with this type of logic, it might not come to you right away, which is all the more reason to work out a truth table.

If you're adamant about not doing a truth table, you can show the steps you went through to get your answer here and we can try to point out errors. I'm not going to actually work it out, but I'm pretty sure just by looking at it that your answer is wrong (although very close, in a way).

This post has been edited by elgose: 03 October 2011 - 10:01 PM