Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
De Morgan's Laws
Continuing with the relationship between ∧ and ∨, we can also use De Morgan's Law to rearrange sentences involving negation in conjunction with these connectives. Actually, there are 2 equivalences which taken as a pair are called De Morgan's Law:
¬(P ∧Q) ≡ ¬P ∨¬Q
¬ (P ∨ Q) ≡ ¬P ∧ ¬Q
These are essential rules and it is good spending some time thinking regarding why they are true.
Contraposition
The contraposition equivalence is following:
P -> Q ≡ ¬Q -> ¬P
At first, this can seem a little strange because it seem that we have said nothing in the first sentence regarding ¬Q, soin the second sentence how can we infer anything from it? However, imagine we know that P implies Q, and we saying that Q was false. In this case, if we were to imply that P was true because we know that P implies Q, we also know that Q is true. But Q was false .So we cannot possibly denote that P is true, which means that we ought to imply that P is false (because we are in propositional logic, so P might be either true or false). This argument shows that we may replace the first sentence by the second one, and it is left as aworkout to construct a similar argument for the vice-versa part of this equivalence.
Q. Show Basic concepts of permutation? Let us look at the basic concepts of permutation with respect to interconnection network. Let us say the network has set of n input node
Why object oriented development not only allows reuse In a wider way we can say that object oriented development not only allows reuse and information sharing within an applica
Q. Combined Parallel Work-sharing Constructs? Combined parallel work sharing constructs are shortcuts for specifying a work sharing construct nested instantaneously in a parall
The major programs here are Arthur Samuel's, the rote learning method which is a lot like a memory based method, generalization learning which is a lot like backprop and a signatur
Q. What do you mean by Drive Cache? Disk cache may be a part of RAM sometimes known as soft disk cache which is used to speed up access time on a disk. In latest technologies s
Why The JavaScript Validation Not Run on the Asp.Net? The Asp.Net Button Is post backed on the server & not yet Submit & when it goes to the server its states is lost so if we
Give difference between top down parsing and bottom up parsing. Top down parsing: Specified an input string, top down parsing tries to derive a string identical to this by s
What are stacks? A stack is an abstract data type in which items are additional to and removed only from one end known as TOP. For example, consider the pile of papers on you
How many types of keys used to encrypt and decrypt data in Secure Sockets Layer? Two forms of keys are used as ciphers to decrypt and encrypt data. Private keys are referred to
Local minima - sigmoid units: Alternatively in addition to getting over some local minima where the gradient is constant in one direction or adding momentum will increase the
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd