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

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.

Posted Date: 10/2/2012 8:04:29 AM | Location : United States







Related Discussions:- De morgan''s laws - artificial intelligence, Assignment Help, Ask Question on De morgan''s laws - artificial intelligence, Get Answer, Expert's Help, De morgan''s laws - artificial intelligence Discussions

Write discussion on De morgan''s laws - artificial intelligence
Your posts are moderated
Related Questions
Explain the generic framework for electronic commerce along with suitable diagram? Generic Framework for electronic commerce comprises the Applications of EC (as like banking,

ADDING LAYERS TO THE TIMELINE AND GIVING MOTION TO THE LAYER Step 1:  Choose Layer from Common toolbar after that draw a layer. Step 2:  Write the text inside Layer. Step

Timing for both read and update transactions should be gathered to verify whether system functions are being performed in an acceptable timeframe. This should be done standalone an

What is model?  A universe together with an assignment of relations to relation symbol is known as a model.  A model M is a tuple (U, P1, P2..Pk), where U is the universe and P

Q. Show the spawned program? include "pvm3.h"  main() {    int ptid, msgtag;    char buf[100];    ptid = pvm_parent();    strcpy(buf, "hello, world from ");

State how Shared Memory is used for inter process communication. Define how ptrace is used by debuggers.  What are modules? Explain how data mapping takes place among modules

Problem Solving In Parallel Introduction to Parallel Computing This section examines how a particular task can be broken into minor subtasks and how subtasks can be answer i

A number of 256 x 8 bit memory chips are available. To design a memory organization  of 2 K x 8 memory. Identify the requirements of 256 x 8 memory chips and explain the details.

Disc shapes and diameters:     A Mini-CD is 8 centimeters in diameter. The digital data on a CD start at the center of the disc and proceeds toward the edge, whi

Program: This program compares a pair of characters entered by keyboard. ; Registers used: AX, BX, CX, DX DATA SEGMENT                          XX DB?