LOGIC

UNIT-2

SRMIST

E. Suresh Logics 1/60

Proposition
A declarative sentence, which is true or false but not both is called
proposition or statement
Sentences which are exclamatory, interrogative or imperative in
nature are not propositions
Examples

New Delhi is capital of India

How beautiful is Rose
2+2=3
What time is it?
X+Y=Z
Take a cup of coffee

E. Suresh Logics 2/60

In the above statements (2), (4) and (6) are obviously not
proposition as they are not declarative in nature whereas (1) and
(3) are propositions. Also (5) is not Proposition, since it is neither
true nor false, as the value of X, Y and Z are not assigned
Truth Value
If a proposition is true we say that truth value of the proposition is
true and denoted by T
If a proposition is false then the truth value issaid to be false and
denoted by F
Note : Propositions are represented by P, Q, R, S,....

E. Suresh Logics 3/60

Atomic proposition
A proposition consisting of only a single propositional variable or a
single propositional constant, is called an atomic proposition or
simply proposition

Compound Proposition
A proposition obtained from the combinations of two or more
propositions by means of logical operators or connectivesis referred
as molecular or compound proposition

E. Suresh Logics 4/60

Connectives
The word and phrases used to form compound propositions are
called connectives.
There are five basic connectives called Negation, Conjunction,
Disjunction, Implication or Conditional and Equivalence or
Bi-conditional.
The following symbols are used to represent connectives

Symbol Connective Word Name

¬ not Negation
∧ and Conjunction
∨ or Disjunction
→ if...then... Implication or Conditional
↔ if and only if Bi-conditional

E. Suresh Logics 5/60

Negation
If P is any proposition then negation of P, denoted by ¬P which is
read as not P, is a proposition whose truth value is false when P is
true and true when P is false
Example : Consider the statement
Let P : Paris is in France
Then the negation of P is the statement.
¬P : It is not the case that Paris is in France
Normally it is written as
¬P : Paris is not in France
Truth Table :

P ¬P
T F
F T
E. Suresh Logics 6/60
Problems

1 Find the negation of the proposition ”All students are

intelligent”
Solution : Let P : All students are intelligent
Then negation of P is given as
¬P : It is not the case that all students are intelligent
[OR]
¬P : Some students are not intelligent
[OR]
¬P : There exist a student who is not intelligent

E. Suresh Logics 7/60

2 Find the negation of the proposition ”No student is
intelligent”
Solution : Let Q : No student is intelligent
Then the negation of Q is given as
¬Q : Some students are intelligent

E. Suresh Logics 8/60

Conjunction
If P and Q are two propositions then conjunction of P and Q is the
compound statement, denoted by P∧Q and read as ”P and Q ”
The truth value of P∧Q is true when both P and Q are true,
otherwise it is false.
Truth table for conjunction of P and Q is given as

P Q P∧Q
T T T
T F F
F T F
F F F

E. Suresh Logics 9/60

Example:
Form the conjunction of P and Q for each of the following
(i) P :Ram is healthy ; Q : He has Blue Eyes
(ii) P : It is Cold; Q : It is raining
(iii) P : 5 x + 6 = 26; Q : x > 3
Solution : Conjunction of P and Q is P∧Q
(i) P∧Q : Ram is healthy and he has blue eyes
(ii) P∧Q : It is cold and raining
(iii) P∧Q : 5 x + 6 = 26 and x > 3

E. Suresh Logics 10/60

Disjunction
If P and Q are two propositions then disjunction of P and Q is the
compound statement, denoted by P ∨ Qand read as ”P or Q”
The truth value of P ∨ Q is false when both P and Q are false,
otherwise it is true.
i.e., if atleast one of P or Q is true, then P ∨ Q is true
Truth table for disjunction of P and Q is given as

P Q P∨Q
T T T
T F T
F T T
F F F

E. Suresh Logics 11/60

Example:
Form the disjunction of P and Q for each of the following
(i) P :Arjun will go to Delhi; Q : Arjun will go to Chennai
(ii) P : It is Cold; Q : It is raining
Solution : Disjunction of P and Q is P∨Q
(i) P∨Q : Arjun will go to Delhi or Chennai
(ii) P∨Q : It is cold or raining

E. Suresh Logics 12/60

