Question
De Morgan Law 4
Answer :
Word Count : 307
____ ________ ______ ___ ______ _____ ____.
___ ________ ________ _________ _______ ______ _____ ____ ______ ___ ___ _____.
_________ ___ ________ ______ ______ _______ __________ ______ _________ ____.
______ _____ _______ ___ ____ __________ ______ ___ ______ ____ ________.
_______ _______ ____ _______ ____ __________ ________ _________ ______ ___ ______ __________.
____ ____ _________ __________ ______ ____ _____ _______ ____ ___ ________.
___ _____ ___ ___ ________ _________ ________ ____.
___ _________ __________ ________ ______ ____.
__________ _________ ________ ________ _______ _______ ______.
___ ______ ________ ______ _____ ___.
_______ ____ _____ _____ ___ __________ ___ ____ ____ ___.
___ __________ ___ ____ ______ __________ _______ ________ __________.
_______ ___ __________ ____ ____ ___ ___ ______ ______.
____ ___ _________ _______ _____ __________ _________.
______ _________ _____ _________ _________ ____ ______ _____ __________ _____ _____ ________.
_________ ____ _________ __________ ___ ____ _________ ______ ___ ____ _______.
_______ __________ _____ ________ ___ ________ ______ ___ _________ _______ _____ _____.
________ ________ ______ _______ __________ _____ _____ ___ ____ ____.
_____ ________ _________ ____ _______.
__________ __________ ___ _______ ___.
______ ___ ________ ______ __________ _______ ______ ____ ___.
________ _____ ___ __________ _______ __________ ___ ____ _________ __________ _________ ___.
_____ ___ ______ _____ ________ _________ ________ _______ __________ _________ _________.
___ _____ _________.
Skip in 10
De Morgan's laws are a pair of transformation rules that are both valid rules of inference. They are named after Augustus De Morgan, a 19th-century British mathematician. The rules allow the expression of conjunctions and disjunctions purely in terms of each other via negation.
The rules can be expressed in English as:
the negation of a disjunction is the conjunction of the negations; and
the negation of a conjunction is the disjunction of the negations;
or
the complement of the union of two sets is the same as the intersection of their
___ ________ ________ _________ _______ ______ _____ ____ ______ ___ ___ _____.
_________ ___ ________ ______ ______ _______ __________ ______ _________ ____.
______ _____ _______ ___ ____ __________ ______ ___ ______ ____ ________.
_______ _______ ____ _______ ____ __________ ________ _________ ______ ___ ______ __________.
____ ____ _________ __________ ______ ____ _____ _______ ____ ___ ________.
___ _____ ___ ___ ________ _________ ________ ____.
___ _________ __________ ________ ______ ____.
__________ _________ ________ ________ _______ _______ ______.
___ ______ ________ ______ _____ ___.
_______ ____ _____ _____ ___ __________ ___ ____ ____ ___.
___ __________ ___ ____ ______ __________ _______ ________ __________.
_______ ___ __________ ____ ____ ___ ___ ______ ______.
____ ___ _________ _______ _____ __________ _________.
______ _________ _____ _________ _________ ____ ______ _____ __________ _____ _____ ________.
_________ ____ _________ __________ ___ ____ _________ ______ ___ ____ _______.
_______ __________ _____ ________ ___ ________ ______ ___ _________ _______ _____ _____.
________ ________ ______ _______ __________ _____ _____ ___ ____ ____.
_____ ________ _________ ____ _______.
__________ __________ ___ _______ ___.
______ ___ ________ ______ __________ _______ ______ ____ ___.
________ _____ ___ __________ _______ __________ ___ ____ _________ __________ _________ ___.
_____ ___ ______ _____ ________ _________ ________ _______ __________ _________ _________.
___ _____ _________.
IGNOU ACADEMY
Your IGNOU journey, made easier.
- Solved Assignments
- Study Notes
- Guess Papers
- Question Papers
Continue Reading — It's Free
Sign in with Google to unlock more of this answer.
✓ Free access
✓ Unlock up to 60% of the answer
✓ No payment required
✓ Unlock up to 60% of the answer
✓ No payment required
Quick Google sign-in. No separate registration form.