SESSION-6

Fundamentals of Logic
Fundamentals of Logic
• Sentence: A sentence is usually collection of words
• Proposition: A proposition is usually a declarative to which it is
meaningful to assign one and only one of the truth values i.e. either
“true” or “false” but now both.
• Proposition/ statement / premise
• Note: all propositions are sentences but all sentences need not be
proposition.

Examples – Propositions
1 Sachin is a player. True
2 2+2=10 false
3 It is raining false
4 DMS is the subject of CSE true
• Examples – Non propositions:

1. It is good
2. He is the tallest person in this class
4 2+x=10
5 What a beautiful morning!
6 Get up and do your exercises
7 The number x is an integer.
8 Are you busy?
Negation:
• If p is a proposition, then "p is not true" is a proposition, which we
represent as ~p or 7p, and refer to it as "not p”, "the negation of
p", or "the denial of p".
• Not p is a proposition that is true when p is false and false when p
is true

Example:
 P: sachin is batsman.
 ~P: sachin is not batsman
 Q: sachin is not a tennis player
 ~Q: sachin is a tennis player
Conjunction:
• If p and q are propositions, then "p and q" is a proposition, which
we represent in symbols as p ^ q and refer to it as the conjunction
of p and q.
• The conjunction of p and q is true only when both p and q are
true.

Example:
• P: sachin is a batsman.
• Q: sachin is a bowler
• P ^ Q: sachin is batsman and bowler
• ~P ^ Q: sachin is not a batsman and he is a bowler
• P ^ ~Q: sachin is a batsman and he is not a bowler
• ~P ^ ~Q: neither sachin is a batsman nor bowler
(or) sachin is not batsman and not a bowler
Disjunction:
 If p and q are propositions, then "p or q" is a proposition, which we
represent in symbols as p V q and refer to it as the disjunction of p
and q.
 Inclusive OR: either p is true or q is true or both
 Exclusive OR: either p is true or q is true but not both

Example:
 P: sachin is a foot ball player.
 Q: sachin is a cricketer.
 P VQ: sachin is foot ball player or cricketer.
 ~PVQ: sachin is not a foot ball player or cricketer.
 PV~Q: sachin is foot ball player or he is not a cricketer
 ~PV~Q: sachin is not a foot ball player or not a cricketer
Conditional:
• The proposition "p implies q" or "if p then q" is represented as p→q and
is called an implication or a conditional.
• P is called the premise, hypothesis, or antecedent of the implication,
and q is called the conclusion or consequent of the implication.
• p →q is false only when the antecedent p is true and the consequent q
is false.

Example:
 P: 2 sides of a triangle are equal
 Q: triangle is isosceles
 p →q: if 2 sides of a triangle are equal then it is isosceles
 q→p: if triangle is isosceles then 2 sides of a triangle are equal
 ~p→q: if 2 sides of a ∆ are not equal then it is isosceles.
 p →~q: if 2 sides of a ∆ are equal then it is not isosceles.
Bi-Conditional:
 The proposition "p double implies q" or "p if and only if q" or “p iff q “ is
represented as p ↔q and is called a bi-conditional.
 P is called the premise, hypothesis, or antecedent of the implication, and
q is called the conclusion or consequent of the implication.
 p ↔q is true when both the statements are false / true
 p ↔q is false when any one of them is true

Example:
 P: 2 sides of a triangle are equal
 Q: triangle is isosceles
 p ↔q: 2 sides of a ∆ are equal iff it is isosceles.
 q ↔p: Triangle is isosceles if and only if 2 sides of ∆ are
equal
 ~p ↔q: 2 sides of triangle are not equal if and only if it is isosceles
Tautology:
A tautology is a propositional function whose truth value is true
for all possible values of the propositional variables.
Example: PV~P
Problems:
 Construct the truth tables for the following
1.[(pVq)^(~r)] ↔q
2.(pVq)^( (~p)v(~r) )
3.{(p^q)V(~p^r)} v (q^r)
4.[ (pVq) ^ (~r) ] ↔ (q→r)

 Prove the following are tautologies

1.~(PVQ) V [ (~P) ^ Q ] V P
2.[ (P →Q) ^ (R →S) ^ (PVR) ] → (QVS)
3.[ (P →R) ^ (Q →R)] → [(PVQ) →R]