Welcome to

Mathematical Reasoning
 Table of contents

Session 01 𝟎𝟑 Session 02 𝟒𝟒

Statement 03 Biconditional Statement 52

Compound Statement 09 Validity of Statements 55

Basic logic Connectives 10 Tautology and Fallacy 60
Conjunction 11 Algebra of Statements 63
Disjunction 13
Negation 18
Quantifiers 30
Conditional Statement 33
Converse, Contrapositive 39
and Inverse of a Conditional
Statement
 Session 01
Introduction to
Mathematical Reasoning

Return To Top
 Statement

A statement is a sentence which is either true or false, but not both simultaneously.

In general, statements are denoted by letters 𝑝, 𝑞, 𝑟 etc.

Example:

Statement Non-Statement

• New Delhi is in India. • 𝑥 is a natural number.

• 2 is an odd number. • Rohan is a good student.

• Every rectangle is a square. • Rose is a beautiful flower.

• Close the door.

Return To Top
 Example:

• How old are you ?

• Tomorrow is a Sunday.

• All prime numbers are odd.

Note

• Truth (T) or Falsity (F) of a statement is called truth value.

• The truth value of

i) 36 is divisible by 9 is True

ii) Bengaluru is in America is False

Return To Top
 Note

Exclamatory sentences fail to be mathematical statements as any

truth value can’t be assigned to them.

Example:

• May God bless you !

• Hurray ! we won.

• Wow ! Such a big fish.

Return To Top
 More Examples:

• How old are you ?

• Tomorrow is a Sunday.

• All prime numbers are odd.

Note

• Truth (T) or Falsity (F) of a statement is called its truth value.

• The truth value of

i) 36 is divisible by 9 is True

ii) Bengaluru is in America is False

Return To Top
 Note

Exclamatory sentences fail to be mathematical statements as any truth

value can’t be assigned to them.

Examples:

• May God bless you !

• Hurray ! we won.

• Wow ! Such a big fish.

Simple Statement
A statement is called simple if it can not be broken
down into two or more statements.
Example:
• 11 is an odd number.
• The sun is a star.

Return To Top• 2 is a rational number.

 Compound Statement

A compound statement is the one which is made up of

two or more simple statements.

Example:
• 11 is both odd and prime number. • Jack and Jill went up the hill.
→ 11 is an odd number. → Jack went up the hill.
→ 11 is a prime number. → Jill went up the hill.
• If it rains then the school will be closed.

→ It rains.

→ School will be closed.

The simple statements which constitute a compound statement

are called component statements.

Return To Top
 Key Takeaways

Basic Logic Connectives:

If two statements are connected by the means of a conjunction or a disjunction
then the statements are said to be connected by Basic Logic Connectives.
Examples:
84 is divisible by 4 and 7 The sun shines or it rains.
𝑝 ∶ 84 is divisible by 4. 𝑝 ∶ The sun shines.
𝑞 ∶ 84 is divisible by 7. 𝑞 ∶ It rains.
The statements 𝑝 and 𝑞 are The statements 𝑝 and 𝑞 are
connected by a conjunction and the connected by a disjunction and the
connected statement can be connected statement can be
represented as 𝑝 ∧ 𝑞. represented as 𝑝 ∨ 𝑞.

Note: The truth value of a statement formed by connection of two statements by

basic logic connectives depends on the truth values of individual statements.
Return To Top
 Key Takeaways

Conjunction (AND)

If two simple statements 𝑝 and 𝑞 are 𝑝 𝑞 𝑝∧𝑞

connected by ‘AND’, then the resulting 𝑇 𝑇 𝑇
statement “𝑝 and 𝑞” is called a conjunction of
𝑝 and 𝑞 and denoted by “𝑝 ∧ 𝑞”. 𝑇 𝐹 𝐹

𝐹 𝑇 𝐹
Example
𝐹 𝐹 𝐹
84 is divisible by 4 & 7.
𝑝 ∶ 84 is divisible by 4.
𝑞 ∶ 84 is divisible by 7.

Return To Top
 Conjunction (AND)
𝑝 𝑞 𝑝∧𝑞
If two simple statements 𝑝 and 𝑞 are 𝑇 𝑇 𝑇
connected by ‘AND’, then the resulting
statement “𝑝 and 𝑞” is called a conjunction of 𝑇 𝐹 𝐹
𝑝 and 𝑞 and denoted by “𝑝 ∧ 𝑞”. 𝐹 𝑇 𝐹

𝐹 𝐹 𝐹
Note

𝑝 ∧ 𝑞 is true only if both 𝑝 and 𝑞 are true, otherwise false.

Return To Top
 Disjunction(OR)
Disjunction(OR)

Inclusive OR ∨ Exclusive OR ∨
𝑝 or 𝑞 or both 𝑝 or 𝑞 but not both

• The school is closed if it’s a holiday • An ice-cream or a coke is free

𝑝 𝑝 𝑞
or a Sunday: 𝑝 ∨ 𝑞. along with a pizza: 𝑝 ∨ 𝑞.
𝑞
• 𝑝 or 𝑞 or both 𝑝 & 𝑞: 𝑝 ∨ 𝑞 • 𝑝 or 𝑞 but not both 𝑝 & 𝑞: 𝑝 ∨ 𝑞

At least one Exactly one

Return To Top
 Disjunction (Inclusive OR)

If two simple statements 𝑝 and 𝑞 are 𝑝 𝑞 𝑝∨𝑞

connected by ‘OR’, then the resulting
𝑇 𝑇 𝑇
statement “𝑝 or 𝑞” is called a disjunction
of 𝑝 and 𝑞 and denoted by “𝑝 ∨ 𝑞”. 𝑇 𝐹 𝑇

𝐹 𝑇 𝑇
Example

