Question. While trying to prove a propositional logic statement, a student makes use o the following incorrect equivalence: NOT(p OR q) == NOT p OR NOT q
Show algerbraically that the equivalence is invalid.
Now the only thing I can think of is writting
NOT(p AND q) expands to NOT p AND NOT q
NOT p OR NOT q simplifies to NOT(p AND q)
So you can see they are not the same thing, but the question is worth 8% I'm not really sure what it's asking exactly.