De morgan''s laws - artificial intelligence, Computer Engineering

Assignment Help:

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.


Related Discussions:- De morgan''s laws - artificial intelligence

Convert statement into conjunctive normal form , Consider the following sta...

Consider the following statements about the types of fruit people like. If people like apples, then they do not like oranges. If people do not like apples, then they like orang

Python implementation of a solver for the desert cro, Python implementation...

Python implementation of a solver for the desert crossing, Python Programming #Minimum 100 words accepted#

Hard disk technology - computer architecture, Hard Disk Technology: Fi...

Hard Disk Technology: Figure of a computer hard disk drive           HDDs record data by magnetizing ferromagnetic material directionally, to represent

Define the terms- action semantics and argouml, Define the terms- Action Se...

Define the terms- Action Semantics and  ArgoUML Action Semantics : Action semantics is a group of firms that have responded to the OMG's RFP to define the action semantics fo

C programming, There is a pebble merchant. He sells the pebbles, that are u...

There is a pebble merchant. He sells the pebbles, that are used for shining the floor. His main duty is to take the length of the room’s sides. But he sometimes mistakes doing that

Define variants of turing machine, Define variants of Turing Machine?  ...

Define variants of Turing Machine?  Variants are  Non deterministic turing machine.  Mutlitape turing  machine.  Enumerators

Give example of stack using encapsulation of OOA, Give example of stack usi...

Give example of stack using encapsulation of OOA An example of the Stack.  A Stack abstraction provides methods like pop (), push (), isEmpty(), isFull(). The Stack can be i

What is digital signature, Digital Signature is Software to recognize si...

Digital Signature is Software to recognize signature

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd