Question on deMorgans law on simplifying boolean expressions

In summary, deMorgan's law is a principle in Boolean algebra that allows us to rewrite complex expressions by changing the logical operator and distributing negations. It can be applied to any boolean expression and is a fundamental principle in various fields. While it is similar to the distributive law, deMorgan's law specifically deals with negations. It can be proven mathematically using logical equivalences and truth tables.
  • #1
randomperson4
2
0

Homework Statement


I'm sure you all know deMorgans law on simplifying boolean expressions, I just can't seem to get it. It doesn't make sense to me, like ([not]x.[not]y) = [not]x + [not]y].2. The attempt at a solution

I tried it and I don't know why it doesn't work for me ie.
([not]1.[not]0) = [not]1 + [not]0 =
(0.1) = 0 + 1 =
0 = 1

See my problem.
 
Physics news on Phys.org
  • #2
DeMorgan's says not[x].not[y]=not[x+y]. That's NOT the same as not[x]+not[y].
 
  • #3
Woah, Thanks.
 

Similar threads

Replies
3
Views
3K
Replies
4
Views
4K
Replies
1
Views
2K
Replies
2
Views
2K
Replies
2
Views
2K
Replies
5
Views
1K
Replies
2
Views
2K
Replies
4
Views
9K
Back
Top