The negation of ∼ s ∨ ( ∼ r ∧ s ) is equivalent to:
See this for reference.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Simple standard approach.
Correct !
We can solve this using Boolean Algebra.
To solve this, we first need to know the Absorption Law, which states that A . ( A + B ) = A . B , which is trivially true. Taking the dual of it, we get the variant we need to solve this problem: A + A . B = A + B .
We convert ( ∼ s ) ∨ ( ∼ r ∧ s ) into a Boolean expression: s + ( r . s )
By Absorption Law, this is equivalent to s + r .
If we negate that, then we get s ˉ + r ˉ = s + r = s ∧ r which follows from De Morgan's Law and the Involution Law.
Use Venn diagram considering r and s as intersecting sets in a universal set. Consider AND as intersection, OR as union and ~ as complement. Then take the complement the final region you get.
Problem Loading...
Note Loading...
Set Loading...