Question on deMorgans law on simplifying boolean expressions

AI Thread Summary
DeMorgan's law states that the negation of a conjunction is equivalent to the disjunction of the negations, specifically that not(x and y) equals not x or not y. The confusion arises in the application of the law, particularly when substituting values into the expressions. An example provided shows an incorrect simplification where the user equates not(1 and 0) with not(1) or not(0), leading to a contradiction. The key takeaway is that proper application of DeMorgan's law is crucial for accurate simplification of boolean expressions. Understanding these principles is essential for mastering boolean algebra.
randomperson4
Messages
2
Reaction score
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
DeMorgan's says not[x].not[y]=not[x+y]. That's NOT the same as not[x]+not[y].
 
Woah, Thanks.
 

Similar threads

Simplify the Boolean expression
Replies
3
Views
3K
Simplifying Boolean Algebra Equations with Distribution and DeMorgan's Law
Replies
8
Views
3K
Engineering Circuit Realization of XOR function with Three inputs
Replies
4
Views
5K
How Do You Simplify This Boolean Expression Using DeMorgan's Law?
Replies
1
Views
4K
Simplify the boolean expression #2
Replies
1
Views
2K
Simplify the boolean expression
Replies
2
Views
2K
Engineering Write the Boolean expression of a given logic circuit
Replies
2
Views
2K
Comp Sci Boolean simplification of a larger term?
Replies
5
Views
2K
How Do I Simplify This Boolean Expression?
Replies
2
Views
2K
Simplifying boolean expressions
Replies
4
Views
9K

Hot Threads

Recent Insights

Back
Top