Download - Logic (PROPOSITIONS)

Transcript
Page 1: Logic (PROPOSITIONS)

By D .Nayanathara (BSc in MIS) By D .Nayanathara (BSc in MIS)

Page 2: Logic (PROPOSITIONS)

• SENTENCE THAT IS ETHIER TRUE (T)OR FALSE(F)Ex –

• 3 + 5 = 8 : Proposition

• 9 - 2 = 5 : Proposition

• a < b : Not a Proposition

• Who can speak French: Not a Proposition

Page 3: Logic (PROPOSITIONS)

• PRIMITIVE PROPOSITION - Can not be broken down in to simple proposition.

• COMPOSITE OR COMPOUND PROPOSITION – Can be broken down in to two or more primitive propositions.

Ex – 2+3 = 5 and 1+7 = 4Birds can fly or Today is hot.

Page 4: Logic (PROPOSITIONS)

Name Symbol OperationNegative not ~

Disjunction or ˅ Conjunction and ˄

Page 5: Logic (PROPOSITIONS)

• Proposition variables used to describe proposition

• Propositional Variable is variable which either true or false

• In logic p,q,r ,.. Letters used to indicate these variables

Ex: ̴̴̴̴ p indicate negative of the p

Page 6: Logic (PROPOSITIONS)

Truth table lists whether a statement is true or false.

Truth Tables defined the logical connectives of the compound statements(compound propositions). The sentences built out of propositions and logical connectives are also propositions. They have truth values.

Page 7: Logic (PROPOSITIONS)

• Column must be allocated for each proposition variables in the compound statement and for the final compound proposition.

• Truth Tables should contain all the possible combinations (truth values) of T and F values for all proposition variables.

Page 8: Logic (PROPOSITIONS)

• Number of rows in truth table indicates by 2n where n is the number of propositions.

Ex : Birds can fly or Today is hot.1. Birds can fly2. Today is hot There are two propositions in the

compound statement : n = 2 So, Number of rows (combinations) = 22

= 4

Page 9: Logic (PROPOSITIONS)

p ̴����pT FF T

Page 10: Logic (PROPOSITIONS)

p q p v qT T TT F TF T TF F F

Page 11: Logic (PROPOSITIONS)

p q p ˄ qT T TT F FF T FF F F

Page 12: Logic (PROPOSITIONS)

p pv p ����T TF T

Ex :pv( ̴̴̴̴ p˄q)

Formula which is always True (or T )

Page 13: Logic (PROPOSITIONS)

p q p˄q ~(p˄q) pv~(p˄q)

T T T F TT F F T TF T F T TF F F T T

Ex : pv( ̴̴̴̴ p˄q)

Page 14: Logic (PROPOSITIONS)

p p ˄ p ����T FF F

Ex: (pv (not p)) ((p˄ (not p)) (p˄q) ˄not(pvq)

Formula which is always False (or F)

Page 15: Logic (PROPOSITIONS)

p q p˄q p v q ~(p v q) (p˄q) ˄~(p v q)

T T T T F FT F F T F FF T F T F FF F F F T F

Ex : (p˄q) ˄~(pvq)

Page 16: Logic (PROPOSITIONS)

p q p → qT T TT F FF T TF F T

If p then q

Page 17: Logic (PROPOSITIONS)

p q p ↔ qT T TT F FF T FF F T

p if and only if q (iff)

Page 18: Logic (PROPOSITIONS)