How do I express a boolean expression comprised of AND, OR and NOT using only AND and NOT?

Question

Say I have the following boolean expression:

(A^B^C) v (~A^~C)

How could I express that using only AND (^) and NOT (~)? I don't want the answer, just how I would go about doing it.

Google deMorgan's Law (and, possibly, "functional completeness")? And what does this have to do with assembly? — Wooble, Jan 24 '13 at 16:05
With DeMorgan's Law, I could apply ~~ to both, right? Is that what I should be doing? I tried that and it came out awfully long. — Doug Smith, Jan 24 '13 at 16:10
`(A v B) == ~(~A ^ ~B)` is the transformation you're looking for. — Wooble, Jan 24 '13 at 16:13
You can make use of De Morgan's laws as shown here: http://en.wikipedia.org/wiki/De_Morgan's_laws — Neha Sharma, Feb 25 '13 at 14:41

score 2 · Accepted Answer · answered Aug 04 '13 at 20:19

2

Since this question is showing up as unanswered, I'll echo the others and say that De Morgan's law (A v B) == ~(~A ^ ~B) will work.

answered Aug 04 '13 at 20:19

Chris Culter

1 Answers1