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.
What are the difference between finite automata and Turing Machines? Turing machine can alter symbols on its tape, while the FA cannot change symbols on tape. Also TM has a
Vector-Memory Instructions When vector operations with memory M are carried out then these are vector-memory instructions. These instructions are referred with the subsequent f
The verification method states how Robot compares the baseline data captured while recording with the data captured during playback.
Echo suppressor is detrimental to full duplex operation because? This disables one of the two pairs in a four-wire trunk line while a signal is detected upon another pair.
What are the gates required to build a half adder ? Ans. The gates needed to build a half adder are EX-OR gate and AND gate as shown below the logic diagram of half adder:
Binary Resolution: However we saw unit resolution for a propositional inference rule in the previous lecture: (A? B, ¬B) /A Thus we can take this a little further to
CISC Approach - CISC architecture: The main goal of CISC architecture is to finish a task in as few lines of assembly as possible as. This is gain by building processor hardwa
Is it true that the Logical Database reads the data from the database tables using Select Statements. Yes. We are coding that in Database part of LDB.
You have a file having sporting goods that are sold online. Every item record contains the item id, item name, item description, item category, item price, and the units in stock.
What are the steps comprised in authentication? Steps in Authentication: The control over the access of the resources within the repository is exercised in two steps tha
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