The Sun shines or it rains. (𝑝 ∨ 𝑞) 𝐹 𝐹 𝐹

𝑝 ∶ The sun shines.
𝑞 ∶ It rains.

Return To Top
 Disjunction (Inclusive OR)
𝑝 𝑞 𝑝∨𝑞
If two simple statements 𝑝 and 𝑞 are
𝑇 𝑇 𝑇
connected by ‘OR’, then the resulting
statement “𝑝 or 𝑞” is called a disjunction 𝑇 𝐹 𝑇
of 𝑝 and 𝑞 and denoted by “𝑝 ∨ 𝑞”.
𝐹 𝑇 𝑇

𝐹 𝐹 𝐹
Note

𝑝 ∨ 𝑞 is false only if both 𝑝 and 𝑞 are false, otherwise true.

Return To Top
 Exclusive OR :

If two simple statements 𝑝 and 𝑞 are connected

by ‘exclusive OR’, then the resulting statement is 𝑝 𝑞 𝑝∨𝑞
called an exclusive or of 𝑝 and 𝑞 and is denoted
𝑇 𝑇 𝐹
by “𝑝 ∨ 𝑞”.
𝑇 𝐹 𝑇
𝑝 ∨ 𝑞 ⇒ 𝑝 or 𝑞 but not both
𝐹 𝑇 𝑇

𝐹 𝐹 𝐹
Example
Student can take French or Sanskrit as their third language.

Return To Top
 AND ′ ∧ ′ in Reasoning is similar to intersection ′ ∩ ′ in Set Theory.
𝑖. 𝑒. , 𝑝 ∧ 𝑞 ≡ 𝐴 ∩ 𝐵
If 𝑥 ∈ 𝐴 ∩ 𝐵 ⇔ 𝑥 ∈ 𝐴 & 𝑥 ∈ 𝐵
Similarly, 𝑝 ∧ 𝑞: 𝑇 ⇔ 𝑝 is true and 𝑞 is true.

OR ′ ∨ ′ in reasoning is similar to Union ‘∪’ in Set Theory.

𝑖. 𝑒. , 𝑝 ∨ 𝑞 ≡ 𝐴 ∪ 𝐵
If 𝑥 ∈ 𝐴 ∪ 𝐵 ⇔ 𝑥 ∈ 𝐴 or 𝑥 ∈ 𝐵 or 𝑥 ∈ 𝐴 ∩ 𝐵
Similarly, 𝑝 ∨ 𝑞: 𝑇 ⇔ 𝑝 is true or 𝑞 is true or 𝑝 and 𝑞 is true.

Return To Top
 Key Takeaways

Negation (NOT)
𝑝 ∼𝑝
The denial of a statement (𝑝) is called the negation
of 𝑝 and is denoted by ∼ 𝑝. 𝑇 𝐹

Example Write the negation of the statement 𝐹 𝑇

𝑝 ∶ New Delhi is a city.

Solution: ∼ 𝑝 ∶ New Delhi is not a city.

The negation of 𝑝 ∼ 𝑝 ∶ It is not the case that New

Delhi is a city.

∼ 𝑝 ∶ It is false that New Delhi is a city.

Return To Top
 Key Takeaways

Negation (NOT)
𝑝 ∼𝑝
The denial of a statement (𝑝) is called the negation
of 𝑝 and is denoted by ∼ 𝑝. 𝑇 𝐹

𝐹 𝑇
NOTE:
The similarity of negation can be seen in set theory as a complement of a set.

i.e., if 𝑝 ≡ 𝐴 ⇒ ~𝑝 = 𝐴𝑐
If 𝑥 ∈ 𝐴 ⇒ 𝑥 ∉ 𝐴𝑐 and 𝑥 ∈ 𝐴𝑐 ⇒ 𝑥 ∉ 𝐴
Similarly, if 𝑝 ≡ 𝑇 ⇒ ~𝑝 ≡ 𝐹 and ~𝑝 ≡ 𝑇 ⇒ 𝑝 ≡ 𝐹

Return To Top
 Negation (NOT)
𝑝 ∼𝑝
The denial of a statement (𝑝) is called the negation
of 𝑝 and is denoted by ∼ 𝑝. 𝑇 𝐹

𝐹 𝑇
NOTE:
The negation of negation of a statement is the statement itself.

i.e., ~ ~𝑝 = 𝑝

Return To Top
 Negation of Compound Statements:

Negation of conjunction ∼ 𝑝 ∧ 𝑞 = ∼ 𝑝 ∨ ∼ 𝑞

Negation of disjunction ∼ 𝑝 ∨ 𝑞 = ∼ 𝑝 ∧ ∼ 𝑞

𝑝 𝑞 𝑝∨𝑞 ∼ (𝑝 ∨ 𝑞) ∼𝑝 ∼𝑞 ∼𝑝∧∼ 𝑞

𝑇 𝑇 𝑇 𝐹 𝐹 𝐹 𝐹

𝑇 𝐹 𝑇 𝐹 𝐹 𝑇 𝐹

𝐹 𝑇 𝑇 𝐹 𝑇 𝐹 𝐹

𝐹 𝐹 𝐹 𝑇 𝑇 𝑇 𝑇

Return To Top
 Write the negation of the compound statement,“2 + 3 = 5 and 8 < 10”

A 2 + 3 ≠ 5 and 8 ≮ 10

B 2 + 3 ≠ 5 or 8 ≮ 10

C 2 + 3 ≠ 5 or 8 > 10

D 2 + 3 ≠ 5 and 8 ≥ 10

Return To Top
 Write the negation of the compound statement,“2 + 3 = 5 and 8 < 10”

Solution:

Given statement : “2 + 3 = 5 and 8 < 10” A 2 + 3 ≠ 5 and 8 ≮ 10

Let us consider the component statements as
B 2 + 3 ≠ 5 or 8 ≮ 10
𝑝 ∶ 2+3 =5 ⇒∼ 𝑝∶ 2+3 ≠ 5

𝑞 ∶ 8 < 10 ⇒ ∼ 𝑞 ∶ 8 ≮ 10 ⇒ 8 ≥ 10 C 2 + 3 ≠ 5 or 8 > 10

∴ Given statement is 𝑝 ∧ 𝑞. So, ∼ 𝑝 ∧ 𝑞 = ∼ 𝑝 ∨ ∼ 𝑞

D 2 + 3 ≠ 5 and 8 ≥ 10
= 2 + 3 ≠ 5 Or 8 ≮ 10

Return To Top
 Negation of statement,“ 5 is an integer Or 5 is irrational” is ___________
JEE MAIN 2020

A 5 is not an integer or 5 is irrational

B 5 is an integer and 5 is irrational

C 5 is irrational or 5 is an integer

D 5 is not an integer and 5 is not irrational

Return To Top
 Negation of statement,“ 5 is an integer Or 5 is irrational” is ___________

Solution: JEE MAIN 2020

Given statement : 5 is an integer Or 5 is irrational

Let us consider the compound statements as

𝑝∶ 5 is an integer 𝑞 ∶ 5 is irrational

∴ Given statement is 𝑝 ∨ 𝑞

So, ∼ 𝑝 ∨ 𝑞 = ∼ 𝑝 ∧ ∼ 𝑞

= 5 is not an integer and 5 is not irrational.

Return To Top
 Negation of statement,“ 5 is an integer Or 5 is irrational” is ___________
JEE MAIN 2020

A 5 is not an integer or 5 is irrational

B 5 is an integer and 5 is irrational

C 5 is irrational or 5 is an integer

D 5 is not an integer and 5 is not irrational

Return To Top
 Which of the following is the negation of the statement or all 𝑀 > 0,
there exists 𝑥 ∈ 𝑆 such that 𝑥 ≥ 𝑀" ?
JEE MAIN 2021

A There exists 𝑀 > 0, there exists 𝑥 ∈ 𝑆 such that 𝑥 < 𝑀

B There exists 𝑀 > 0, there exists 𝑥 ∈ 𝑆 such that 𝑥 ≥ 𝑀

C There exists 𝑀 > 0, there exists such that 𝑥 < 𝑀 for all 𝑥 ∈ 𝑆

D There exists 𝑀 > 0, there exists such that 𝑥 ≥ 𝑀 for all 𝑥 ∈ 𝑆

Return To Top
 Which of the following is the negation of the statement or all 𝑀 > 0,
there exists 𝑥 ∈ 𝑆 such that 𝑥 ≥ 𝑀" ?
JEE MAIN 2021
Solution:

Statement: for all 𝑀 > 0, there exists 𝑥 ∈ 𝑆 such that 𝑥 ≥ 𝑀

Negation: There exists 𝑀 > 0, there exists such that 𝑥 < 𝑀 for all 𝑥 ∈ 𝑆

Return To Top
 Which of the following is the negation of the statement or all 𝑀 > 0,
there exists 𝑥 ∈ 𝑆 such that 𝑥 ≥ 𝑀" ?
JEE MAIN 2021

A There exists 𝑀 > 0, there exists 𝑥 ∈ 𝑆 such that 𝑥 < 𝑀

B There exists 𝑀 > 0, there exists 𝑥 ∈ 𝑆 such that 𝑥 ≥ 𝑀

C There exists 𝑀 > 0, there exists such that 𝑥 < 𝑀 for all 𝑥 ∈ 𝑆

D There exists 𝑀 > 0, there exists such that 𝑥 ≥ 𝑀 for all 𝑥 ∈ 𝑆

Return To Top
 Quantifiers

Phrases like there exist, for every.

➢ There exists / There is at least one / There is some → ∃.

This is called existential quantifier.

➢ For every / For all / For each → ∀. This is called Universal quantifier.

Examples:

• 𝑝 : For all 𝑥 ∈ ℝ, 𝑥 2 ≥ 0

• 𝑞 : 𝑥 + 3 > 5 for some 𝑥 ∈ 𝑁 or ∃ 𝑥 ∈ 𝑁; 𝑥 + 3 > 5

• 𝑟 : There exists a triangle whose sides are equal.

• 𝑠 : For every natural number 𝑥, 𝑥 + 1 is also a natural number

Return To Top
 Quantifiers

Note

❑ Negation of ‘there exist’ can be ‘there is’ or ‘there is at least

one’ or ‘it is possible to find’ or ‘some’.

❑ Negation of ‘for all’ is ‘not all’.

Return To Top
 If 𝑝 ∶ All triangles are equilateral triangle, then write ∼ 𝑝.

Solution:

Given, 𝑝 : All triangles are equilateral triangle.

⇒ ∼ 𝑝 : There exists a triangle which is not an equilateral triangle

Or, It is false that all triangle are equilateral triangle.

Or, Not all triangles are equilateral triangle.

Return To Top
 Key Takeaways

Conditional Statement:

𝑝 𝑞 𝑝→𝑞 If 𝑝 and 𝑞 are two simple statements, then the

𝑇 𝑇 𝑇 compound statement " if 𝑝 then 𝑞 " is called a
𝑇 𝐹 𝐹 conditional statement or an implication and is
𝐹 𝑇 𝑇 denoted by " 𝑝 → 𝑞 “.
𝐹 𝐹 𝑇

𝑝 ∶ Sonu goes to school

𝑞 ∶ Monu goes to school

𝑝 → 𝑞 ∶ If Sonu goes to school, then Monu goes to school.

Return To Top
 Conditional Statement:

The conditional statement 𝑝 → 𝑞 can be expressed in

different ways, which are given below :

➢ If 𝑝, then 𝑞

➢ 𝑞 if 𝑝

➢ 𝑝 only if 𝑞

➢ 𝑝 is sufficient for 𝑞

➢ 𝑞 is necessary for 𝑝

Return To Top
 Let 𝑝, 𝑞, 𝑟 be three statements such that the truth value of 𝑝 ∧ 𝑞 → ~𝑞 ∨ 𝑟
is 𝐹. Then the truth values of 𝑝, 𝑞, 𝑟 respectively are ∶
JEE MAIN 2020

A 𝐹, 𝑇, 𝐹

B 𝑇, 𝐹, 𝑇

C 𝑇, 𝑇, 𝐹

D 𝑇, 𝑇, 𝑇

Return To Top
 Let 𝑝, 𝑞, 𝑟 be three statements such that the truth value of 𝑝 ∧ 𝑞 → ~𝑞 ∨ 𝑟
is 𝐹. Then the truth values of 𝑝, 𝑞, 𝑟 respectively are ∶
JEE MAIN 2020
Solution:

Given, 𝑝 ∧ 𝑞 → ~𝑞 ∨ 𝑟 is 𝐹
𝑝 𝑞 𝑝→𝑞
If 𝑃 ≡ 𝑝 ∧ 𝑞 and 𝑄 ≡ ~𝑞 ∨ 𝑟 𝑇 𝑇 𝑇
∴ 𝑃 → 𝑄 is 𝐹 𝑇 𝐹 𝐹

⇒ 𝑃 is 𝑇 and 𝑄 is 𝐹 𝐹 𝑇 𝑇
𝐹 𝐹 𝑇
⇒ 𝑝 ∧ 𝑞 is 𝑇 and ~𝑞 ∨ 𝑟 is 𝐹

Return To Top
 Let 𝑝, 𝑞, 𝑟 be three statements such that the truth value of 𝑝 ∧ 𝑞 → ~𝑞 ∨ 𝑟
is 𝐹. Then the truth values of 𝑝, 𝑞, 𝑟 respectively are ∶
JEE MAIN 2020
Solution:

Given, 𝑝 ∧ 𝑞 → ~𝑞 ∨ 𝑟 is 𝐹
𝑝 𝑞 𝑝∨𝑞
⇒ 𝑝 ∧ 𝑞 is 𝑇 and ~𝑞 ∨ 𝑟 is 𝐹 𝑇 𝑇 𝑇
𝑇 𝐹 𝑇
⇒ 𝑝 is 𝑇 ⇒ ~𝑞 is 𝐹
𝐹 𝑇 𝑇
and 𝑞 is 𝑇 and 𝑟 is 𝐹
𝐹 𝐹 𝐹
⇒ 𝑝 is 𝑇, 𝑞 is 𝑇 and 𝑟 is 𝐹

Return To Top
 Let 𝑝, 𝑞, 𝑟 be three statements such that the truth value of 𝑝 ∧ 𝑞 → ~𝑞 ∨ 𝑟
is 𝐹. Then the truth values of 𝑝, 𝑞, 𝑟 respectively are ∶
JEE MAIN 2020

A 𝐹, 𝑇, 𝐹

B 𝑇, 𝐹, 𝑇

C 𝑇, 𝑇, 𝐹

D 𝑇, 𝑇, 𝑇

Return To Top
 Key Takeaways

Converse, Contrapositive and Inverse of a Conditional Statement:

➢ The converse of 𝑝 → 𝑞 is 𝑞 → 𝑝

➢ The contrapositive of 𝑝 → 𝑞 is ~𝑞 → ~𝑝

➢ The inverse of 𝑝 → 𝑞 is ~𝑝 → ~𝑞

Return To Top
 Key Takeaways

Converse, Contrapositive and Inverse of a Conditional Statement:

Example:
𝑝 ∶ A man is rich. 𝑞 ∶ A man is happy.

𝑝 → 𝑞 ∶ If a man is rich, then a man is happy.

The converse of 𝑝 → 𝑞 is 𝑞 → 𝑝 i.e.,

𝑞 → 𝑝 ∶ If a man is happy, then a man is rich.

The contrapositive of 𝑝 → 𝑞 is ~𝑞 → ~𝑝 i.e.,

~𝑞 → ~𝑝 ∶ If a man is not happy, then a man is not rich.

The inverse of 𝑝 → 𝑞 is ~𝑝 → ~𝑞 i.e.,

~𝑝 → ~𝑞 ∶ If a man is not rich, then a man is not happy.
Return To Top
 Let 𝐴, 𝐵, 𝐶 and 𝐷 be four non-empty sets. The contrapositive
statement of "If 𝐴 ⊆ 𝐵 and 𝐵 ⊆ 𝐷, then 𝐴 ⊆ 𝐶" is :
JEE MAIN 2020

A If 𝐴 ⊆ 𝐶, then 𝐵 ⊂ 𝐴 or 𝐷 ⊂ 𝐵

B If 𝐴 ⊆ 𝐶, then 𝐴 ⊆ 𝐵 and 𝐵 ⊆ 𝐷

C If 𝐴 ⊆ 𝐶, then 𝐴 ⊆ 𝐵 and 𝐵 ⊆ 𝐷

D If 𝐴 ⊆ 𝐶, then 𝐴 ⊆ 𝐵 or 𝐵 ⊆ 𝐷

Return To Top
 Let 𝐴, 𝐵, 𝐶 and 𝐷 be four non-empty sets. The contrapositive
statement of "If 𝐴 ⊆ 𝐵 and 𝐵 ⊆ 𝐷, then 𝐴 ⊆ 𝐶" is :
JEE MAIN 2020
Solution:

