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.
defination of query ?
We have to make an application that will dynamically add a menu strip with menu items to a form(ie NOT dragged and dropped onto the form) in Visual Basic. The menu strip should be
Measuring and Improving Cache Performance: 1. Reduce the possibility that 2 different memory block will contend for the similar cache location 2. Additional cache levels
Distributivity of Connectives : In our last analogy with arithmetic will involve a very well-technique need for playing around with algebraic properties. But assume there if w
Q. Explain about FAT - Inode? Today modern PC comprises total capacity of nearly 40GB for storage of program and data Due to this huge capacity in place of having just one oper
My name is mrs flo and i apporve dubstep, do you apporve it?
The Internet has emerged as a major worldwide distribution channel for goods, managerial, services, and professional jobs. It has impacted market economics and industry structure,
Suppose that a process scheduling algorithm favors those processes that have used the least processor time in the recent past. Why will this algorithm favour I/O- bound processes,
END DIRECTIVE: ENDS directive ends a segment and ENDP directive ends a procedure and END directive ends whole program which appears as last statement. ASSUME Directive: An .
A binary tree can be converted in to its mirror image By traversing it in Preorder
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