Problem Detail: De Morgan’s Law is often introduced in an introductory mathematics for computer science course, and I often see it as a way to turn statements from AND to OR by negating terms. Is there a more intuitive explanation for why this works rather than just remembering truth tables? To me this is like using black magic, what’s a better way to explain this so that it makes sense to a less mathematically inclined individual?
Asked By : Ken Li
Answered By : Ran G.
If you like to visualize it, use the venn diagrams. See this, for instance. I find it more simple just to memorize the basic 2 laws: everytime you “break” a negation line, you replace the AND to OR (or vice versa). Adding two negation lines changes nothing (but gives you more “lines” to break). It just works.
Best Answer from StackOverflow
Question Source : http://cs.stackexchange.com/questions/350
