Mathematical Reasoning 457

17
Mathematical
Reasoning
TOPIC 1 Ans. (c) Hence, (A) is true.
Logical Statement Let p:The match will be played For (B), statements pand qare as
follows,
q :weather is good
p: 5 + 3 = 8
01 Which of the following is the r:ground is not wet
q: Earth is flat
negation of the statement “for all ~ [p → (q ∧ r)] = p ∧ ~ (q ∧ r) = p ∧ (~ q ∨ ~ r)
Here, pis true andqis false.
M > 0, there exists x ∈ S such that The match will be played and weather is
∴ p → q is false.
not good or ground is wet.
x ≥ M” ? [2021, 27 July Shift-II]
Hence, (b) is false.
(a) there exists M > 0, such that x < M for
all x ∈ S
03 Consider the following three For (c), statements pand qare as
statements, follows,
(b) there exists M > 0, there exists x ∈ S
such that x ≥ M (A) If 3 + 3 = 7, then4 + 3 = 8 p:Both (A) and (B) are true.
(c) there exists M > 0, there exists x ∈ S (B) If 5 + 3 = 8, then earth is flat q: 5 + 6 = 17
such that x < M (C) If both (A) and (B) are true, then Here ‘p’ is false because (B) is not true,
(d) there exists M > 0, such that x ≥ M for 5 + 6 = 17 then
all x ∈ S Then, which of the following p → q is true.
Ans. (a) statements is correct Hence, (c) is true.
Let P : for all M > 0, there exists x ∈ S such [2021, 20 July Shift II]
that x ≥ M (a) (A) is false, but (B) and (C) are true 04 The contrapositive of the
~ P : there exists M > 0, for all x ∈ S (b) (A) and (C) are true while (B) is false statement; "If you will work, you will
such that x < M (c) (A) is true while (B) and (C) are false earn money" is
(Qnegation of ‘there exists’ is ‘for all’) (d) (A) and (B) are false while (C) is true [2021, 25 Feb. Shift-II]
Ans. (b) (a) to earn money, you need to work
02 Consider the statement "The match To solve this, let’s construct a truth (b) you will earn money, if you will not
will be played only if the weather is table for p → q work
good and ground is not wet". (c) if you will not earn money, you will
p q p→ q
not work
Select the correct negation from T T T (d) if you will earn money, you will work
the following [2021, 25 July Shift-II] T F F
(a) The match will not be played and
Ans. (c)
weather is not good and ground is F T T Contrapositive of p → q is ~ q →~ p
wet. F F T p: you will work
(b) If the match will not be played, then ⇒~ p : you will not work
For (A), statements pand qare as
either weather is not good or ground
follows, q: you will earn money
is wet.
(c) The match will be played and weather p:3 + 3 = 7 ⇒~ q: you will not earn money
is not good or ground is wet. q:4 + 3 = 8 Then,
(d) The match will not be played or Since, pis false, then ~ q → ~ p : if you will not earn money,
weather is good and ground is not wet. p → q is true. you will not work.
05 The contrapositive of the
statement “If I reach the station in
time, then I will catch the train” is
[2020, 2 Sep. Shift-I]
(a) If I do not reach the station in time,
then I will catch the train
(b) If I will not catch the train, then I do
not reach the station in time
(c) If I do not reach the station in time,
then I will not catch the train
(d) If I will catch the train, then I reach
the station in time
Ans. (b)
Let the statements
p : I reach the station is time.
q : I will catch the train.
As we know contrapositive of
p ⇒ q ≡ (~ q) ⇒ (~ p)
So contrapositive of given statement, “If
I reach the station in time, then I will
catch the train” is “If I will not catch the
train, then I do not reach the station in
time”.
06 Contrapositive of the statement
‘If a function f is differentiable at
a, then it is also continuous at a’, is
[2020, 4 Sep. Shift-II]
(a) If a function f is not continuous at a,
then it is differentiable ata
(b) If a function f is continuous at a, then
it is differentiable ata
(c) If a function f is continuous at a, then
it is not differentiable ata
(d) If a function f is not continuous at a,
then it is not differentiable ata
Ans. (d)
As the contrapositive of statement
p → q is ~ q →~ p
∴ Contrapositive of statement ‘If a
function f is differentiable ata, then it is
also continuous at a’ is if a functionf is
not continuous at a, then it is not
differentiable ata.
07 Consider the statement “For an
integer n if n 3 − 1 is even, then n is
odd”. The contrapositive statement
of this statement is
[2020, 6 Sep. Shift-II]
(a) For an integer n, if n is even, then
n3 − 1 is odd
(b) For an integer n, if n3 − 1 is not even,
then n is not odd
(c) For an integer n, if n is even, then
n3 − 1 is even
(d) For an integer n, if n is odd, then n3 − 1
is even
Ans. (a)
The contrapositive of statement p→q is
~ q → ~ p.
So, the contrapositive statement of
given statement “For an integer n, if
n3 − 1 is even, then n is odd”, is “For an
integer n, if n is even, then n3 − 1 is odd”.
08 Let A, B, C and D be four non-empty
sets. The contrapositive statement
of “If A ⊆ B and B ⊆ D, then A ⊆ C ” is
[2020, 7 Jan. Shift-II]
(a) If A ⊆
/ C, then A ⊆
/ B or B ⊆
/D
(b) If A ⊆ C, then B ⊂ A or D ⊂ B
(c) If A ⊆
/ C, then A ⊆
/ B or B ⊆ D
(d) If A ⊆
/ C, then A ⊆ B or B ⊆ D
Ans. (a)
The contrapositive statement of
statement
(p ∧ q) → r is (~ r) → ~ (p ∧ q)
= (~ r) → (~ p ∨ ~ q) [from De-Morgan’s
law]
So, contrapositive statement of ‘‘If A ⊆ B
and B ⊆ D, then A ⊆ C’’ is
‘‘If A ⊆/ C, then A ⊆/ B or B ⊆ D’’
09 Negation of the statement :
5 is an integer or 5 is an irrational
is [2020, 9 Jan. Shift-I]
(a) 5 is irrational or 5 is an integer
(b) 5 is not an integer or 5 is not
irrational
(c) 5 is an integer and 5 is irrational
(d) 5 is not an integer and 5 is not
irrational
Ans. (d)
Since,~ (p ∨q) = (~ p) ∧ (~ q)
So, negation of the statement
‘ 5 is an integer and 5 is not irrational’.
Is 5 is not an integer and 5 is not
irrational?
Hence, option (d) is correct.
10 The contrapositive of the
statement ‘‘If you are born in India,
then you are a citizen of India’’, is
[2019, 8 April Shift-I]
(a) If you are not a citizen of India, then
you are not born in India.
(b) If you are a citizen of India, then you
are born in India.
(c) If you are born in India, then you are
not a citizen of India.
(d) If you are not born in India, then you
are not a citizen of India.
Ans. (a)
Given statement is ‘‘If you are born in
India, then you are a citizen of India’’.
Now, let statement p : you are born in
India
and q : you are citizen of India.
Then, given statement, ‘‘If you are born in
India then you are a citizen of India’’ is
equivalent to p ⇒q.
QThe contrapositive of statement p ⇒ q
is ~ q ⇒ ~ p.
∴ The contrapositive of the given
statement is ‘‘If you are not a citizen of
India, then you are not born in India.
11 Contrapositive of the statement “If
two numbers are not equal, then
their squares are not equal” is
[2019, 11 Jan. Shift-II]
(a) If the squares of two numbers are
not equal, then the numbers are not
equal.
(b) If the squares of two numbers are
equal, then the numbers are equal.
(c) If the squares of two numbers are
not equal, then the numbers are
equal.
(d) If the squares of two numbers are
equal, then the numbers are not
equal.
Ans. (b)
We know that, contrapositive of
p → q is ~q → ~p
Therefore, the contrapositive of the
given statement is
‘‘If the squares of two numbers are equal,
then the numbers are equal’’.
12 The negation of the statement
“If I become a teacher, then I will
open a school”, is [AIEEE 2012]
(a) I will become a teacher and I will not
open a school
(b) Either I will not become a teacher or I
will not open a school
(c) Neither I will become a teacher nor I
will open a school
(d) I will not become a teacher or I will
open a school
Ans. (a)
Let us assume that p:‘I become a
teacher’ and q :I will open a school.
Then, we can easily as certain that
Negation of (p → q) is ~ (p → q) = p ∧ ~ q
which means that ‘I will become a
teacher and I will not open a school’.
13 Consider the following statements TOPIC 2
P : Suman is brilliant. Q : Suman is rich. Logical Connectives
R : Suman is honest.
The negation of the statement. “Suman is brilliant and
16 Which of the following is equivalent to the Boolean
dishonest, if and only if Suman is rich” can be
expressed as [AIEEE 2011]
expression p ∧~ q ? [2021, 01 Sep. Shift-II]
(a) ~ [Q ↔ ( P ∧ ~ R )] (b) ~ Q ↔ P ∧ R (a) ~ (q → p) (b) ~ p → ~ q
(c) ~ (P ∧ ~ R) ↔ Q (d) ~ P ∧ (Q ↔ ~ R) (c) ~ ( p → ~ q) (d) ~ ( p → q)
Ans. (a) Ans. (d)
Suman is brilliant and dishonest if and only if Suman is rich, is ~ (p → q)
expressed as, Q ↔ (P ∧ ~ R) ⇒ ~ (~ p ∨q)
So, negation of it will be, ~ [Q ↔ (P ∧ ~ R)]. ⇒ p∧ ~ q