Let the statement 𝐴 ⊆ 𝐵 be 𝑝, 𝐵 ⊆ 𝐷 be 𝑞 and 𝐴 ⊆ 𝐶 be 𝑟.

The logical statement is: 𝑝 ∧ 𝑞 ⇒ 𝑟

The contrapositive of above statement is: ~r ⇒ ~ 𝑝 ∧ 𝑞

⇒ ~𝑟 ⇒ ~𝑝 ∨ ~𝑞

∴ The contrapositive of the given statement is:

“If 𝐴 ⊈ 𝐶, then 𝐴 ⊈ 𝐵 or 𝐵 ⊈ 𝐷”

Return To Top
 Let 𝐴, 𝐵, 𝐶 and 𝐷 be four non-empty sets. The contrapositive
statement of "If 𝐴 ⊆ 𝐵 and 𝐵 ⊆ 𝐷, then 𝐴 ⊆ 𝐶" is :
JEE MAIN 2020

A If 𝐴 ⊆ 𝐶, then 𝐵 ⊂ 𝐴 or 𝐷 ⊂ 𝐵

B If 𝐴 ⊆ 𝐶, then 𝐴 ⊆ 𝐵 and 𝐵 ⊆ 𝐷

C If 𝐴 ⊆ 𝐶, then 𝐴 ⊆ 𝐵 and 𝐵 ⊆ 𝐷

D If 𝐴 ⊆ 𝐶, then 𝐴 ⊆ 𝐵 or 𝐵 ⊆ 𝐷

Return To Top
 Session 02
Validity of Statement,
Fallacy and Tautology

Return To Top
 Note:

➢ 𝑝 → 𝑞 is logically equivalent to ~𝑝 ∨ 𝑞.

➢ 𝑝 → 𝑞 is logically equivalent to ~𝑞 → ~𝑝.

𝑝 𝑞 𝑝→𝑞 ~𝑝 ~𝑝 ∨ 𝑞 ~𝑞 ~𝑞 → ~𝑝
𝑇 𝑇 𝑇 𝐹 𝑇 𝐹 𝑇
𝑇 𝐹 𝐹 𝐹 𝐹 𝑇 𝐹
𝐹 𝑇 𝑇 𝑇 𝑇 𝐹 𝑇
𝐹 𝐹 𝑇 𝑇 𝑇 𝑇 𝑇

➢ ~ 𝑝 → 𝑞 = ~ ~𝑝 ∨ 𝑞 = 𝑝 ∧ ~𝑞

~ 𝑝 ∨ 𝑞 = ~𝑝 ∧ ~𝑞

Return To Top
 The Boolean expression (𝑝 ∧∼ 𝑞) ⇒ (𝑞 ∨∼ 𝑝) is equivalent to

JEE MAIN 2021

A 𝑞⇒𝑝

B 𝑝⇒𝑞

C 𝑝 ⇒ ~𝑞

D ~𝑞 ⇒ 𝑝

Return To Top
 The Boolean expression (𝑝 ∧∼ 𝑞) ⇒ (𝑞 ∨∼ 𝑝) is equivalent to
Solution: JEE MAIN 2021

∵ 𝑝 ⇒ 𝑞 is ~𝑝 ∨ 𝑞

∴ 𝑝 ∧∼ 𝑞 ⇒ 𝑞 ∨∼ 𝑝 = ~ 𝑝 ∧∼ 𝑞 ∨ 𝑞 ∨∼ 𝑝

= ~𝑝 ∨ 𝑞 ∨ ∼ 𝑝 ∨ 𝑞

= ~𝑝 ∨ 𝑞

=𝑝⇒𝑞

Thus, 𝑝 ∧∼ 𝑞 ⇒ 𝑞 ∨∼ 𝑝 = 𝑝 ⇒ 𝑞

Return To Top
 The Boolean expression (𝑝 ∧∼ 𝑞) ⇒ (𝑞 ∨∼ 𝑝) is equivalent to

JEE MAIN 2021

A 𝑞⇒𝑝

B 𝑝⇒𝑞

C 𝑝 ⇒ ~𝑞

D ~𝑞 ⇒ 𝑝

Return To Top
 Consider the statement ‘‘The match will be played only if the
weather is good and ground is not wet’’. Select the correct
negation from the following
JEE MAIN 2021

A The match will not be played or weather is

good and ground is not wet

B The match will be played and weather is

not good or ground is wet

C The match will not be played and

weather is not good and ground is wet

D If the match will not be played, then either

weather is not good or ground is wet

Return To Top
 Consider the statement ‘‘The match will be played only if the
weather is good and ground is not wet’’. Select the correct
negation from the following
Solution: JEE MAIN 2021
Consider the statements,
𝑝: match will be played
𝑞: weather is good
𝑟: ground is not wet

∴ 𝑝 → (𝑞 ∧ 𝑟)

Now, negation of the given statement is: ~ 𝑝 → 𝑞 ∧ 𝑟

= 𝑝 ∧ ~(𝑞 ∧ 𝑟)

= 𝑝 ∧ (~𝑞 ∨ ~𝑟)

𝑝 ∧ ~𝑞 ∨ ~𝑟 : The match will be played and

weather is not good or ground is wet.
Return To Top
 Consider the statement ‘‘The match will be played only if the
weather is good and ground is not wet’’. Select the correct
negation from the following
JEE MAIN 2021

A The match will not be played or weather is

good and ground is not wet

B The match will be played and weather is

not good or ground is wet

C The match will not be played and

weather is not good and ground is wet

D If the match will not be played, then either

weather is not good or ground is wet

Return To Top
 Key Takeaways

Biconditional Statement:

𝑝 𝑞 𝑝→𝑞 𝑞→𝑝 𝑝↔𝑞 If 𝑝 and 𝑞 are two simple statements,