Problem :
If P : It is cold and Q : It is raining
Write simple verbal sentence which describes each of the following
statements
(i) ¬P (ii) P ∧ Q (iii) P ∨ Q (iv) P ∨ ¬Q
Solution :
(i) ¬P : It is not cold
(ii) P ∧ Q : It is cold and raining
(iii) P ∨ Q : It is cold or raining
(iv) P ∨ ¬Q : It is cold or it is not raining

E. Suresh Logics 13/60

Conditional Proposition
If P and Q are two propositions, the compound proposition ”if P
then Q”, denoted by P → Q , is called a conditional proposition or
implication.
The proposition P is called antecedent or hypothesis and the
proposition Q is called the consequent or conclusion.
The truth value of P → Q is false when P is true and Q is false
and true otherwise
Truth table :
P Q P→Q
T T T
T F F
F T T
F F T

E. Suresh Logics 14/60

The alternative terminologies used to express P → Q are the
following
(i) P implies Q
(ii) P only if Q
(iii) Q if P or Q when P
(iv) Q follows from P
(v) P is sufficient for Q

E. Suresh Logics 15/60

Example :
Form the conditional statement of P and Q for each of the
following
(i) P : Tomorrow is Sunday ; Q : Today is Saturday
(ii) P : It rains; Q : I will carry an umbrella
Solution : Conditional statement of P and Q is P → Q
(i) P → Q : If tomorrow is Sunday then today is Saturday
(ii) P → Q : If it rains then I will carry an umbrella

E. Suresh Logics 16/60

Bi-Conditional Proposition
If P and Q are two propositions, the compound proposition ”P if
and only if Q” denoted by P ↔ Q is called a bi-conditional
proposition.
The truth value of P ↔ Q is true when both P and Q have same
truth values and false otherwise.
Truth table :
P Q P↔Q
T T T
T F F
F T F
F F T

E. Suresh Logics 17/60

Problem-1 : Construct truth table for each of the following
compound proposition
(i) P ∧ (¬Q ∨ Q )
(ii) ¬(P ∨ Q ) ∨ (¬P ∧ ¬Q )
Solution : (i) Truth table for P ∧ (¬Q ∨ Q )

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

E. Suresh Logics 18/60

Solution : (ii) Truth table for ¬(P ∨ Q ) ∨ (¬P ∧ ¬Q )
Let A ≡ ¬(P ∨ Q ) ∨ (¬P ∧ ¬Q )

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

E. Suresh Logics 19/60

Problem-2 : Construct truth table for
(i) (P ∨ ¬Q ) → P
(ii) (¬(P ∧ Q ) ∨ R ) → ¬P
Solution : (i) Truth table for (P ∨ ¬Q ) → P

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

E. Suresh Logics 20/60

Solution : (ii) Truth table for (¬(P ∧ Q ) ∨ R ) → ¬P
Let A ≡ (¬(P ∧ Q ) ∨ R ) → ¬P

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

E. Suresh Logics 21/60