14 Let S be a non-empty subset of R. Consider the following 17 Let *, , ∈ {∧, ∨} be such that the Boolean expression
statement P : There is a rational number x ∈ S such that (p * ~ q) ⇒ (p q) is a tautology. Then [2021, 31 Aug. Shift-I]
x > 0. (a) * = ∨, = ∨
Which of the following statements is the negation of (b) * = ∧, = ∧
the statement P ? [AIEEE 2010] (c) * = ∧, = ∨
(a) There is a rational number x ∈ S such that x ≤ 0 (d) * = ∨, = ∧
(b) There is no rational number x ∈ S such that x ≤ 0 Ans. (c)
(c) Every rational number x ∈ S satisfies x ≤ 0
(d) x ∈ S and x ≤ 0 ⇒ x is not rational p q ~q p∧~q p∨ q (p ∧ ~ q)→ (p ∨ q)
Ans. (c) T T F F T T
P : There is rational number x ∈ S such that x > 0. ~ P : Every T F T T T T
rational number x ∈ S satisfies x ≤ 0. F T F F T T
F F T F F T
15 Let p be the statement “x is an irrational number”, q be the
∴(p∧ ~ q) → (p ∨q) is tautology.
statement “y is a transcendental number” and r be the
statement “x is a rational number, iff y is a transcendental 18 Negation of the statement (p ∨ q) ⇒ (q ∨ r) is
number”.
[2021, 31 Aug. Shift-II]
Statement I r is equivalent to either q or p. (a) p ∧ ~ q ∧ ~ r
Statement II r is equivalent to ~ (p ↔ ~ q). [AIEEE 2008] (b) ~ p ∧ q ∧ ~ r
(a) Statement I is false, Statement II is true (c) ~ p ∧ q ∧ r
(b) Statement I is true, Statement II is true; Statement II is a
(d) p ∧q ∧ r
correct explanation for Statement I
(c) Statement I is true, Statement II is true; Ans. (a)
Statement II is not a correct explanation for Statement I Negative of (p ∨ r) ⇒(q ∨ r)
(d) Statement I is true, Statement II is false ≡ ~ ((p ∨r) ⇒(q ∨r))
Ans. (∗) ≡ (p ∨r) ∧ (~ (q ∨r))
Here, p : x is an irrational number,q : y is a transcendental number ≡ (p ∨r) ∧ (~ q ∧ ~ r)
r : x is a rational number, iff y is a transcendental number ⇒ ≡ (p ∨r) ∧ ~ r) ∧ ~ q
r :~ p ↔ q ≡ ((p ∧ ~ r)) ∨ (r ∧ ~ r) ∧ ~ q
But S 1 : r ≡ q ∨ p, so statement I is not correct. And ≡ (p ∧ ~ r) ∧f) ∧ ~ q
S2 : r ≡ ~ (p ↔~ q) ≡ (p ∧ ~ r) ∧ (~ q)
p q~ p ~ q r~p ↔ q Statement I Statement II ≡ p ∧~q ∧~r
q∨ p (p ↔~ q) ~ (p ↔~ q)
19 The statement (p ∧ (p → q) ∧ (q → r)) → r is
T T F F F T F T
T F F T T T T F [2021, 27 Aug. Shift-I]
F T T F T T T F (a) a tautology
F F T T F F F T (b) equivalent to p → ~ r
(c) a fallacy
It is clear from the table that r is not equivalent to either of the
(d) equivalent toq →~ r
statements. Hence, none of the given options is correct.
 Ans. (a) Ans. (c)