𝑇 𝑇 𝑇 𝑇 𝑇 then the compound statement "𝑝 if and
𝑇 𝐹 𝐹 𝑇 𝐹 only if 𝑞" is called a biconditional
𝐹 𝑇 𝑇 𝐹 𝐹 statement and is denoted as "𝑝 ↔ 𝑞"
𝐹 𝐹 𝑇 𝑇 𝑇 ➢ 𝑝 ↔ 𝑞 = 𝑝 → 𝑞 ∧ (𝑞 → 𝑝)

Return To Top
 Biconditional Statement:
Example:

𝑝 ∶ One is less than seven

𝑞 ∶ Two is less than eight
𝑝 ↔ 𝑞 ∶ “One is less than seven, if and only
if two is less than eight.”

Note:

➢ 𝑝 ↔ 𝑞 = 𝑝 → 𝑞 ∧ 𝑞 → 𝑝 = ~𝑝 ∨ 𝑞 ∧ ~𝑞 ∨ 𝑝

➢ ~ 𝑝 ↔ 𝑞 = ~ ~𝑝 ∨ 𝑞 ∧ ~𝑞 ∨ 𝑝

= ~ ~𝑝 ∨ 𝑞 ∨ ~ ~𝑞 ∨ 𝑝

= (𝑝 ∧ ~𝑞) ∨ 𝑞 ∧ ~𝑝

➢ 𝑝 ↔ 𝑞 = ~𝑝 ↔ ~𝑞
Return To Top
➢ Truth table for ~𝑝 ↔ 𝑞 i.e. (~𝑝 → 𝑞) ∧ (𝑞 → ~𝑝)
 Let 𝑝 : "𝑥 is an irrational number”, 𝑞 : "𝑦 is a transcendental number“ and 𝑟 : "𝑥
is a rational number iff 𝑦 is a transcendental number " .
𝑆1 ∶ 𝑟 ≡ either 𝑞 or 𝑝. 𝑆2 ∶ 𝑟 ≡ ~ 𝑝 ↔ ~𝑞 .
AIEEE 2008
Solution: Given Statements are:
A 𝑆1 is true, 𝑆2 is false.
𝑆1 ∶ 𝑟 ≡ either 𝑞 or 𝑝 𝑆2 ∶ 𝑟 ≡ ~ 𝑝 ↔ ~𝑞
According to question, 𝑟 ≡ ~𝑝 ↔ 𝑞 B Both 𝑆1 and 𝑆2 are false.

𝑝 𝑞 ~𝑝 ~𝑝 ↔ 𝑞 𝑝∨𝑞
C 𝑆1 is true, 𝑆2 is true ;
𝑇 𝑇 𝐹 𝐹 𝑇 𝑆2 is the correct explanation of 𝑆1 .

𝑇 𝐹 𝐹 𝑇 𝑇 D 𝑆1 is true, 𝑆2 is true ;
𝑆2 is not the correct explanation of 𝑆1 .
𝐹 𝑇 𝑇 𝑇 𝑇
𝐹 𝐹 𝑇 𝐹 𝐹
𝑆1 ∶ 𝑟 ≡ either 𝑞 or 𝑝 𝑆2 ∶ 𝑟 ≡ ~ 𝑝 ↔ ~𝑞
Return To Top For 𝑆2 , = ~ 𝑝 ↔ ~𝑞 = ~ ~𝑝 ↔ 𝑞 = ~𝑟
 Key Takeaways

Validity of Statements

• Validity of a statement means checking its truth values.

AND 𝑝 ∧ 𝑞 is true only when both 𝑝 and 𝑞 are true.

OR 𝑝 ∨ 𝑞 is true when at least one of 𝑝 and 𝑞 is true.

Example: Check the validity of the statement : “100 is a multiple of 4 and 5.”

Solution: Let 𝑟 ∶ 100 is a multiple of 4 and 5

Let 𝑝: 100 is a multiple of 4 → T
𝑞: 100 is a multiple of 5 → T
𝑟 =𝑝∧𝑞 ∴ 𝑟 is true
Return To Top
 Key Takeaways

Validity of Statements

IF-THEN 𝑝 → 𝑞 is true if whenever 𝑝 is true, 𝑞 is also true.

To show 𝑝 → 𝑞 is true, we can adopt the following methods :

𝑎) Direct Method :
Assume 𝑝 is true and show 𝑞 is true.

𝑏) Contrapositive Method :

Assume ~𝑞 is true and show ~𝑝 is true ,i.e. ~𝑞 → ~𝑝

𝑐) Contradiction Method :
Assume that 𝑝 is true and 𝑞 is false and obtain a contradiction
from assumption.
Return To Top
 Prove the following statements :

“If 𝑛 is positive integer and 3 divides 𝑛2 , then 3 divides 𝑛.”

Return To Top
 Prove the following statements :

“If 𝑛 is positive integer and 3 divides 𝑛2 , then 3 divides 𝑛.”

Solution:
Let 𝑝 ∶ 3 divides 𝑛2 𝑞 ∶ 3 divides 𝑛

To prove 𝑝 → 𝑞, we can use contrapositive method, i.e., ~𝑞 → ~𝑝

Let ~𝑞 be true. ⇒ 3 does not divide 𝑛

⇒ 𝑛 = 3𝑘 + 1 𝑛 = 3𝑘 + 2 where 𝑘 ∈ 𝕀

⇒ 𝑛2 = 3𝑘 + 1 2 or 𝑛2 = 3𝑘 + 2 2

⇒ 𝑛2 = 9𝑘2 + 6𝑘 + 1 or 𝑛2 = 9𝑘2 + 12𝑘 + 4

