Module 1.

3 – Negation
Statements and Conditionals
GED0103 Mathematics in the Modern World
Learning Outcomes
At the end of the lesson, you will be able to:
• apply negation to mathematical statements;
• analyze the different forms of conditional statements; and
• formulate statements equivalent to negations and conditionals.
Lesson Outline
We shall discuss the negations of the following:
Negation of Statements
• Simple Statements

• Statements with Quantifiers

• Compound Statements

Conditional Statements
• Forms of Conditional Statements
• Equivalent Conditionals
Negation Statements
Simple Statements
Recall: The truth of value of a negated statement is the opposite of the
truth value of the original.
To negate simple statements, we just get the “otherwise” of the
statements.
Examples
p : The ball is black
∼ p : The ball is NOT black

q:1+1=0

(one plus one is equal to zero)

∼ q : 1 + 1 ≠ 0 (one plus one is NOT equal to zero)

r:𝑥 >3

(x is greater than 3)

~r : 𝑥 ≤ 3 (x is less than or equal to 3. or x is NOT greater than 3)

Statements with Quantifiers
We now consider statements with the quantifiers all, some, and none.
Examples: The following are statements with quantifiers.
p : All FEU students are smart.
q : Some FEU students are smart.
r : No FEU student is lazy.
Statements with Quantifiers
p : All FEU students are smart.
• ∼ p : NOT all FEU students are smart.
• ∼ p : Some FEU students are NOT smart.
Statements with Quantifiers
q : Some FEU students are smart.
• ∼ q : No FEU student is smart.
• ∼ q : All FEU students are NOT smart.
Statements with Quantifiers
r : No FEU student is lazy.
• ∼ r : There is an FEU student who is lazy.
• ∼ r : Some FEU students are lazy.

Note: We can also write

• r : All FEU students are NOT lazy.
• ∼ r : Some FEU students are lazy.
Compound Statements
Note that the truth value of a negated compound statement is the opposite
of the truth value of the compound statement.
𝒑∧𝒒
T

~(𝒑 ∧ 𝒒)
F

𝒑∨𝒒
T

~(𝒑 ∨ 𝒒)
F

T
De Morgan’s Law
The De Morgan’s Laws states the following.
• The negation of a conjunction is the disjunction of the negations.
• The negation of a disjunction is the conjunction of the negations.

~ 𝑝 ∧ 𝑞 ⟺ ~𝑝 ∨ ~𝑞

~ 𝑝 ∨ 𝑞 ⟺ ~𝑝 ∧ ~𝑞
Proof:

~ 𝑝 ∧ 𝑞 ⟺ ~𝑝 ∨ ~𝑞
~ 𝑝 ∨ 𝑞 ⟺ ~𝑝 ∧ ~𝑞

𝒑
T
T
F
F

𝒒
T
F
T
F

𝒑∧𝒒

~(𝒑 ∧ 𝒒)

~𝒑

~𝒒

~𝒑 ∨ ~𝒒

𝒑
T

𝒒
T

𝒑∨𝒒

~(𝒑 ∨ 𝒒)

~𝒑

~𝒒

~𝒑 ∧ ~𝒒

T
F
F

F
T
F
Proof:

~ 𝑝 ∧ 𝑞 ⟺ ~𝑝 ∨ ~𝑞
~ 𝑝 ∨ 𝑞 ⟺ ~𝑝 ∧ ~𝑞

𝒑
T
T
F
F

𝒒
T
F
T
F

𝒑∧𝒒
T
F
F
F

~(𝒑 ∧ 𝒒)
F
T
T
T

~𝒑
F
F
T
T

~𝒒
F
T
F
T

~𝒑 ∨ ~𝒒
F
T
T
T

𝒑
T

𝒒
T

𝒑∨𝒒
T

~(𝒑 ∨ 𝒒)
F
~𝒑
F

~𝒒
F

~𝒑 ∧ ~𝒒
F

T
F
F

F
T
F

T
T
F

F
F
T

F
T
T

T
F
T

