-3

I am at the start of my A-level computing course, but I have gotten stuck on de Morgan's law, If we have the expression (pronounced: Not(A And B) And B all Not) How would de Morgan's law apply to that? And can anyone explain me how you handle the Not(A And B) part when the entire thing is notted?

Thanks in advance

write-up of the formula here

Stefano Sanfilippo
  • 32,265
  • 7
  • 79
  • 80
Jort de Bokx
  • 25
  • 1
  • 6

1 Answers1

1

Let's say ~, . and v represent NOT, AND and OR operator respectively. Then we can apply the De Morgans's law as:

~((A.B).B) = ~(A.B) v ~B => = (~A v ~B) v ~B

Amit Sharma
  • 1,987
  • 2
  • 18
  • 29
  • Great! I forgot that you use basic maths to expand the bracket, Thanks a lot – Jort de Bokx Oct 19 '14 at 12:54
  • Note that there is a mistake on the answer above as the initial formula is wrong (and there is a typo too) - it shouldn't be too hard to spot the mistakes though and get the correct answer for yourself. – Paul R Oct 19 '14 at 13:00
  • @PaulR Thanks for pointing out the error in answer. I just tried to explain how we can apply the De Morgan's law. – Amit Sharma Oct 19 '14 at 13:06
  • No problem - I see you fixed the typo, but there is still an error in the initial formula - it's good to let the OP work this out for himself though, since that is the whole point of homework. – Paul R Oct 19 '14 at 15:16