⇒ 𝑛2 = 3 3𝑘2 + 2𝑘 + 1 or 𝑛2 = 3 3𝑘2 + 4𝑘 + 1 + 1
⇒ 3 does not divide 𝑛2 ⇒ ~𝑝 is true ⇒ ~𝑞 → ~𝑝 is T ⇒ 𝑝 → 𝑞 is T

Return To Top
 Validity of Statements

IF AND ONLY IF 𝑝 ↔ 𝑞 is true when

𝑖) Show if 𝑝 is true then 𝑞 is true 𝑝 → 𝑞

𝑖𝑖) Show if 𝑞 is true then 𝑝 is true 𝑞 → 𝑝

Note

To prove a given statement is false (or invalid) it is sufficient to give a counter example.
But validity (or truth) of a statement cannot be established by giving examples.

Example:

If 𝑛 is odd, then 𝑛 is prime

But for 𝑛 = 9, 𝑛 is odd but 𝑛 is not prime. Hence the statement is false.

Return To Top
 Key Takeaways

Tautology and Fallacy

Tautology Fallacy

A compound statement is called a A compound statement is called a fallacy

tautology if it is always true 𝑇 for all (contradiction) if it is always false 𝐹 for all
possible truth values of its possible truth values of its compound
compound statements. statements.

Negation of a tautology is a fallacy. Negation of a fallacy is a tautology.

Return To Top
 Show that 𝑝→(𝑝∨𝑞) is a tautology.

Solution:

𝑝 𝑞 𝑝∨𝑞 𝑝 → 𝑝∨𝑞

𝑇 𝑇 𝑇 𝑇

𝑇 𝐹 𝑇 𝑇

𝐹 𝑇 𝑇 𝑇

𝐹 𝐹 𝐹 𝑇

Thus, 𝑝 → 𝑝 ∨ 𝑞 is always true.

∴ 𝑝 → 𝑝 ∨ 𝑞 is a tautology.

Return To Top
 Show that 𝑝→(𝑝∨𝑞) is a tautology.

Solution:

𝑝 → 𝑝∨𝑞

Let us assume this is false.

⇒ 𝑝 is 𝑇 and 𝑝 ∨ 𝑞 is 𝐹

But if 𝑝 is 𝑇 , 𝑝 ∨ 𝑞 can’t be 𝐹

∴ 𝑝 → 𝑝 ∨ 𝑞 is a tautology.

Return To Top
 Key Takeaways

Algebra of Statements Similarity to Sets:

• 𝑝 ∨ 𝑝 ≡ 𝑝, 𝑝 ∧ 𝑝 ≡ 𝑝 Idempotent Law 𝐴 ∪ 𝐴 = 𝐴, 𝐴 ∩ 𝐴 = 𝐴

• 𝑝 ∨ ~𝑝 ≡ 𝑡, 𝑝 ∧ ~𝑝 ≡ 𝑓 𝐴 ∪ 𝐴𝑐 = 𝕌, 𝐴 ∩ 𝐴𝑐 = 𝜙
Complement Law
~ ~𝑝 ≡ 𝑝, ~𝑡 ≡ 𝑓, ~𝑓 ≡ 𝑡 𝐴𝑐 𝑐 =𝐴

• 𝑝 ∧ 𝑡 ≡ 𝑝, 𝑝 ∨ 𝑡 ≡ 𝑡 𝐴 ∩ 𝕌 = 𝐴, 𝐴 ∪ 𝕌 = 𝕌
Identity Law
𝑝 ∧ 𝑓 ≡ 𝑓, 𝑝 ∨ 𝑓 ≡ 𝑝 𝐴 ∩ 𝜙 = 𝜙, 𝐴 ∪ 𝜙 = 𝐴

• 𝑝 ∧ 𝑞 ≡ 𝑞 ∧ 𝑝, 𝑝 ∨ 𝑞 ≡ 𝑞 ∨ 𝑝 Commutative Law 𝐴 ∩ 𝐵 = 𝐵 ∩ 𝐴, 𝐴 ∪ 𝐵 = 𝐵 ∪ 𝐴

Return To Top
 Key Takeaways

Algebra of Statements Similarity to Sets:

• 𝑝∧ 𝑞 ∧𝑟 ≡ 𝑝∧ 𝑞∧𝑟 𝐴∩𝐵 ∩𝐶 = 𝐴∩ 𝐵∩𝐶

Associative Law
𝑝∨ 𝑞 ∨𝑟 ≡ 𝑝∨ 𝑞∨𝑟 𝐴∪𝐵 ∪𝐶 = 𝐴∪ 𝐵∪𝐶

• 𝑝 ∧ 𝑞∨𝑟 ≡ 𝑝∧𝑞 ∨ 𝑝∧ 𝑟 𝐴∩ 𝐵∪𝐶 = 𝐴∩𝐵 ∪ 𝐴∩𝐶

Distributive Law
𝑝∨ 𝑞∧𝑟 ≡ 𝑝∨𝑞 ∧ 𝑝∨ 𝑟 𝐴∪ 𝐵∩𝐶 = 𝐴∪𝐵 ∩ 𝐴∪𝐶

𝑐 = 𝐴𝑐 ∩ 𝐵𝑐
• ~ 𝑝 ∨ 𝑞 ≡ ~𝑝 ∧ ~𝑞 𝐴∪𝐵
De-Morgan’s Law
𝑐
~ 𝑝 ∧ 𝑞 ≡ ~𝑝 ∨ ~𝑞 𝐴∩𝐵 = 𝐴𝑐 ∪ 𝐵𝑐

• 𝑝 → 𝑞 ≡ ~𝑝 ∨ 𝑞
Condition Law
𝑝 ↔ 𝑞 ≡ ~𝑝 ∨ 𝑞 ∧ ~𝑞 ∨ 𝑝

Return To Top
 The statement ~ 𝑝 ↔ ~𝑞 is:
