PDA

View Full Version : Formal boolean proofs.


nahanksh
Feb2-10, 01:27 AM
1. The problem statement, all variables and given/known data
Prove that
A \oplus B' \oplus C = (A \oplus B \oplus C)'


2. Relevant equations



3. The attempt at a solution
I tried to use A \oplus B' \oplus C = ABC' + A'B'C' + A'BC + AB'C

But i am not sure how to proceed further from there...

Please could someone give me a little bit of help ?

Synaesthesia
Feb2-10, 04:35 AM
I would start with the right hand side - it can be rewritten with some laws.

Synaesthesia
Feb2-10, 04:36 AM
I'm sorry that was still vague. De Morgan's laws to be specific.
NOT (P OR Q) = (NOT P) AND (NOT Q)
NOT (P AND Q) = (NOT P) OR (NOT Q)

Synaesthesia
Feb2-10, 04:37 AM
I'm sorry that was still vague. De Morgan's laws to be specific.
NOT (P OR Q) = (NOT P) AND (NOT Q)
NOT (P AND Q) = (NOT P) OR (NOT Q)