Problem-3 : Construct truth table for
(¬(P ∨ (Q ∧ R )) ↔ ((P ∨ Q ) ∧ (P → R ))
Solution : Let A ≡ (P ∨ (Q ∧ R )) ; B ≡ (¬(P ∨ (Q ∧ R )) and
C ≡ ((P ∨ Q ) ∧ (P → R ))
Truth table is

P Q R Q ∧R A B P ∨Q P→R C B↔C
T T T T T F T T T F
T T F F T F T F F T
T F T F T F T T T F
T F F F T F T F F T
F T T T T F T T T F
F T F F F T T T T T
F F T F F T F T F F
F F F F F T F T F F
E. Suresh Logics 22/60
Problem-4 : Construct truth table for
(i) (P ∨ Q ) → R
(ii) (P → R ) ∧ (Q → R )
Solution :(i) Truth table for (P ∨ Q ) → R is

P Q R (P ∨ Q ) (P ∨ Q ) → R
T T T T T
T T F T F
T F T T T
T F F T F
F T T T T
F T F T F
F F T F T
F F F F T

E. Suresh Logics 23/60

Solution :(ii) Truth table for (P → R ) ∧ (Q → R ) is

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

E. Suresh Logics 24/60

Converse, Contrapositive and Inverse

Let P → Q be conditional statement

Then
(i) Converse of P → Q is Q → P
(ii) Contrapositive of P → Q is ¬Q → ¬P
(iii) Inverse of P → Q is ¬P → ¬Q

E. Suresh Logics 25/60

Problem :
Find Converse, Contrapositive and Inverse for the following
conditional statement
(i) If it rains then the crops will grow
(ii) If Raja is a poet, then he is poor
(iii) Only if Ram studies well, he pass the test
Solution : (i)
Let P : It rains and Q : The crops will grow
So, P → Q : If it rains then the crops will grow
Now converse Q → P : If the crops grow then there is rain
Contrapositive ¬Q → ¬P : If the crops do not grow then there is
no rain
Inverse ¬P → ¬Q : If it does not rain then the crops will not grow

E. Suresh Logics 26/60

Solution : (ii)
Let P : Raja is a poet and Q : Raja is poor
So, P → Q : If Raja is a poet then he is poor
Now converse Q → P : If Raja is poor then he is a poet
Contrapositive ¬Q → ¬P : If Raja is not poor then he is not a
poet
Inverse ¬P → ¬Q : If Raja is not a poet then he is not poor

E. Suresh Logics 27/60

Solution : (iii)
Let P : Ram pass the test and Q : Ram studies well
So, P → Q : If Ram pass the test then he studies well
Now converse Q → P : If Ram studies well then he pass the test
Contrapositive ¬Q → ¬P : If Ram does not study well then he
will not pass the test
Inverse ¬P → ¬Q : If Ram does not pass the test then he will not
study well

E. Suresh Logics 28/60

Tautology
A statement that is true for all possible values of its propositional
variables is called a tautology or universely valid formula or a
logical truth

Contradiction
A statement that is always false is called a contradiction or
absurdity

Note : If a proposition is neither a tautology nor a contradiction, it

is called a contingency

E. Suresh Logics 29/60

Equivalences of Propositions

Two compound propositions A and B are said to be logically

equivalent or simply equivalent, if they have identical truth values
i.e., if the truth value of A is equal to the truth value of B for
every one of the 2n possible sets of truth values
It is denoted as A ≡ B

Note : A ≡ B if and only if A ↔ B is a tautology

E. Suresh Logics 30/60

Tautological Implications

A compound proposition A is said to tautologically imply or simply

imply the compound proposition B, if and only if, A → B is a
tautology.
This is denoted by A ⇒ B, read as A implies B

E. Suresh Logics 31/60

Problems

1 Determine which of the following compound proposition are

tautologies and which of them are contradiction, using truth
tables
(i) (¬Q ∧ (P → Q )) → ¬P
(ii) ((P → Q ) ∧ (Q → R )) → (P → R )
(iii) ¬(Q → R ) ∧ R ∧ (P → Q )

E. Suresh Logics 32/60

Solution :(i) Truth table for (¬Q ∧ (P → Q )) → ¬P
Let A ≡ (¬Q ∧ (P → Q )) → ¬P

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

∴ (¬Q ∧ (P → Q )) → ¬P is a tautology

E. Suresh Logics 33/60

Solution : (ii) Truth table for
((P → Q ) ∧ (Q → R )) → (P → R )
Let A ≡ ((P → Q ) ∧ (Q → R )) and
B ≡ ((P → Q ) ∧ (Q → R )) → (P → R ) ≡ A → (P → R )

P Q R P→Q Q→R A P→R B

T T T T T T T T
T T F T F F F T
T F T F T F T T
T F F F T F F T
F T T T T T T T
F T F T F F T T
F F T T T T T T
F F F T T T T T

E. Suresh Logics 34/60

∴ ((P → Q ) ∧ (Q → R )) → (P → R ) is a tautology

E. Suresh Logics 35/60

Solution : (iii) Truth table for ¬(Q → R ) ∧ R ∧ (P → Q )
Let A ≡ ¬(Q → R ) ∧ R

P Q R P→Q Q→R ¬(Q → R ) A A ∧ (P → Q )

T T T T T F F F
T T F T F T F F
T F T F T F F F
T F F F T F F F
F T T T T F F F
F T F T F T F F
F F T T T F F F
F F F T T F F F
∴ ¬(Q → R ) ∧ R ∧ (P → Q ) is a contradiction

E. Suresh Logics 36/60

2 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

E. Suresh Logics 37/60

(P → Q ) ↔ (¬P ∨ Q ) is a tautology
⇒ P → Q and ¬P ∨ Q are logically equivalent
∴ P → Q ≡ ¬P ∨ Q

E. Suresh Logics 38/60

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

E. Suresh Logics 39/60

EQUIVALENCES INVOLVING CONDITIONAL

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

E. Suresh Logics 40/60

EQUIVALENCES INVOLVING BI-CONDITIONAL

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

E. Suresh Logics 41/60

1 Without using truth tables, prove the following
(i) (¬P ∨ Q ) ∧ (P ∧ (P ∧ Q )) ≡ P ∧ Q
(ii) P → (Q → P ) ≡ ¬P → (P → Q )
(iii)
¬(P ↔ Q ) ≡ (P ∨ Q ) ∧ ¬(P ∨ Q ) ≡ (P ∧ ¬Q ) ∨ (¬P ∧ Q )

E. Suresh Logics 42/60

Solution : (i)

LHS ≡ (¬P ∨ Q ) ∧ (P ∧ (P ∧ Q ))
≡ (¬P ∨ Q ) ∧ ((P ∧ P ) ∨ Q ) [By Associative]
≡ (¬P ∨ Q ) ∧ (P ∧ Q ) [By idempotent]
≡ (P ∧ Q ) ∧ (¬P ∨ Q ) [By commutative]
≡ ((P ∧ Q ) ∧ ¬P ) ∨ ((P ∧ Q ) ∧ Q ) [By distributive]
≡ (P ∧ Q ∧ ¬P ) ∨ (P ∧ Q ∧ Q ) [By commutative]
≡ ((P ∧ ¬P ) ∧ Q ) ∨ (P ∧ (Q ∧ Q )) [By associative]
≡ (F ∧ Q ) ∨ (P ∧ Q ) [By complement & idempotent]
≡ F ∨ (P ∧ Q ) [By dominant]
≡ P ∧Q [By dominant]

E. Suresh Logics 43/60

 ≡ RHS

Therefore (¬P ∨ Q ) ∧ (P ∧ (P ∧ Q )) ≡ P ∧ Q

E. Suresh Logics 44/60

Solution :(ii)
To prove : P → (Q → P ) ≡ ¬P → (P → Q )

LHS ≡ P → (Q → P )
≡ ¬P ∨ (Q → P ) [P → Q ≡ ¬P ∨ Q ]
≡ ¬P ∨ (¬Q ∨ P )
≡ ¬P ∨ (P ∨ ¬Q )
≡ (¬P ∨ P ) ∨ ¬Q
≡ (T ) ∨ ¬Q
≡T − − − −− > (1)

E. Suresh Logics 45/60

 RHS ≡ ¬P → (P → Q )
≡ P ∨ (P → Q ) [P → Q ≡ ¬P ∨ Q ]
≡ P ∨ (¬P ∨ Q )
≡ (P ∨ ¬P ) ∨ Q
≡ T ∨Q
≡T − − − −− > (2)

From eqn (1) and (2), we have LHS ≡ RHS

Therefore P → (Q → P ) ≡ ¬P → (P → Q )

E. Suresh Logics 46/60

Solution : (iii)
Let A ≡ ¬(P ↔ Q )
B ≡ (P ∨ Q ) ∧ ¬(P ∧ Q )
C ≡ (P ∧ ¬Q ) ∨ (¬P ∧ Q )
To prove : A ≡ B ≡ C
First we prove A ≡ B
i.e., to prove ¬(P ↔ Q ) ≡ (P ∨ Q ) ∧ ¬(P ∧ Q )

E. Suresh Logics 47/60

LHS ≡ ¬(P ↔ Q )
≡ ¬[(P → Q ) ∧ (Q → P )]
≡ ¬[(¬P ∨ Q ) ∧ (¬Q ∨ P )]
≡ ¬[((¬P ∨ Q ) ∧ ¬Q ) ∨ ((¬P ∨ Q ) ∧ P )]
≡ ¬[(¬P ∧ ¬Q ) ∨ (Q ∧ ¬Q ) ∨ (¬P ∧ P ) ∨ (Q ∧ P )]
≡ ¬[(¬P ∧ ¬Q ) ∨ F ∨ F ∨ (P ∧ Q )]
≡ ¬[(¬P ∧ ¬Q ) ∨ (P ∧ Q )] [By P ∨ F ≡ P ]
≡ ¬[¬(P ∨ Q ) ∨ (P ∧ Q )]
≡ (P ∨ Q ) ∧ ¬(P ∧ Q ) ≡ RHS

E. Suresh Logics 48/60

Next we prove B ≡ C
i.e., to prove (P ∨ Q ) ∧ ¬(P ∧ Q ) ≡ (P ∧ ¬Q ) ∨ (¬P ∧ Q )

LHS ≡ (P ∨ Q ) ∧ ¬(P ∧ Q )
≡ (P ∨ Q ) ∧ (¬P ∨ ¬Q )
≡ [(P ∨ Q ) ∧ ¬P ] ∨ [(P ∨ Q ) ∧ ¬Q ]
≡ [(P ∧ ¬P ) ∨ (Q ∧ ¬P )] ∨ [(P ∧ ¬Q ) ∨ (Q ∧¬Q )]
≡ [(F ) ∨ (Q ∧ ¬P )] ∨ [(P ∧ ¬Q ) ∨ (F )]
≡ [(Q ∧ ¬P )] ∨ [(P ∧ ¬Q )]
≡ (Q ∧ ¬P ) ∨ (P ∧ ¬Q )
≡ (¬P ∧ Q ) ∨ (P ∧ ¬Q )
≡ (P ∧ ¬Q ) ∨ (¬P ∧ Q ) ≡ RHS

E. Suresh Logics 49/60

Therefore A ≡ B ≡ C
Hence
¬(P ↔ Q ) ≡ (P ∨ Q ) ∧ ¬(P ∧ Q ) ≡ (P ∧ ¬Q ) ∨ (¬P ∧ Q )

E. Suresh Logics 50/60

2 Without using truth tables, prove the following
(i) ¬P → (Q → R ) ≡ Q → (P ∨ R )
(ii) P → (Q → R ) ≡ P → (¬Q ∨ R ) ≡ (P ∧ Q ) → R
(iii) ¬((¬P ∧ Q ) ∨ (¬P ∧ ¬Q )) ∨ (P ∧ Q ) ≡ P
(iv) (P ∨ Q ) → R ≡ (P → R ) ∧ (Q → R )
(v) (P ∧ (P ↔ Q )) → Q ≡ T

E. Suresh Logics 51/60

Solution : (i)
To prove : ¬P → (Q → R ) ≡ Q → (P ∨ R )

LHS ≡ ¬P → (Q → R )
≡ P ∨ (Q → R ) [P → Q ≡ ¬P ∨ Q ]
≡ P ∨ (¬Q ∨ R )
≡ (P ∨ ¬Q ) ∨ R
≡ ¬Q ∨ P ∨ R
≡ ¬Q ∨ (P ∨ R )
≡ Q → (P ∨ R )
≡ RHS

E. Suresh Logics 52/60

Solution : (ii)
To prove :
P → (Q → R ) ≡ P → (¬Q ∨ R ) ≡ (P ∧ Q ) → R

LHS ≡ P → (Q → R )
≡ P → (¬Q ∨ R ) [P → Q ≡ ¬P ∨ Q ]
≡ ¬P ∨ (¬Q ∨ R )
≡ (¬P ∨ ¬Q ) ∨ R
≡ ¬(P ∧ Q ) ∨ R
≡ (P ∧ Q ) → R
≡ RHS

E. Suresh Logics 53/60

Solution : (iii)
To prove : ¬((¬P ∧ Q ) ∨ (¬P ∧ ¬Q )) ∨ (P ∧ Q ) ≡ P

LHS ≡ ¬[(¬P ∧ Q ) ∨ (¬P ∧ ¬Q )] ∨ (P ∧ Q )

≡ ¬[¬P ∧ (Q ∨ ¬Q )] ∨ (P ∧ Q )
≡ [P ∨ ¬(Q ∨ ¬Q )] ∨ (P ∧ Q )
≡ [P ∨ (¬Q ∧ Q )] ∨ (P ∧ Q )
≡ [P ∨ F ] ∨ (P ∧ Q )
≡ P ∨ (P ∧ Q )
≡P [By Absorption law]
≡ RHS

E. Suresh Logics 54/60

Solution : (iv)
To prove : (P ∨ Q ) → R ≡ (P → R ) ∧ (Q → R )

LHS ≡ (P ∨ Q ) → R
≡ ¬(P ∨ Q ) ∨ R [P → Q ≡ ¬P ∨ Q ]
≡ (¬P ∧ ¬Q ) ∨ R
≡ (¬P ∨ R ) ∧ (¬Q ∨ R )
≡ (P → R ) ∧ (Q → R )
≡ RHS

E. Suresh Logics 55/60

Solution : (v)
To prove : (P ∧ (P ↔ Q )) → Q ≡ T

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

E. Suresh Logics 56/60

≡ ¬[F ∨ (P ∧ Q )] ∨ Q
≡ ¬[P ∧ Q ] ∨ Q
≡ (¬P ∨ ¬Q ) ∨ Q
≡ ¬P ∨ (Q ∨ ¬Q )
≡ ¬P ∨ (T )
≡T
≡ RHS

E. Suresh Logics 57/60

3 Prove (¬P ∧ (¬Q ∧ R )) ∨ (Q ∧ R ) ∨ (P ∧ R ) ≡ R without
using truth tables
Solution : To prove :
(¬P ∧ (¬Q ∧ R )) ∨ (Q ∧ R ) ∨ (P ∧ R ) ≡ R

LHS ≡ (¬P ∧ (¬Q ∧ R )) ∨ (Q ∧ R ) ∨ (P ∧ R )

≡ [(¬P ∧ ¬Q ) ∧ R ] ∨ [(Q ∧ R ) ∨ (P ∧ R )] [By Associative]
≡ [¬(P ∨ Q ) ∧ R ] ∨ [(Q ∨ P ) ∧ R ] [By De Morgan’s]
≡ [¬(P ∨ Q ) ∧ R ] ∨ [(P ∨ Q ) ∧ R ] [By commutative]
≡ [¬(P ∨ Q ) ∨ (P ∨ Q )] ∧ R [By Distributive]
≡ T ∧R [By Complement]
≡R [By Identity]
≡ RHS

E. Suresh Logics 58/60

Problem-4 :Prove
((P ∨ Q ) ∧ ¬(¬P ∧ (¬Q ∨ ¬R ))) ∨ (¬P ∧ ¬Q ) ∨ (¬P ∧ ¬R ) is
a tautology
Solution : To prove :
((P ∨ Q ) ∧ ¬(¬P ∧ (¬Q ∨ ¬R ))) ∨ (¬P ∧ ¬Q ) ∨ (¬P ∧ ¬R ) is
a tautology
i.e., to prove
((P ∨ Q ) ∧ ¬(¬P ∧ (¬Q ∨ ¬R ))) ∨ (¬P ∧ ¬Q ) ∨ (¬P ∧ ¬R ) ≡ T

LHS ≡ ((P ∨ Q ) ∧ ¬(¬P ∧ (¬Q ∨ ¬R ))) ∨ (¬P ∧ ¬Q ) ∨ (¬P ∧ ¬R )

≡ [(P ∨ Q ) ∧ ¬(¬P ∧ ¬(Q ∧ R ))] ∨ [¬(P ∨ Q ) ∨ ¬(P ∨ R )]
≡ [(P ∨ Q ) ∧ (P ∨ (Q ∧ R ))] ∨ ¬[(P ∨ Q ) ∧ (P ∨ R )]
≡ [(P ∨ Q ) ∧ ((P ∨ Q ) ∧ (P ∨ R ))] ∨ ¬[(P ∨ Q ) ∧ (P ∨ R )]
≡ [((P ∨ Q ) ∧ (P ∨ Q )) ∧ (P ∨ R )] ∨ ¬[(P ∨ Q ) ∧ (P ∨ R )]
E. Suresh Logics 59/60
 ≡ [((P ∨ Q ) ∧ (P ∨ R )] ∨ ¬[(P ∨ Q ) ∧ (P ∨ R )] ≡ T

Hence
((P ∨ Q ) ∧ ¬(¬P ∧ (¬Q ∨ ¬R ))) ∨ (¬P ∧ ¬Q ) ∨ (¬P ∧ ¬R ) is
a tautology

E. Suresh Logics 60/60