Classical Logic & Fuzzy Logic

Classical predicate logic

T: uU [0,1]

U: universe of all propositions.

All elements u U are true for proposition P are called the truth set of P: T(P).

Those elements u U are false for P are called falsity set of P: F(P).

T(Y) = 1 T(Ø) = 0

Classical Logic &Fuzzy Logic

Logic connectives

Disjunction Conjunction Negation –Implication Equivalence

If xA, T(P) =1 otherwise T(P) = 0OrxA(x)={ 1 if x A, otherwise it is 0 }

If T(p)T()=0 implies P true, false, or true P false. P and are mutually exclusive propositions.

Classical Logic &Fuzzy Logic

Given a proposition P: xA, P: xA, we have the following logical connectives:

Disjunction PQ: x A or x B hence, T(PQ) = max(T(P),T(Q))Conjunction PQ: xA and xB

hence T(P Q)= min(T(P),T(Q))Negation If T(P) =1, then T(P) = 0 then T(P) =1Implication (P Q): xA or xB Hence , T(P Q)= T(P Q)

Classical Logic &Fuzzy Logic

Equivalence

1, for T(P) = T(Q)(P Q): T(PQ)=

0, for T(P) T(Q)

The logical connective implication, i.e.,P Q (P implies

Q) presented here is also known as the classical

implication.

P is referred to as hypothesis or antecedent

Q is referred to as conclusion or consequent.

Classical Logic &Fuzzy Logic

T(PQ)=(T(P)T(Q))Or PQ= (AB is true)T(PQ) = T(PQ is true) = max (T(P),T(Q))(AB)= (AB)= ABSo (AB)= ABOr AB false AB

Truth table for various compound propositions

P Q P PQ PQ PQ PQ

T(1) T(1) F(0) T(1) T(1) T(1) T(1)

T(1) F(0) F(0) T(1) F(0) F(0) F(0)

F(0) T(1) T(1) T(1) F(0) T(1) F(0)

F(0) F(0) T(1) F(0) F(0) T(1) T(1)

Classical Logic &Fuzzy Logic

PQ: If x A, Then y B, or PQ AB

The shaded regions of the compound Venn diagram in the following figure represent the truth domain of the implication, If A, then B(PQ).

B Y

X

A

Classical Logic &Fuzzy Logic

IF A, THEN B, or IF A , THEN CPREDICATE LOGIC (PQ)(PS)Where P: xA, AX

Q: yB, BYS: yC, CY

SET THEORETIC EQUIVALENT (A X B)(A X C) = R = relation ON X Y

Truth domain for the above compound proposition.

Classical Logic &Fuzzy Logic

Some common tautologies follow:

BB X AX; A X X

AB (A(AB))B (modeus ponens)(B(AB))A (modus tollens)Proof:(A(AB)) B(A(AB)) B Implication((AA) (AB))B Distributivity((AB))B Excluded middle laws(AB)B Identity(AB)B Implication(AB)B Demorgans lawA(BB) AssociativityAX Excluded middle lawsX T(X) =1 Identity; QED

Classical Logic & Fuzzy Logic

Proof(B(AB))A(B(AB))A((BA)(BB)) A((BA))A(BA)A

(BA)A

(BA)AB(AA)BX = X T(X) =1 A B AB (A(AB) (A(AB)B

O 0 1 0 1

O 1 1 0 1

1 0 0 0 1

1 1 1 1 1

Truth table (modeus ponens)

Classical Logic &Fuzzy Logic

Contradictions

BBA; AEquivalencePQ is true only when both P and Q are true or when both P and q are false.Example

Suppose we consider the universe positive integers X={1 n8}. Let P = “n is an even number “ and let Q =“(3n7)(n6).” then T(P)={2,4,6,8} and T(Q) ={3,4,5,7}. The equivalence PQ has the truth set T(P Q)=(T(P)T(Q)) (T(P) (T(Q)) ={4} {1} ={1,4}

T(A)

T(B)Venn diagram for equivalence

Classical Logic &Fuzzy Logic

Exclusive orExclusive NorExclusive or P “” Q(AB) (AB)Exclusive Nor(P “” Q)(PQ)Logical proofsLogic involves the use of inference in everyday life.

In natural language if we are given some hypothesis it is often useful to make certain conclusions from them the so called process of inference (P1P2….Pn) Q is true.

Classical Logic &Fuzzy Logic

Hypothesis : Engineers are mathematicians. Logical thinkers do not believe in magic. Mathematicians are logical thinkers.Conclusion : Engineers do not believe in magic.Let us decompose this information into individual propositionsP: a person is an engineerQ: a person is a mathematicianR: a person is a logical thinkerS: a person believes in magicThe statements can now be expressed as algebraic propositions as((PQ)(RS)(QR))(PS)It can be shown that the proposition is a tautology.ALTERNATIVE: proof by contradiction.

Classical Logic &Fuzzy Logic

Deductive inferences

The modus ponens deduction is used as a tool for making inferences in rule based systems. This rule can be translated into a relation between sets A and B.

R = (AB)(AY)

Now suppose a new antecedent say A’ is known, since A implies B is defined on the cartesian space X Y, B can be found through the following set theoretic formulation B= AR= A((AB)(AY))

Denotes the composition operation. Modus ponens deduction can also be used for compound rule.

Classical Logic &Fuzzy Logic

Whether A is contained only in the complement of A or whether A’ and A overlap to some extent as described next:

IF AA, THEN y=B

IF AA THEN y =C

IF AA , AA, THEN y= BC