Taking True = 1, False = 0 S 1 : (~ p ∨q) ∨ (q ∨ p) = (q ∨ ~ p) ∨ (q ∨ p)
(1) (2) (3) (4) (5) (6) (7) S 1 = q ∨ (~ p ∨ p) = q ∨ (true)
p q r p→ q q→ r (1) ∧ (4) ∧ (5) (6) → (3)
S 1 = (Always true)
0 0 0 1 1 0 1 S2 : (p∧ ~ q) ∧ (~ p ∨q)
0 0 1 1 1 0 1 = (p∧ ~ q) ∧ (p∧ ~ q) = fallacy
0 1 0 1 0 0 1
0 1 1 1 1 0 1 23 The compound statement (P ∨ Q) ∧ (~ P) ⇒ Q is equivalent
1 0 0 0 1 0 1 to [2021, 27 July Shift-I]
1 0 1 0 1 0 1 (a) P ∨ Q (b) P ∧ ~ Q
1 1 0 1 0 0 1 (c) ~ (P ⇒ Q) (d) ~ (P ⇒ Q) ⇔ P ∧ ~ Q
1 1 1 1 1 1 1
Ans. (d)
Column (7) gives true (1) in each case. (P ∨ Q ) ∧ (~ P) → Q
Hence, ( p∧ ( p →q) ∧ ( q→r )) →r is a tautology. (P ∧ ~ P) ∨ (Q ∧ ~ P) → Q
where P ∧ ~ P ≡ F
20 The Boolean expression (p ∧ q) ⇒ ((r ∧ q) ∧ p) is As, we already know, if first statement is false, then the ‘QR’ with
equivalent to [2021, 27 Aug. Shift-II] second statement is second statement only.
(a) ( p ∧ q) ⇒(r ∧ q) (b) (q ∧ r) ⇒( p ∧ q) So, (P ∧ ~ P) ∨ (Q ∧ ~ P) → Q
(c) ( p ∧ q) ⇒( tr ∨ q) (d) ( p ∧ r) ⇒( p ∧ q) ⇒ (Q ∧ ~ P) → Q
Ans. (a) Now, if A → B, then~ A ∨B
Given, (p ∧q) ⇒ ((r ∧ q) ∧ p) So, ~ (Q ∧ ~ P) ∨ Q
⇔~ (p ∧q) ∨ ((r ∧q) ∧ p) ⇒ (~ Q ∨ P) ∨ Q
⇔~ (p ∧ q) ∨ ((r ∧q) ∧ (p ∧q)) ⇒ (~ Q ∨ Q) ∨ P
⇔ [~ (p ∧q) ∨ (p ∧q)] ∧ [~ (p ∧q) ∨ (r ∧q)] Where ~ Q ∨ Q ≡T
⇔ t ∧ [~ (p ∧q) ∨ (r ∧q)] ⇒Always true
⇔~ (p ∧q) ∨ (r ∧q) Now, let’s check options,
⇔ (p ∧q) ⇒(r ∧q) (a) P ∨ Q → If P is false, Q is false, thenP ∨ Q is also false.
So, (a) is wrong.
21 If the truth value of the Boolean expression (b) If P is false, Q is false. Then,~ Q is true
((p ∨ q) ∧ (q → r) ∧ (~ r) → (p ∧ q) is false, then the truth and P ∧ ~ Q is again false.
values of the statements, p,q and r respectively can be So, (b) is also wrong.
[2021, 26 Aug. Shift-I] (c) If P is false, Q is false, thenP → Q is true and
(a) T F T (b) F F T ~ (P → Q) is false.
(c) T F F (d) F T F Hence, (c) is also wrong.
Ans. (c) (d) Will be true in all cases.

p q r p∨ q q→ r ~r X p∧q Y
24 The Boolean expression
(A) T F T T T F F F T (p ⇒ q) ∧ (q ⇒~ p) is equivalent to [2021, 25 July Shift-I]
(B) F F T F T F F F T (a) ~q (b) q
(c) p (d) ~ p
(C) T F F T T T T F F
Ans. (d)
(D) F T F T F T F F T
(p → q) ∧ (q →~ p)
X = (p ∨q) ∧ (q → r) ∧ (~ r) (~ p ∨ q) ∧ (~ q ∨ ~ p) [Qp → q ≡~ p ∨q]
Y = X → (p ∧q) ⇒(~ p ∨ q) ∧ (~ p ∨ ~ q) [commutative property]
⇒~ p ∨ (q ∧ ~ q) (distributive property)
22 Consider the two statements : ⇒~ p
(S 1 ) : (p → q) ∨ (~ q → p) is a tautology
25 Which of the following Boolean expression is not a
(S 2 ) : (p ∧ ~ q) ∧ (~ p ∨ q) is a fallacy
tautology ? [2021, 22 July Shift-II]
Then, [2021, 26 Aug. Shift-II]
(a) (p ⇒ q) ∨ (~ q ⇒ p)
(a) only (S 1) is true (b) (q ⇒ p) ∨ (~ q ⇒ p)
(b) both (S 1) and (S2 ) are false (c) (p ⇒~ q) ∨ (~ q ⇒ p)
(c) both (S 1) and (S2 ) are true (d) (~ p ⇒ q) ∨ (~ q ⇒ p)
(d) only (S2 ) is true
 Ans. (d) (c) [(p → q) ∧ ~ q] → p
(i) (p → q) ∨ (~ p → p) ≡ [(~ p ∨q) ∧ ~ q] → p
= (~ p ∨ q) ∨ (q ∨ p) ≡ (~ p ∧ ~ q) → p
= (~ p ∨ q) ∨q= t ∨ q = t ≡ (p ∨q ) ∨ p ≡ (p ∨q)
(ii) (q → p) ∨ (~ q → p) (d) [(p→ q) ∧ ~ q] → p ∧q
= (~ q ∨ p) ∨ (q ∨ p) ≡ (p ∨q) ∨ (p ∧q)
= (~ q ∨ q) ∨ p= t ∨ p = True ≡ [(p ∨q) ∨ p] ∧ [(p ∨q) ∨q]
(iii) (p →~ q) ∨ (~ q → p) ≡ (p ∨q) ∧ (p ∨q) ≡ (p ∨q)
= (~ p ∨ ~ q) ∨ (q ∨ p)
28 If the Boolean expression (p ⇒ q) ⇔ (q * (~ p)) is a
= (~ p ∨ q) ∨ (~ q ∨q) = T ∨T = T
(iv) (~ q → q) ∨ (~ q → p)
tautology, then the Boolean expression
= p ∨ q ∨ q ∨ p= p ∨ p ∨q ∨q
(p * (~ q)) is equivalent to [2021, 17 March Shift-I]
(a) q ⇒ p (b) ~ q ⇒ p
= p ∨q
(c) p ⇒~ q (d) p ⇒ q
Not a tautology.
Ans. (a)
26 The Boolean expression (p ∧ ~ q) ⇒ (q ∨ ~ p) is equivalent to The Boolean expression
[2021, 20 July Shift-I] (p ⇒ q ) ⇔ (q * (~ p)) is a tautology.
(a) q ⇒ p (b) p ⇒ q Making the truth table for this
(c) ~q ⇒ p (d) p ⇒~ q p q p→ q q*~p ~q − q ∧ p ~ (~ q ∧ p )
Ans. (b)
(p ∧ ~ q) ⇒(q ∨ ~ p) T T T T F F T
p q ~p ~q p∧ ~ q q∨ ~ p p∧ ~ q
T F F F T T F
⇒q∨ ~ p F T T T F F T
F F T T T F T
T T F F F T T
T F F T T F F ∴ ~ (~ q ∧ p) = q ∨ ~ p = ~ p ∨q
F T T F F T T ∴* is equivalent to v.
p *~q = p ∨~q
F F T T F T T
=~q∨ p
p q q→ p p→ q ~ q→ p p→~q = q⇒p

T T T T T F 29 If the Boolean expression (p ∧ q) * (p ⊗ q) is a tautology,

T F T F T T then * and ⊗ are respectively, given by
[2021, 17 March Shift-II]
F T F T T T
(a) →,→ (b) ∧, ∨ (c) ∨, → (d) ∧, →
F F T T F T
Ans. (a)
So, option (b) is correct. p q p∧q → → →
p ⊗q (p ∧ q) * (p ⊗ q)

T T T T T
27 If p and q are two statements, then which of the following
T F F F T
compound statement is a tautology ?
[2021, 18 March Shift-II] F T F T T
(a) ( p ⇒ q) ∧ ~ q] ⇒ Q F F F T T
(b) (p ⇒ q) ∧ ~ q] ⇒ ~ p Clearly * and ⊗ are →, →respectively for tautology.
(c) (p ⇒ q) ∧ ~ q] ⇒ p
(d) ( p ⇒ q) ∧ ~ q] ⇒ (p ∧q) 30 Which of the following Boolean expression is a
Ans. (b) tautology? [2021, 16 March Shift-I]
To check options one by one, (a) (p ∧ q) ∨ (p ∨ q)
(a) [(p→ q) ∧~ q] → q (b) (p ∧ q) ∨ (p → q)
≡ (~ p ∧~ q) → q (c) (p ∧ q) ∧ (p → q)
≡ (p ∨q) ∨q ≡ p ∨q (d) (p ∧ q) → (p → q)
(b) [(p→ q) ∧~ q] → ~ p Ans. (d)
≡ (p ∨q) ∨~ p Let p and q are two statements.
≡t Let’s make the truth table and see (p ∧q) implies (p ∨q) or not.
 p q p∧q p∨ q p→ q (p ∧ q) →(p → q) (a) (A) and (B) both are not tautologies.