F
F
T
Examples: Consider the following mathematical statements.
p : Today is Saturday.
q : All cats are animals.
Then we have the following negations.
• ∼ p : Today is not Saturday.
• ∼ q : Some cats are not animals.

Hence, we obtain
∼ (p ∧ q) ⟺ ∼ p ∨ ∼ q:
• Today is not Saturday OR some cats are not animals.

∼ (p ∨ q) ⟺ ∼ p ∧ ∼ q:
• Today is not Saturday AND some cats are not animals.
Examples: Consider the following mathematical statements.
p : The ball is black
q : The ball is white
Then we have the following negations.
• ∼ p : The ball is not black
• ∼ q : The ball is not white

Hence, we obtain
∼ (p ∧ q) ⟺ ∼ p ∨ ∼ q:
• The ball is not black OR The ball is not white.

(not p and not q)

• The ball is neither black nor white.

(neither p nor q)
Conditional Statements
Conditional Statements
Recall: A conditional statement is false only if the premise is true but the
conclusion is false.
Some of the other forms of the conditional: if p, then q
• q, if p
• q only if p
• p implies q

Note: We can rewrite the characterization “if p then q” as "all p are q"
Let p and q be mathematical statements.
Given the conditional p → q, we have the following:
• Converse: q → p
• Inverse: ∼ p →∼ q
• Contrapositive: ∼ q →∼ p.
Consider the CONDITIONAL
p → q : If my pet is a dog, then my pet is a mammal.
Here, we have
• p : My pet is a dog.
• q : My pet is a mammal.

CONVERSE:
INVERSE :

𝑞 → 𝑝:
~𝑝 → ~𝑞:

If my pet is a mammal then my pet is a dog.

If my pet is not a dog then

my pet is not a mammal.

CONTRAPOSITIVE : ~𝑞 → ~𝑝:

If my pet is not a mammal then

my pet is not a dog.
Consider the CONDITIONAL
~p → q : If my pet is not a dog, then my pet is a mammal.
CONVERSE:

𝑞 → ~𝑝:
If my pet is a mammal then my pet is not a dog.

INVERSE :

~ ~𝑝 → ~𝑞 ⟹ 𝑝 → ~𝑞:
If my pet is a dog then my pet is not a mammal.

CONTRAPOSITIVE : ~𝑞 → ~ ~𝑝 ⟹ ~𝑞 → 𝑝:
If my pet is not a mammal then my pet is a dog.
Equivalent Conditionals
𝒑

~𝒑

~𝒒

𝒑→𝒒

𝒒→𝒑

~𝒑 → ~𝒒 ~𝒒 → ~𝒑
Equivalent Conditionals
𝒑

~𝒑

~𝒒

𝒑→𝒒

𝒒→𝒑

~𝒑 → ~𝒒 ~𝒒 → ~𝒑

F
F

T
Equivalent Conditionals
𝒑

~𝒑

~𝒒

𝒑→𝒒

𝒒→𝒑

~𝒑 → ~𝒒 ~𝒒 → ~𝒑

F
F

T
Thus we have the following equivalences:
The conditional is equivalent to its contrapositive:

𝑝→𝑞

⟺ ~𝑞 → ~𝑝

The converse of a conditional is equivalent to the inverse of the conditional

𝑞→𝑝

⟺ ~ 𝑝 → ~𝑞
Example
All roses are red. ⟺ If it is a rose, then it is red.
• p : It is a rose.
• q : It is red.

Thus, the conditional

p → q : If it is a rose, then it is red.

⟺ ∼ q →∼ p : If it is not red, then it is a not a rose.

⟺ ~ p ∨ q : Either it is not a rose or it is red.
Example
All dogs bark. ⟺ If it is a dog, then it barks.
• p : It is a dog.
• q : It barks.

Therefore, the conditional

p → q : If it is a dog, then it barks.

⟺ ∼ q →∼ p : If it does not bark, then it is a not a dog.

⟺ ∼ p ∨ q :Either it is not a dog or it barks.