PROPOSITIONAL LOGIC

Proposition : The elementary or fundamental statement which may either true or false
in known as proposition. The combination of proposition and connective
is known as proposition logic.
Proposition are two types Simple Proposition and Compound Proposition.

Simple Proposition = Proposition does not contain any other proposition as its parts.
Compound Proposition = The Proposition which consists of two or more proposition as
its parts.

Wff (Well – Formed Formula) : The language that allows to define propositions whose
truth can be determined from the truth of other propositions is known as Well-Formed-
Formula(wff).

Syllogism : The logical process producing conclusion (or result) from any given
proposition is known as syllogism.

Premises : The proposition used to draw conclusion is known as premises.

Different types of connectives (operators) used in propositional logic:-

1) Disjunctive (Also called OR) : Represented by symbol + or v

Example : A + B or A v B
2) Conjunctive (Also called AND) : Represented by symbol . or ^
Example : A.B or A^B
3) Negation (Also called NOT) : Represented by symbol ~ or ‘
Example : ~A or A’
4) Conditional (Also called If ... Then or Implication) : Represented by Symbol -> or
=> or ⊃
Example : A -> B or A => B or A ⊃B

In truth Table write 0 when 1, 0 appear Boolean Expression A’ + B

A B A=>B or A’+B
0 0 1
0 1 1
1 0 0
1 1 1
5) Bi-Conditional (Also called If and only If or Equivalence) : Represented by symbol
<=> or ⊂ or ≡
Example : A <=> B or A ⊂ B or A ≡ B
In Truth table write 1 only when both inputs are equal (1,1 or 0,0)
A B A <=> B or A’B’ + AB Boolean Expression A’B’+ AB
0 0 1
0 1 0
1 0 0
1 1 1

KUNNAL SARKAR  9830242162/9007905275/8583935246/ (9874462286)  [email protected]/[email protected]

 PROPOSITIONAL LOGIC
Some Related Terms:

a) The Propositions that have some combination of 1’s and 0’s in their truth table
result column are called CONTINGENCIES

b) The Proposition having nothing but 1’s in their truth table result column are
called TAUTOLOGIES

c) The Proposition having nothing but 0’s in their truth table result column are
called CONTRADICTIONS

PROPOSITIONAL LOGIC :-

Proposition Expression : A=>B

A = It is raining
B = Sky is not clear
A -> B = If it is raining then sky in not clear

i) Converse Expression : B => A

If sky is not clear then it is raining

ii) Inverse Expression : ~A => ~B

If it is not raining then sky is clear

iii) Contrapositive Expression : ~B => ~A

If it is not raining then sky is clear

Proposition using Truth Table:-

a) pvq ^ ~(pvq)
p q pvq ~(pvq) pvq ^ ~(pvq)
0 0 0 1 0
0 1 1 0 0
1 0 1 0 0
1 1 1 0 0
CONTRADICTIONS

b) p^q => ~p ^ ~q

p q ~p ~q p^q ~p^~q p^q => ~p^~q

0 0 1 1 0 1 1
0 1 1 0 0 0 1
1 0 0 1 0 0 1
1 1 0 0 1 0 0
CONTINGENCIES

KUNNAL SARKAR  9830242162/9007905275/8583935246/ (9874462286)  [email protected]/[email protected]

 PROPOSITIONAL LOGIC
c) pvq => p^q
p q p v q p ^ q pvq =>p^q
0 0 0 0 1
0 1 1 0 0
1 0 1 0 0
1 1 1 1 1
CONTINGENCIES
d) (p->q) <=> ~q => (~p^~q)
p q ~p ~q p=>q p=>q <=> ~q ~p^~q (p->q)<=>~q=>(~p^~q)
0 0 1 1 1 1 1 1
0 1 1 0 1 0 0 1
1 0 0 1 0 0 0 1
1 1 0 0 1 0 0 1
TAUTOLOGIES

e) (p=>q) ^ (q=>r)
p q r p=>q q=>r (p=>q) ^ (q=>r)
0 0 0 1 1 1
0 0 1 1 1 1
0 1 0 1 0 0
0 1 1 1 1 1
1 0 0 0 1 0
1 0 1 0 1 0
1 1 0 1 0 0
1 1 1 1 1 1
CONTINGENCIES
f) (p=>r)^(q=>r) = (pvq)=>r
p q r p=>r q=>r pvq (p=>r)^(q=>r) (pvq)=>r
0 0 0 1 1 0 1 1
0 0 1 1 1 0 1 1
0 1 0 1 0 1 0 0
0 1 1 1 1 1 1 1
1 0 0 0 1 1 0 1
1 0 1 1 1 1 1 1
1 1 0 0 0 1 0 0
1 1 1 1 1 1 1 1
Identical