JEE MAIN 2014

A Equivalent to 𝑝 ↔ 𝑞

B Equivalent to ~𝑝 ↔ 𝑞

C A tautology

D A fallacy

Return To Top
 The statement ~ 𝑝 ↔ ~𝑞 is:
Solution: JEE MAIN 2014

We know, 𝑝 ↔ 𝑞 = (𝑝 ∧ 𝑞) ∨ ~𝑝 ∧ ~𝑞

𝑝 ↔ ~𝑞 = (𝑝 → ~𝑞) ∧ ~𝑞 → 𝑝

⇒ 𝑝 ↔ ~𝑞 = (~𝑝 ∨ ~𝑞) ∧ 𝑞 ∨ 𝑝

⇒ ~ 𝑝 ↔ ~𝑞 = ~ ~𝑝 ∨ ~𝑞 ∧ 𝑞 ∨ 𝑝

⇒ ~ 𝑝 ↔ ~𝑞 = (𝑝 ∧ 𝑞) ∨ ~𝑝 ∧ ~𝑞

⇒ ~ 𝑝 ↔ ~𝑞 = 𝑝 ↔ 𝑞

Return To Top
 The statement ~ 𝑝 ↔ ~𝑞 is:
JEE MAIN 2014

A Equivalent to 𝑝 ↔ 𝑞

B Equivalent to ~𝑝 ↔ 𝑞

C A tautology

D A fallacy

Return To Top
 The Boolean expression ∼ 𝑝 ∧ 𝑞 ∨ 𝑞 is equivalent to:
JEE MAIN 2022

A 𝑞 → (𝑝 ∧ 𝑞)

B 𝑝→𝑞

C 𝑝→ 𝑝→𝑞

D 𝑝 → 𝑝∨𝑞

Return To Top
 The Boolean expression ∼ 𝑝 ∧ 𝑞 ∨ 𝑞 is equivalent to:
Solution: JEE MAIN 2022

𝑝 𝑞 𝑝∧𝑞 ~(𝑝 ∧ 𝑞) (~ 𝑝 ∧ 𝑞 ) ∨ 𝑞 𝑝∨𝑞 𝑝→𝑞 𝑝→ 𝑝→𝑞

𝑇 𝑇 𝑇 𝐹 𝑇 𝑇 𝑇 𝑇

𝑇 𝐹 𝐹 𝑇 𝑇 𝑇 𝐹 𝑇

𝐹 𝑇 𝐹 𝑇 𝑇 𝑇 𝑇 𝑇

𝐹 𝐹 𝐹 𝑇 𝑇 𝐹 𝑇 𝑇

Tautology Tautology

∴ ∼ 𝑝∧𝑞 ∨𝑞 ≡ 𝑝 → 𝑝∨𝑞

Return To Top
 The Boolean expression ∼ 𝑝 ∧ 𝑞 ∨ 𝑞 is equivalent to:
Solution: JEE MAIN 2022

A 𝑞 → (𝑝 ∧ 𝑞)

B 𝑝→𝑞

C 𝑝→ 𝑝→𝑞

D 𝑝 → 𝑝∨𝑞

Return To Top
 Which of the following statement is a tautology?

JEE MAIN 2022

A ((∼ 𝑞) ∧ 𝑝) ∧ 𝑞

B ∼ 𝑞 ∧ 𝑝 ∧ 𝑝∧ ∼ 𝑝

C ∼ 𝑞 ∧ 𝑝 ∨ 𝑝∨ ∼ 𝑝

D 𝑝∧ 𝑞 ∧ ∼ 𝑝∧ 𝑞

Return To Top
 Which of the following statement is a tautology?
Solution: JEE MAIN 2022

∵ ∼ 𝑞 ∧ 𝑝 ∨ 𝑝∨ ∼ 𝑝

= ∼ 𝑞∧ 𝑝 ∨𝑡

=𝑡

Therefore, option (C) is the correct one.

Return To Top
 Which of the following statement is a tautology?

JEE MAIN 2022

A ((∼ 𝑞) ∧ 𝑝) ∧ 𝑞

B ∼ 𝑞 ∧ 𝑝 ∧ 𝑝∧ ∼ 𝑝

C ∼ 𝑞 ∧ 𝑝 ∨ 𝑝∨ ∼ 𝑝

D 𝑝∧ 𝑞 ∧ ∼ 𝑝∧ 𝑞

Return To Top
 The proposition 𝑝 → ~ 𝑝 ∧ ~𝑞 is equivalent to
JEE MAIN 2020

A (~𝑝) ∨ (~𝑞)

B (~𝑝) ∧ 𝑞

C 𝑞

D (~𝑝) ∨ 𝑞

Return To Top
 The proposition 𝑝 → ~ 𝑝 ∧ ~𝑞 is equivalent to

Solution: JEE MAIN 2020

Given, 𝑝 → ~ 𝑝 ∧ ~𝑞 ~ 𝑝 ∧ 𝑞 ≡ ~𝑝 ∨ ~𝑞

⇒ 𝑝 → ~𝑝 ∨ ~ ~𝑞 𝑝 → 𝑞 ≡ ~𝑝 ∨ 𝑞

⇒ 𝑝 → ~𝑝 ∨ 𝑞 ≡ ~𝑝 ∨ ~𝑝 ∨ 𝑞

≡ ~𝑝 ∨ ~𝑝 ∨𝑞

≡ ~𝑝 ∨ 𝑞

Return To Top
 The proposition 𝑝 → ~ 𝑝 ∧ ~𝑞 is equivalent to
JEE MAIN 2020

A (~𝑝) ∨ (~𝑞)

B (~𝑝) ∧ 𝑞

C 𝑞

D (~𝑝) ∨ 𝑞

Return To Top
 THANK
YOU

Return To Top