UNIT-3 MATHEMATICAL LOGIC (BCA) - Maths

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 4

UNIT- 3 Mathematical Logic

 Introduction to Logic:-
 Statement:- A declarative sentence is called statement. if it is possible to say definitely that it is
true or false but not both.
 Truth Value:
The truth value of true statement is denoted by T.
The truth value of False statement is denoted by F.
 Simple Statement :-
A statement involving only one statement is said to be simple statement.
 Composite statement or compound statement :-
A statement involving more than one statement is said to be Composite statement or
compound statement.
 Logical Connectives:-
Two or more simple statement can be joined by and , or , not ,if then , if and only if . this terms
are called logical connectives.
 Conjunctions:-
The compound statement obtained by connecting two simple statement with the connective
'and' is called conjunction.
The conjunction of p and q is denoted by p ʌ q.
The compound statement p ʌ q is true when p and q both are true and in all other case it is false.
p q pʌq
T T T
T F F
F T F
F F F

Discojunction:- The compound statement obtained by connecting two simple statement with
the connective 'or' is called conjunction.
The conjunction of p and q is denoted by p v q.
The compound statement p v q is false when p and q both are false and in all other case it is
true.
p q pvq
T T T
T F T
F T T
F F F
 Negation :-
A statement who's truth vale is opposite to that statement is called Negation.
The negation of p is denoted by ~p.
p ~p
T F
F T
 Law of logical connectives :
 Commutative law:-( Prove that commutative law by truth table.)
(i) p ʌ q = q ʌ p (ii) p v q = q v p
(i) (ii) (iii) (iv) (v) (vi)
p q pʌq qʌp pvq qvp
T T T T T T
T F F F T T
F T F F T T
F F F F F F
Here, column (iii) & (iv) are identical .
∴pʌq=qʌp
Here, column (v) & (vi) are identical .
∴pvq=qvp
 De Morgan's law :-(Prove that De Morgan's law by truth table.)
(i) ~ (p ʌ q) = (~p) v (~q) (ii) ~ (p v q) = (~p) ʌ (~q)
(1) (2) (3) (4) (5) (6) (7) (8) (9) (10)
p q ~p ~q pʌq pvq ~ (p ʌ q) (~p) v (~q) ~ (p v q) (~p) ʌ (~q)
T T F F T T F F F F
T F F T F T T T F F
F T T F F T T T F F
F F T T F F T T T T
Here, column (7) & (8) are identical .
∴ ~ (p ʌ q) = (~p) v (~q)
Here, column (9) & (10) are identical .
∴ ~ (p v q) = (~p) ʌ (~q)
 Distributive law :-( Prove that distributive law by truth table .)
(i) p ʌ (q v r) = (p ʌ q) v (p ʌ r) (ii) p v (q ʌ r) = (p v q) ʌ (p v r)
(1) (2) (3) (4) (5) (6) (7) (8) (9) (10) (11) (12) (13)
p q r q v r p ʌ q p ʌ r q ʌ r p v q p v r p ʌ (q v r) (p ʌ q) v p v (q ʌ r) (p v q) ʌ
(p ʌ r) (p v r)
T T T T T T T T T T T T T
T T F T T F F T T T T T T
T F T T F T F T T T T T T
T F F F F F F T T F F T T
F T T T F F T T T F F T T
F T F T F F F T F F F F F
F F T T F F F F T F F F F
F F F F F F F F F F F F F
Here, column (10) & (11) are identical .
∴ p ʌ (q v r) = (p ʌ q) v (p ʌ r)
Here, column (12) & (10) are identical .
∴ p v (q ʌ r) = (p v q) ʌ (p v r)
 Associative law :( Prove that Associative law by truth table.)
(i) p ʌ (q ʌ r) = (p ʌ q) ʌ r (ii) p v (q v r) = (p v q) v r
(1) (2) (3) (4) (5) (6) (7) (8) (9) (10) (11)
p q r qʌr pʌq qvr pvq p ʌ (q ʌ r) (p ʌ q) ʌ r p v (q v r) (p v q) v r
T T T T T T T T T T T
T T F F T T T F F T T
T F T F F T T F F T T
T F F F F F T F F T T
F T T T F T T F F T T
F T F F F T T F F T T
F F T F F T F F F T T
F F F F F F F F F F F
Here, column (8) & (9) are identical .
∴ p ʌ (q ʌ r) = (p ʌ q) ʌ r
Here, column (10) & (11) are identical .
∴ p v (q v r) = (p v q) v r

 Prove that ~(~p)= p by truth table .


(1) (2) (3)
p ~p ~(~p)
T F T
F T F
Here, column (1) & (3) are identical .
∴ ~(~p)= p
 Tautology:-
A statement which is always true is called tautology.
It is denoted by t.
Law of tautology:-
(i) p v t= t (ii) p ʌ t = p (iii) p v (~p) = t
(1) (2) (3) (4) (5) (6)
p t ~p pvt pʌt p v (~p)
T T F T T T
F T T T F T
Here, column (4) & (2) are identical .

p v t= t
Here, column (5) & (1) are identical .

pʌt=p
Here, column (6) & (2) are identical .
∴ p v (~p) = t
 Contradiction:-
A statement which is always false is called Contradiction.
It is denoted by c.
Law of Contradiction:-
(i) p v c = p (ii) p ʌ c = c (iii) p ʌ (~p) = c
(1) (2) (3) (4) (5) (6)
p c ~p pvc pʌc p ʌ (~p)
T F F T F F
F F T F F F
Here, column (4) & (1) are identical .
∴ pvc=p
Here, column (5) & (2) are identical .
∴ pʌc=c
Here, column (6) & (2) are identical .
∴ p ʌ (~p) = c

You might also like