1) Modus Ponens:-
p
p => q (p^(p=>q))=>q (p.(p’+q))’+ q
q p q p=>q p^(p=>q) (p^(p=>q))=>q
p q p=>q p^(p=>q) p^(p=>q)=>q
0 0 1 0 1
0 1 1 0 1
1 0 0 0 1
1 1 1 1 1
TAUTOLOGIES
KUNNAL SARKAR  9830242162/9007905275/8583935246/ (9874462286)  [email protected]/[email protected]
 PROPOSITIONAL LOGIC
(p.(p’+q))’+q
= p’ + (p’+q)’ + q
= p’ + pq’ + q
= (p’+p)(p’+q’)+q
= p’ + q’ + q
= p’ + 1
= 1

2) Chain Rules:-
p=>q
q=>r ((p=>q)^(q=>r))=>(p=>r)
p=>r ((p’+q)(q’+r))’+(p’+r)
p q r p=>q q=>r p=>r (p=>q)^(q=>r)) ((p=>q)^(q=>r))=>(p=>r)
0 0 0 1 1 1 1 1
0 0 1 1 1 1 1 1
0 1 0 1 0 1 0 1
0 1 1 1 1 1 1 1
1 0 0 0 1 0 0 1
1 0 1 0 1 1 0 1
1 1 0 1 0 0 0 1
1 1 1 1 1 1 1 1
TAUTOLOGIES

((p’+q)(q’+r))’+(p’+r)
= (p’+q)’ + (q’+r)’ + p’+r
= pq’ + qr’ + p’+ r
= p’+pq’ + r+qr’
= (p’ + p)(p’+q’) +(r+r’)(r+q)
= p’ + q’ + r + q
= p’ + 1 + r
= 1

Home Work:-
1) A v B 2) A => B 3) X <=> ~y
~A => B B => C Y => Z
~B A Z
C
1) (p ^ q) v ~(p ^ q)
2) (p v q) ^ (p v ~q) v p
3) (a=>b) => ~a
4) (a=>b)^(b=>a) = a <=> b
Satisfiable = Tautologies
valid = Contingencies
invalid = Contradiction

KUNNAL SARKAR  9830242162/9007905275/8583935246/ (9874462286)  [email protected]/[email protected]

 PROPOSITIONAL LOGIC
a = I like coffee
b = It like tea
Proposition in Simple statement:-
a) I like coffee and tea a ^ b
b) I like coffee but not like tea a ^ ~b
c) It is false that I don’t like coffee or tea ~(~a v b)
d) Neither I like coffee nor tea ~a v ~b
e) Either I like coffee or I do not like coffee or like tea a v ~(a v b)

Significance of P -> Q (CONDITIONAL) A’+B

P->Q may be interpreted as:
• If P then Q
• P implies Q
• Q follows from P
• Q if P
• Q whenever P
• P only if Q
• Q is necessary for Q

Significance of P <-> Q (BI-CONDITIONAL) EX-NOR gate Expression A’B’+AB

P <-> Q may be interpreted as:
• (if P then Q) and (if Q then P)
• P if and only if Q
• Q if and only if P
• (P if Q) and (Q if P)
• P is necessary and sufficient for Q
• Q id necessary and sufficient for P
• P and Q are necessary and sufficient for each other
• ~p and ~Q are equivalent

Converting English Sentence to Propositional Logic:-

WORD Replacement
AND Conjunction (^)
OR Disjunction (v)
BUT AND
Whenever IF
When IF
Either P or Q P or Q
Neither P nor Q NOT P AND NOT Q
P unless Q ~Q->P
P is necessary but not Sufficient for Q (Q=>P) AND ~(P=>Q)

KUNNAL SARKAR  9830242162/9007905275/8583935246/ (9874462286)  [email protected]/[email protected]

 PROPOSITIONAL LOGIC
Practice Problems:-

1) If it is rains, then I will stay at home. P => Q

2) If I will go to Australia, then I will earn more money. P -> Q
3) He is poor but honest. P ^ Q
4) If a = b and b = c then a = c (P^Q)=>R
5) Neither it is hot nor cold Today. ~P ^ ~Q
6) He goes to play a match if and only if it does not rain. P <=> Q
7) Birds fly if and only if the sky is clear. P <=> Q
8) I will go only if he stays. P => Q
9) It is false that he is poor but not honest.
P = He is Poor, Q = He is honest ~(P ^ ~Q)
10) It is false that he is poor or clever but not honest.
P = He is poor, Q = He is clever, R = He is honest ~((PVQ)^~R)
11) It is hot or else if is it is both clod or cloudy.
P = it is hot, Q = it is cold, R = it is cloudy P v (Q ^ R)
12) I will not go to class unless you come.
P = I will go to school, Q = you come ~Q => P
13) Presence of cycle in a multi instance RAG is a necessary but not sufficient
condition for deadlock.
P = Presence of cycle in a multi instance RAG
Q = Presence of deadlock (Q=>P)^~(P=>Q)
14) Neither the red nor the green is available in size 5
P = Red is available in size 5, Q = Green is available in size 5 ~P ^ ~ Q

KUNNAL SARKAR  9830242162/9007905275/8583935246/ (9874462286)  [email protected]/[email protected]