T T T T T T (b) (A) and (B) both are tautologies.
F T F T T T (c) (A) is a tautology but not (B).
T F F T F T (d) (B) is a tautology but not (A).
F F F F T T Ans. (b)
Given statements,
Since, last column of the truth table for (p ∧q) → (p → q)
(A) [~ q ∧ (p → q] → ~ p
contains T sonly.
So, (p ∧q) → (p → q) is a tautology. (B) [(p ∨q) ∧ ~ p] → q
For statement (A),
31 Let F 1 (A, B, C) = (A ∧ ~ B) ∨ [~ C ∧ (A ∨ B)] ∨~ A and p→ q ~ q ∧ (p → q) [~ q ∧ (p → q)]→ ~ p
F 2 (A, B) = (A ∨ B) ∨ (B → ~ A) be two logical expressions. T F T
Then, [2021, 26 Feb. Shift-II] F F T
(a) F1 and F2 both are tautologies T F T
(b) F1 is a tautology but F2 is not a tautology
T T T
(c) F1 is not tautology but F2 is a tautology
(d) Both F1 and F2 are not tautologies p q ~ p ~q
Ans. (c) T T F F
F1 (A, B, C) = (A ∧ ~ B) ∨ [~ C ∧ (A ∨ B)] ∨ ~ A T F F T
≡ {(A ∧ ~ B) ∨ [~ C ∧ (A ∨ B)] (Associative F T T F
law) F F T T
≡ {(A ∨ ~ A) ∧ (~ B ∨ ~ A)} ∨ [(A ∨ B) ∧ C] (distributive ∴Statement (A) is tautology.
law) For statement (B),
≡ (~ B ∨ ~ A) ∨ [(A ∨ B) ∧ ~ C] (QA ∨ ~ A ≡ T ,T ∧ p ≡ p) p∨ q (p ∨ q) ∧ ~ p [(p ∨ q)∧ ~ p ]→ q
≡ [(~ A ~ B) ∨ (A ∨ B)] ∧ [(~ A ∨ ~ B) ∨ ~ C] T F T
≡ T ∧ (~ A ∨ ~ B) ∨ ~ C T F T
≡ (~ A ∨ ~ B) ∨ ~ C T T T
Which is not a tautology. F T T
Now, ∴ Statement (B) is tautology.
F2 (A, B) = (A ∨ B) ∨ (B → ~ A)
∴ (A) and (B) both are tautologies.
≡ (A ∨ B) ∨ (~ B ∨ ~ A)
Hence,F2 is a tautology. 34 The negative of the statement ~ p ∧ (p ∨ q) is
[2021, 24 Feb. Shift-II]
32 The statement A → (B → A) is equivalent to
(a) ~ p ∨q (b) p ∨ ~ q
[2021, 25 Feb. Shift-I]
(c) ~ p ∧q (d) p∧ ~ q
(a) A → (A ∧ B) (b) A → (A → B)
Ans. (b)
(c) A → (A ↔ B) (d) A → (A ∨ B)
Given, statement [~ p ∧ (p ∨ q]
Ans. (d)
Negative of given statement ~ [~ p ∧ (p ∨q)
Given, statement A → (B → A)
= p∨ ~ [p ∨q) [By De morgan’s law]
≡ A → (~ B ∨ A)
= p ∨ (~ p∧ ~ q) [By De Morgani law]
≡ ~ A ∨ (~ B ∨ A)
= (p∨ ~ p) ∧ (p∨ ~ q) [Using Distribution property]
≡ (~ A ∨ A) ∨ ~ B
≡T ∨ ~ B ≡T 35 The statement among the following that is a tautology is
∴T ∨ B = T [2021, 24 Feb. Shift-I]
≡ (~ A ∨ A) ∨ B
(a) A ∧ (A ∨ B) (b) A ∨ (A ∧ B)
≡ ~ A ∨ (A ∨ B)
(c) [A ∧ (A → B)] → B (d) B → [A ∧ (A → B)]
≡ A → (A ∨ B)
Ans. (c)
33 For the statements p and q, consider the following Given, [A ∧ (A → B)] → B
compound statements = A ∧ (~ A ∨ B) → B
A. [~ q ∧ (p → q)] → ~ p = [(A ∧ ~ A) ∨ (A ∧ B)] → B
B. [(p ∨ q) ∧ ~ p] → q = (A ∧ B) → B
= ~ A ∨~ B ∨ B = t
Then, which of the following statement(s) is/are
Hence, [A ∧ (A → B)] → B is a tautology.
correct? [2021, 24 Feb. Shift-II]
36 Which of the following is a tautology? p q ~q q∨ p p ↔ (~ q) (q ∨ p ) → (p ↔ (~ q))
[2020, 2 Sep. Shift-II] T T F T F F
(a) (~ p) ∧ (p ∨ q) → q (b) (q → p) ∨ ~ (p → q) T F T T T T
(c) (~q) ∨ (p ∧ q) → q (d) (p → q) ∧ (q → p) F T F T T T
Ans. (a) F F T F F T
By truth table ⇒S 1 is not a tautology, so S 1 is not correct.
Now, S2 : (~ q) ∧ ((~ p) ↔ q) is a fallacy.
p q ~p ~q p ∨ q p ∧ q p → q q → p (~p)∧ (p ∨ q) (~p) ∧ (p v q)
→q For S2 :
T T F F T T T T F T p q ~p ~q (~ p ) ↔ q (~ q) ∧ ((~ p ) ↔ (q)
T F F T T F F T F T T T F F F F
F T T F T F T F T T
T F F T T T
F F T T F F T T F T
F T T F T F
∴ The statement (~p) ∧ (p ∨ q) → q is a tautology. F F T T F F
Hence, option (a) is correct.
⇒S2 is not a fallacy, so S2 is not correct.
37 The proposition p → ~ (p ∧~ q) is equivalent to Hence, option (a) is correct.
[2020, 3 Sep. Shift-I]
(a) q (b) (~ p) ∨q (c) (~ p) ∧q (d) (~ p) ∨ (~ q)
40 The negation of the Boolean expression x ↔~ y is
Ans. (b) equivalent to [2020, 5 Sep. Shift-I]
Given proposition p ⇒ ~ (p ∧ (~ q)) (a) (~ x ∧ y) ∨ (~ x ∧ ~ y) (b) (x ∧ y) ∨ (~ x ∧ ~ y)
= p ⇒ (~ p ∨q) (c) (x ∧ ~ y) ∨ (~ x ∧ y) (d) (x ∧ y) ∧ (~ x ∨ ~ y)
= (~ p) ∨ ((~ p) ∨q) [by De Morgan Law] Ans. (b)
= (~ p) ∨q As we know, ~ (p ↔ q) = (p ∧ ~ q) ∨ (~ p ∧ q)
Hence, option (b) is correct. So, ~ (x ↔ ~ y) = (x ∧ y) ∨ (~ x ∧ ~ y)

38 Let p,q, r be three statements such that the truth value 41 The statement (p → (q → p)) → (p → (p ∨ q)) is
of (p ∧q) → (~ q ∨ r) is F. Then the truth values of p,q,r are [2020, 5 Sep. Shift-II]
respectively. [2020, 3 Sep. Shift-II] (a) equivalent to (p ∧ q) ∨ (~ q)
(a) T, F, T (b) F, T, F (b) a contradiction
(c) T, T, F (d) T, T, T (c) equivalent to (p ∨ q) ∧ (~ p)
Ans. (c) (d) a tautology
Given statement Ans. (d)
The truth table
(p ∧ q) → (~ q ∨ r)
= ~ (p ∧ q) ∨ (~ q ∨ r) p q p ∨ q q → p p → (q → p ) p → (p ∨ q) (p → (q → p ))→
(p → (p ∨ q))
= ((~ p) ∨ (~ q)) ∨ (~ q ∨ r)
T T T T T T T
= (~ p) ∨ (~ q) ∨ r, T F T T T T T
is give false, so~ p , ~ q and r must be false, so p, q must be true F T T F T T T
and r should be false, so truth value of p, q, r are T, T, F F F F T T T T
respectively.
Hence, option (c) is correct. ∴The statement p → (q → p) → (p → (p ∨q)) is a tautology.

39 Given the following two statements: 42 The negation of the Boolean expression p ∨ (~ p ∧ q) is
(S 1 ) : (q ∨ p) → (p ↔~ q) is a tautology. equivalent to [2020, 6 Sep. Shift-I]
(S 2 ) :~ q ∧ (~ p ↔ q) is a fallacy. Then (a) p ∧ ~ q
[2020, 4 Sep. Shift-I] (b) ~ p ∧ ~ q
(a) both (S 1) and (S2 ) are not correct (c) ~ p ∨ ~ q
(b) only (S 1) is correct (d) ~ p ∨ q
(c) both (S 1) and (S2 ) are correct Ans. (b)
(d) only (S2 ) is correct The negation of Boolean expression
Ans. (a) p ∨ (~ p ∧ q) is
Given statement ~ (p ∨ (~ p ∧ q)) = ~ ((p ∨ (~ p)) ∧ (p ∨ q))
S 1 : (q ∨ p) → (p ↔ (~ q)) is a tautology. = ~ (p ∨ q) = (~ p) ∧ (~ q)
For S 1:
43 The logical statement (p ⇒ q) ∧ (q ⇒ ~ p) is equivalent to Ans. (d)
[2020, 7 Jan. Shift-I] The statement p → (p ∧ ( ~ q)) is false, if p is true and p ∧ (~ q) is
false and the statement p ∧ (~ q) is false, if (~ q) is false as p is
(a) ~ p (b) q (c) p (d) −q
true, so q must be true.
Ans. (a)
So, the truth values of p and q are T, T respectively.
From the truth table
Hence, option (d) is correct.
p q p ⇒q ~p q ⇒~ p (p ⇒ q) ∧ (q ⇒ ~ p )
T T T F F F 47 Which one of the following statements is not a
T F F F T F
tautology? [2019, 8 April Shift-II]

F T T T T T (a) (p ∧ q) → (~ p) ∨ q
F F T T T T (b) (p ∧ q) → p
(c) p → (p ∨ q)
(p ⇒ q) ∧ (q ⇒ ~ p) is equivalent to~ p.
(d) (p ∨ q) → (p ∨ (~ q))
44 Which one of the following is a tautology? Ans. (d)
[2020, 8 Jan. Shift-I] (a) (p ∧ q) → (~ p) ∨ q
(a) (P ∧ (P → Q)) → Q (b) P ∧ (P ∨ Q) ≡ (~ (p ∧ q)) ∨ ((~ p) ∨ q)
(c) P ∨ (P ∧ Q) (d) Q → (P ∧ (P → Q) ≡ ((~ p) ∨ (~ q)) ∨ ((~ p) ∨ q)
Ans. (a) ≡ (~ p) ∨ (~ q) ∨q
[Q(~ p) ∨ (~ p) ≡ ~ p]
From the truth table
≡ (~ p) ∨T
P Q P∨Q P ∧Q P→Q P ∧( P → Q ) P ∧(P ∨ Q ) P∨(P ∧ Q ) [Q~ q ∨q ≡ T]
T T T T T T T T ≡T
T F T F F F T T So, it is a tautology [Q ((~ q) ∨ q) is tautology]
F T T F T F F F (b) (p ∧ q) → p ≡ (p ∧ q) ∨ p
F F F F T F F F ≡ ((~ p) ∨ (~ q)) ∨ p
[Q~ (p ∧ q) ≡ (~ p) ∨ (~ q)]
P ∧ (P → Q ) → Q Q → (P ∧ (P → Q ))
≡ (~ p ∨ p) ∨ (~ q) is tautology.
T T [Q~ p ∨ p is a tautology and (~ q) ∨ T ≡ T]
T T (c)Qp → (p ∨ q) ≡ (~ p) ∨ (p ∨ q)
T F [Qp → q is equivalent to (~ p ∨ q)]
T T ≡ (~ p ∨ p) ∨ q is tautology.
∴P ∧ (P → Q ) → Q is a tautology. [Q(~ p ∨ p) is tautology and q ∨ T ≡ T]
Hence, option (a) is correct. (d) (p ∨ q) → (p ∨ (~ q))
≡ (~ (p ∨ q)) ∨ (p ∨ (~ q))
45 Which of the following statements is a tautology?
[2020, 8 Jan. Shift-II] ≡ ((~ p) ∧ (~ q)) ∨ (p ∨ (~ q))
(a) ~ (p ∧ ~ q) → p ∨ q (b) ~ (p ∨ ~ q) → p ∧ q ≡ (p ∨ (~ q) ∨ ((~ p) ∧ (~ q))
(c) p ∨ (~ q) → p ∧ q (d) ~ (p ∨ ~ q) → p ∨ q ≡ (p ∨ (~ q) ∨ (~ p)) ∧ (p ∨ (~ q) ∨ (~ q))
Ans. (d)
≡ (T ∨ (~ q)) ∧ (p ∧ (~ q)) ≡ T ∧ (p ∧ (~ q))
From the truth table
≡ p ∧ (~ q), which is not a tautology.
p q ~ p ~ q p ∨ (~ q)p ∧ q ~ (p ∨ (~ q)) p ∨ q(~ (p ∨ (~ q)))
→ p∨ q 48 For any two statements p and q, the negation of the
T T F F T T F T T expression p ∨ (~ p ∧ q) is [2019, 9 April Shift-I]
T F F T T F F T T (a) ~ p ∧ ~ q (b) ~ p ∨ ~ q
F T T F F F T T T (c) p ∧ q (d) p ↔ q
T F T T T F F F T Ans. (a)
Qp ∨ ( (~ p) ∧q)
So, (~ (p ∨ (~ q))) → p ∨ q is a tautology. Hence, option (d) is correct.
= (p ∨ (~ p)) ∧ (p ∨ q ) [by Distributive law]
46 If p → (p ∧ ~ q) is false, then the truth values of p and q are = p ∨q [Qp ∨ (~ p) is tautology]
respectively [2020, 9 Jan. Shift-II] So negation of p ∨ ((~ p) ∧q)
(a) F, T (b) T, F = ~ [p ∨ (~ p) ∧q] = ~ (p ∨q)
(c) F, F (d) T, T = (~ p) ∧ (~ q) [by Demorgan’s law]
49 If p ⇒ (q ∨ r) is false, then truth values of p, q, r are Now, from the options
(a) When p = T, q = T and r = F
respectively [2019, 9 April Shift-II]
then ~ p ∨ (~ q ∨ r) = F ∨ (F ∨F) = F
(a) T, T, F (b) T, F, F (c) F, F, F (d) F, T, T
(b) When p = T, q = F and r = F
Ans. (b)
then ~ p ∨ (~ q ∨ r) = F ∨ (T ∨F) = T
Given statement p ⇒(q ∨ r) is false.
(c) When p = T, q = F and r = T
Q p → (q ∨ r) = (~ p) ∨ (q ∨ r)
then ~ p ∨ (~ q ∨ r) = F ∨ (T ∨ T) = T
Now, by trial and error method, if truth value of p is T,q is F and r
is F, (d) When p = F, q = T and r = T
then truth value of (q ∨ r) is F. then ~ p ∨ (~ q ∨ r) = T ∨ (F ∨T) = T
So, truth value of [(~ p) ∨ (q ∨ r)] is false.
Thus, if truth value of p, q, r are T, F, F, then the statement 53 The boolean expression ~ (p ⇒ (~q)) is equivalent to
p → (q ∨ r) is false. [2019, 12 April Shift-II]
(a) p ∧ q (b) q ⇒~ p (c) p ∨ q (d) (~ p) ⇒ q
50 Which one of the following Boolean expressions is a Ans. (a)
tautology ? [2019, 10 April Shift-I] Given boolean expression is
(a) (p ∨ q) ∨ (p ∨ ~ q) (b) (p ∧ q) ∨ (p ∧ ~ q) ~ (p ⇒ (~ q))
(c) (p ∨ q) ∧ (p ∨ ~ q) (d) (p ∨ q) ∧ (~ p ∨ ~ q) ≡ ~ ((~ p) ∨ (~ q)) [Qp ⇒ q ≡ ~ p ∨ q]
Ans. (a) ≡ p ∧q
Option (a) (p ∨ q) ∨ (p ∨ (~ q))
≡ p ∨ (q ∨ ~ q) is tautology, [Qq ∨ (~ q) ≡ T and p ∨T ≡ T] 54 If the Boolean expression (p ⊕ q) ∧ (~ p⋅ q) is equivalent to
Option (b) (p ∧ q) ∨ (p ∧ (~ q)) ≡ p ∧ (q ∨ ~ q) p ∧ q, where ⊕, ⋅∈{∧,∨}, then the ordered pair(⊕, ⋅) is
[2019, 9 Jan. Shift-I]
not a tautology, [Qq ∨ ~ q ≡ T and p ∧ T ≡ p]
(a) (∧, ∨) (b) (∧, ∧)
Option (c) (p ∨ q) ∧ (p ∨ (~ q)) ≡ p ∨ (q ∧ ~ q)
(c) (∨, ∧) (d) (∨, ∨)
not a tautology [Qq ∧ ~ q ≡ F and p ∨F ≡ p]
Ans. (a)
Option (d)
Let us check all the options
(p ∨ q) ∧ ((~ p) ∨ (~ q)) ≡ (p ∨ q) ∧ (~ (p ∧ q))
(a) Consider, ⊕ = ∧ and ⋅ = ∨.
not a tautology.
In that case, we get
51 The negation of the boolean expression ~ s ∨ (~ r ∧ s) is (p ∧q) ∧ (∼ p ∨q) ≡ (p ∧q)
equivalent to [2019, 10 April Shift-II]
(a) s ∧r (b) ~ s ∧ ~ r (c) s ∨r (d) r and
Ans. (a)
Key Idea Use De-morgan’s law, Distributive law and Identity law [take ∨ ≈ ∪ and ∧ ≈ ∩]
as p ∨F ≡ p (b) Consider, ⊕ = ∧ and ⋅ = ∨.
In that case, we get
The given boolean expression is~ s ∨ ((~ r) ∧ s )
Now, the negation of given boolean expression is (p ∧q) ∧ (∼ p ∧q) ≡ null set
~ (~ s ∨ ((~ r) ∧ s ))
and
= s ∧ (~ ((~ r) ∧ s )) [Q~ (p ∧q) = ~ p∨ ~ q]
= s ∧ (r ∨ (~ s )) [Q~ (p ∨q) = ~ p∧ ~ q]
= (s ∧ r) ∨ (s ∧ (~ s )) [Qp ∧ (q ∨ r) ≡ (p ∧q) ∨ (p ∧ r)] (c) Consider, ⊕ = ∨ and ⋅ = ∧.
= (s ∧ r) [Qp∧ ~ p ≡ F] In that case, we get
(p ∨q) ∧ (∼ p ∧q) ≡ (∼ p ∧q)
52 If the truth value of the statement p → (~ q ∨ r) is false (F),
then the truth values of the statements p, q and r are and
respectively [2019, 12 April Shift-I]
(a) T, T and F (b) T, F and F
(c) T, F and T (d) F, T and T (d) Consider, ⊕ = ∨ and u = ∨.
In that case, we get
Ans. (a)
(p ∨q) ∧ (∼ p ∨q) ≡ q
Key Idea Use formula :
p → q = ~p ∨ q
and
Given statement is
p → (~ q ∨ r) = ~ p ∨ (~ q ∨ r)
55 The logical statement [~ (~ p ∨ q) ∨ (p ∧ r)] ∧ (~ q ∧ r) 58 The Boolean expression ((p ∧ q) ∨ (p ∨ ~ q)) ∧ (~ p∧ ~ q) is
is equivalent to [2019, 9 Jan. Shift-II] equivalent to [2019, 12 Jan. Shift-I]
(a) ~ p ∨ r (b) (p ∧ ~ q) ∨ r (a) p ∧ q (b) p ∨ (~ q)
(c) (p ∧ r) ∧ ~ q (d) (~ p ∧ ~ q) ∧ r (c) p ∧ (~ q) (d) (~ p) ∧ (~ q)
Ans. (c) Ans. (d)
Clearly, [~ (~ p ∨ q) ∨ (p ∧ r)] ∧ (~ q ∧ r) Let the given Boolean expression
≡ [(p ∧ ~ q) ∨ (p ∧ r)] ∧ (~ q ∧ r) ((p ∧q) ∨ (p∨ ~ q)) ∧ (~ p∧ ~ q) ≡ r
(Q~ (~ p ∨ q) ≡ ~ (~ p) ∧ ~ q ≡ p ∧ ~ q Now, let us construct the following truth table
by De Morgan’s law)
p q ~p ~q p ∧ q p∨ ~ q ~ p∧ ~ q ( p ∧ q) ∨ r
≡ [p ∧ (~ q ∨ r)] ∧ (~ q ∧ r)] (distributive law)
( p∨ ~ q)
≡ p ∧ [(~ q ∨ r) ∧ (~ q ∧ r)] (associative law) T T F F T T F T F
≡ p ∧ [(~ q ∧ r) ∧ (~ q ∨ r)] (commutative law) T F F T F T F T F
≡ p ∧ [{(~ q ∧ r) ∧ (~ q )} ∧ {(~ q ∧ r) ∧ r] (distributive law) F T T F F F F F F
F F T T F T T T T
≡ p ∧ [(~ q ∧ r) ∨ (~ q ∧ r)] (idempotent law)
≡ p ∧ [~ q ∧ r] (idempotent law) Clearly, r ≡ ~ p∧ ~ q
≡ p ∧ ~ q ∧ r ≡ (p ∧ r) ∧ (~ q) (associative law) 59 The expression ~ (~ p → q) is logically equivalent to
[2019, 12 Jan. Shift-II]
56 Consider the following three statements: (a) p ∧ ~ q (b) p ∧ q (c) ~ p ∧ q (d) ~ p ∧ ~ q
P : 5 is a prime number.
Ans. (d)
Q : 7 is a factor of 192. Since, the expression, p → q ≡ ~ p ∨ q
R : LCM of 5 and 7 is 35. So, ~ p→ q ≡ p ∨q
Then, the truth value of which one of the following and therefore ~ (~ p → q) ≡ ~ (p ∨ q) ≡ (~ p) ∧ (~ q)
statements is true ? [2019, 10 Jan. Shift-II] [by DeMorgan’s law]
(a) (P ∧ Q) ∨ (~ R) (b) P ∨ (~ Q ∧ R)
(c) (~ P) ∨ (Q ∧ R) (d) (~ P) ∧ (~ Q ∧ R) 60 The boolean expression ~ (p ∨ q) ∨ (~ p ∧ q) is equivalent to
Ans. (b) [JEE Main 2018]

Since, the statements (a) ~ p (b) p (c) q (d) ~ q

P : 5 is a prime number, is true statement. Ans. (a)
Q : 7 is a factor of 192, is false statement Key Idea Use DeMorgan’s and distributive law.
and R : LCM of 5 and 7 is 35, is true statement. We have,~ (p ∨ q) ∨ (~ p ∧ q)
So, truth value of P isT, Q is F, R isT
≡ (~ p ∧ ~ q) ∨ (~ p ∧ q)
Now let us check all the options.
[Q By DeMorgan’s law ~ (p ∨ q) = (~ p ∧ ~ q)]
P Q R ~P ~Q ~R P∧Q Q ∧ R ~Q ∧ R
≡~ p ∧ (~ q ∨ q) [By distributive law]
T F T F T F F F T
≡ ~ p ∧ t [~ q ∨ q = t]
( P ∧ Q ) ∨ (~ R ) P ∨ (~Q ∧ R ) (~ P) ∨ (Q ∧ R ) (~ P) ∧ (~Q ∧ R ) ≡~ p
F T F F
61 The statement (p → q) → [(~ p → q) → q] is [JEE Main 2017]
Clearly, the truth value of P ∨ (~ Q ∧ R) isT.
(a) a tautology (b) equivalent to~ p → q
57 If q is false and p ∧q ←→ r is true, then which one of
(c) equivalent to p → ~ q (d) a fallacy
the following statements is a tautology?
Ans. (a)
[2019, 11 Jan. Shift-I]
(a) p ∨ r (b) (p ∧ r) → (p ∨ r) The truth table of the given expression is given below
(c) (p ∨ r) → (p ∧ r) (d) p ∧ r p q x ≡ p→ q ~ p ~p → q y ≡ (~ p → q) → q x→ y
Ans. (b) T T T F T T T
Given, (p ∧ q) ↔ r is true. This is possible under two cases T F F F T F T
Case I When both p ∧ q and r are true, which is not F T T T T T T
possible becauseq is false. F F T T F T T
Case II When both (p ∧ q) and r are false. Hence, it is a tautology.
⇒ p ≡T or F ; q ≡ F , r ≡ F 62 The Boolean expression (p ∧ ~ q) ∨ q ∨ (~ p ∧ q) is equivalent
In this case, (a) p ∨ r isT or F
(b) (p ∧ r) → (p ∨ r) is F→ (T or F ) , which always result in T.
to [JEE Main 2016]

(c) (p ∨ r) → (p ∧ r) is (T or F) → F, which may beT or F. (a) ~ p ∧ q (b) p ∧ q (c) p ∨ q (d) p ∨ ~ q

(d) p ∧ r is F.
 Ans. (c) Hence, (p → q) ↔ (p → q) will be a tautology.
Consider, (p ∧ ~ q) ∨ q ∨ (~ p ∧ q) ≡ [(p ∧ ~ q) ∨ q] ∨ (~ p ∧q) Statement I (p ∧ ~ q) ∧ (~ p ∧ q)
≡ [(p ∨ q) ∧ (~ q ∨ q)] ∨ (~ p ∧ q) ≡ [(p ∨ q) ∧ t] ∨ (~ p ∧ q) p q ~p ~q p ∧~q ~p ∧ q ( p ∧ ~ q) ∧
≡ (p ∨ q) ∨ (~ p ∧ q) ≡ (p ∨ q ∨ ~ p) ∧ (p ∨ q ∨ q) (~ p ∧ q)
≡ (q ∨ t) ∧ (p ∨ q) ≡ t ∧ (p ∨ q) ≡ p ∨ q T T F F F F F
T F F T T F F
63 The negation of ~ s ∨ (~ r ∧ s) is equivalent to F T T F F T F
[JEE Main 2015] F F T T F F F
(a) s ∧ ~ r (b) s ∧ (r ∧ ~ s )
Hence, it is a fallacy.
(c) s ∨ (r ∨ ~ s ) (d) s ∧ r
Ans. (d) 66 The only statement among the followings that is a
~ (~ s ∨ (~ r ∧ s )) ≡ s ∧ (~ (~ r ∧ s )) ≡ s ∧ (r ∨ ~ s ) ≡ (s ∧ r) ∨ (s ∧ ~ s )
tautology is [AIEEE 2011]
≡ (s ∧ r) ∨ F (Qs ∧ ~ s is false)
(a) B → [A ∧ (A → B )]
≡s ∧r
(b) A ∧ (A ∨ B )
64 The statement ~ (p ↔ ~ q ) is [JEE Main 2014] (c) A ∨ (A ∧ B )
(a) equivalent to p ↔ q (d) [A ∧ (A → B )] → B
(b) equivalent to ~ p ↔ q Ans. (d)
(c) a tautology
A B A∨B A∧B A ∧(A A ∨(A A→ B A ∧(A A ∧(A B→ [A ∧
(d) a fallacy ∨ B) ∧ B) → B) → B) ( A → B )]
Ans. (a) →B

p q ~p ~q q↔q p ↔ ~ q ~ p ↔ q ~ (p ↔ ~ q)
T T T T T T T T T T
T F T F T T F F T T
T F F T F T T F
F T T F F F T F T F
F T T F F T T F
F F F F F F T F T T
T T F F T F F T
F F T T T F F T Hence the truth value of all the elements of the column
[A ∧ (A → B)] → B is T.
~ (p ↔~ q) is equivalent to (p ↔ q). ∴ A ∧ (A → B) → B is tautology.
65 Consider
Statement I (p ∧ ~ q) ∧ (~ p ∧ q) is a fallacy.
67 Statement I ~ (p ↔ ~ q) is equivalent to p ↔ q.
Statement II ~ (p ↔ ~ q) is a tautology.
Statement II (p → q) ↔ (~ q → ~ p) is a tautology.
(a) Statement I is true, Statement II is true; Statement II is a
[JEE Main 2013]
correct explanation for Statement I
(a) Statement I is true, Statement II is true; Statement II is a correct
(b) Statement I is true, Statement II is true; Statement II is not a
explanation for Statement I
correct explanation for Statement I
(b) Statement I is true, Statement II is true; Statement II is not a
(c) Statement I is true, Statement II is false
correct explanation for Statement I
(d) Statement I is false, Statement II is true [AIEEE 2009]
(c) Statement I is true, Statement II is false
Ans. (c)
(d) Statement I is false, Statement II is true
p q p↔q ~q p ↔ ~ q ~ (p ↔ ~ q)
Ans. (b)
T T T F F T
Statement II (p → q) ↔ (~ q → ~ p) ≡ (p → q) ↔ (p → q), which is
T F F T T F
always true, so Statement II is true.
F T F F T F
Statement I (p ∧ ~ q) ∧ (~ p ∧ q) ≡ p ∧ ~ q ∧ ~ p ∧ q ≡ p ∧ ~ p ∧ ~ q ∧ q F F T T F T
≡ f ∧ f ≡ f.
From the table we see that, truth values of column p ↔ q and
Hence, it is a fallacy statement. So, Statement I is true and ~ (p ↔ ~ q) are identical.
statement II is not a correct explanation for statement I. So, ~ (p ↔ ~ q) s equivalent to p ↔ q.
Alternate Solution The values of the column~ (p ↔ ~ q) are not all ‘T’. So, ~ (p ↔ ~ q) is
Statement II (p → q) ↔ (~ q → ~ p) ~ q → ~ p is contrapositive of not a tautology.
p→ q Hence, Statement I is true but Statement II is false.