Professional Documents
Culture Documents
Unit 3
Unit 3
MATHEMATICS
E. Suresh
Dept. of Mathematics
SRMIST
P Q P∧Q
T T T
T F F
F T F
F F F
P Q P∨Q
T T T
T F T
F T T
F F F
P Q P→Q
T T T
T F F
F T T
F F T
P Q ¬Q ¬Q ∨ Q P ∧ (¬Q ∨ Q)
T T F T T
T F T T T
F T F T F
F F T T F
P Q ¬P ¬Q P∨ Q ¬ ( P∨ Q) (¬ P ∧¬ Q) A
T T F F T F F F
T F F T T F F F
F T T F T F F F
F F T T F T T T
P Q ¬Q P ∨ ¬Q (P ∨ ¬Q) → P
T T F T T
T F T T T
F T F F T
F F T T F
P Q R ¬P P ∧ Q ¬(P ∧ Q) ¬(P ∧ Q) ∨ R A
T T T F T F T F
T T F F T F F T
T F T F F T T F
T F F F F T T F
F T T T F T T T
F T F T F T T T
F F T T F T T T
F F F T F T T T
P Q R (P → Q) (Q → R) (P → R) ∧ (Q → R)
T T T T T T
T T F F F F
T F T T T T
T F F F T F
F T T T T T
F T F T F F
F F T T T T
F F F T T T
Contradiction
Contradiction
A statement that is always false is called a contradiction
or absurdity
Contradiction
A statement that is always false is called a contradiction
or absurdity
P Q ¬P ¬Q P → Q ¬Q ∧ (P → Q) A
T T F F T F T
T F F T F F T
F T T F T F T
F F T T T T T
P Q ¬P (P → Q) ¬P ∨ Q (P → Q) ↔ (¬P ∨ Q)
T T F T T T
T F F F F T
F T T T T T
F F T T T T
(P → Q) ↔ (¬P ∨ Q) is a tautology
18MAB302T- DM Unit - 1 35/180
1 Show that the propositions P → Q and ¬P ∨ Q are
logically equivalent
Solution : To prove that : P → Q and ¬P ∨ Q are
logically equivalent
It is enough to prove that (P → Q) ↔ (¬P ∨ Q) is a
tautology
P Q ¬P (P → Q) ¬P ∨ Q (P → Q) ↔ (¬P ∨ Q)
T T F T T T
T F F F F T
F T T T T T
F F T T T T
(P → Q) ↔ (¬P ∨ Q) is a tautology
⇒ P → Q and18MAB302T-
¬P ∨ QDMare Unit
logically
-1
equivalent
35/180
IMPORTANT LOGICAL EQUIVALENCE
S.No Law
1 Idempotent P∨P ≡ P P∧P ≡ P
2 Identity P∨F ≡ P P∧T ≡ P
3 Dominant P∨T ≡ T P∧F ≡ F
4 Complement P ∨ ¬P ≡ T P ∧ ¬P ≡ F
5 Commutative P∨Q ≡ Q∨P P∧Q ≡ Q∧P
6 Associative (P ∨ Q) ∨ R ≡ P ∨ (Q ∨ R) (P ∧ Q) ∧ R ≡ P ∧ (Q ∧ R)
7 Distributive P ∨ (Q ∧ R) ≡ (P ∨ Q) ∧ (P ∨ R) P ∧ (Q ∨ R) ≡ (P ∧ Q) ∨ (P ∧ R)
8 Absorption P ∨ (P ∧ Q) ≡ P P ∧ (P ∨ Q) ≡ P
9 De Morgans ¬(P ∨ Q) ≡ ¬P ∧ ¬Q ¬(P ∧ Q) ≡ ¬P ∨ ¬Q
S.No Formula
1 P → Q ≡ ¬P ∨ Q
2 P → Q ≡ ¬Q → ¬P
3 P∨Q ≡ P → Q
4 P ∧ Q ≡ ¬(P → ¬Q)
5 ¬(P → Q) ≡ P ∧ ¬Q
6 (P → Q) ∧ (P → R) ≡ P → (Q ∧ R)
7 (P → Q) ∨ (P → R) ≡ P → (Q ∨ R)
8 (P → R) ∧ (Q → R) ≡ (P ∨ Q) → R
9 (P → R) ∨ (Q → R) ≡ (P ∧ Q) → R
S.No Formula
1 P ↔ Q ≡ (P → Q) ∧ (Q → P)
2 P ↔ Q ≡ ¬P ↔ ¬Q
3 P ↔ Q ≡ (P ∧ Q) ∨ (¬P ∧ ¬Q)
4 ¬(P ↔ Q) ≡ P ↔ ¬Q
LHS ≡ (P ∧ (P ↔ Q)) → Q
≡ ¬[P ∧ (P ↔ Q)] ∨ Q [P → Q ≡ ¬P ∨ Q]
≡ ¬[P ∧ ((P → Q) ∧ (Q → P))] ∨ Q
≡ ¬[(P ∧ (¬P ∨ Q)) ∧ (¬Q ∨ P)] ∨ Q
≡ ¬[((P ∧ ¬P) ∨ (P ∧ Q)) ∧ (¬Q ∨ P)] ∨ Q
≡ ¬[((F) ∨ (P ∧ Q)) ∧ (¬Q ∨ P)] ∨ Q
≡ ¬[(P ∧ Q) ∧ (¬Q ∨ P)] ∨ Q
≡ ¬[((P ∧ Q) ∧ ¬Q) ∨ ((P ∧ Q) ∧ P)] ∨ Q
≡ ¬[(P ∧ F) ∨ (P ∧ Q)] ∨ Q
Hence
((P ∨ Q) ∧ ¬(¬P ∧ (¬Q ∨ ¬R))) ∨ (¬P ∧ ¬Q) ∨ (¬P ∧ ¬R)
is a tautology
Rule T :
A formula S may be introduced in a derivation, if S is
tautologically implied by one or more preceding formulas
in the derivation
Rule CP:
If a formula S can be derived from another formula R and
a set of premises, then the statement R → S can be
derived from the set of premises alone.
Note : P → Q ≡ ¬P ∨ Q and P → Q ≡ ¬Q → ¬P
PROBLEMS
1 Show that the premises P → Q, R → ¬Q and R lead
to the conclusion ¬P
Solution : Premises are P → Q, R → ¬Q and R
Conclusion is ¬P
⇒ ¬P is true.
Hence, if n3 + 5 is odd then n is an even integer