Logic Statements

One of the first mathematicians to make a

serious study of symbolic logic was Gottfried Wilhelm
Leibniz (1646–1716). Leibniz tried to advance the study of
logic from a merely philosophical subject to a formal
mathematical subject. Leibniz never completely
achieved this goal; however, several mathematicians,
such as Augustus De Morgan (1806–1871) and George
Boole (1815–1864), contributed to the advancement of
symbolic logic as a mathematical discipline.
Logic Statements

Boole published The

Mathematical Analysis of Logic in
1848. In 1854 he published the more
extensive work, An Investigation of
the Laws of Thought. Concerning
this document, the mathematician
Bertrand Russell stated, “Pure George Boole
mathematics was discovered by Born in Lincoln,
Boole in a work which is called The England in 1815.
Laws of Thought.”
Logic – a science of correct, critical reasoning.
– a belief that is supported by factual evidence.

Every language contains different types of sentences, such as

statements, questions, and commands. For instance,

“Is the test today?” is a question.

“Go get the newspaper” is a command.
“This is a nice car” is an opinion.
“Denver is the capital of Colorado” is a statement of fact.
A Statement is a declarative sentence that is either true or false,
but not both true and false.

Example Determine whether each sentence is a statement.

a. Davao City is a city in the Philippines. Answer: true statement
Answer: This is not a declarative sentence.
b. How are you? Thus it is not a statement

c. 2 is a negative number. Answer: false statement

The Truth value of a statement is either true (T) or False (F),

according to whether a statement is true or false.
➢ The sentence ``𝑥 + 3 = 7"is not a statement, but if we assign a
value for 𝑥, then it becomes a statement.

A sentence like this with a

variable is called an open
sentence.

Open sentence – a sentence involving one or more variables,

which becomes true or false when the variables are assigned
specific values.
Notation:
𝑝𝑥 , 𝑞𝑥 , 𝑟𝑥 , ⋯ denotes an open sentence involving variable 𝑥
𝑝𝑥,𝑦 , 𝑞𝑥,𝑦 , 𝑟𝑥,𝑦,𝑧 , ⋯ denotes an open sentence involving more than 1 variable
Truth Set – the set of all values that will make an open sentence
true.

Example

OPEN SENTENCE TRUTH SET

𝑥+1=5 {4}
2𝑥 − 3 = 9 {6}
𝑥 is a negative number such that 𝑥 2 = 4 {−2}
𝑥 is an integer such that 𝑥 2 = −16 𝑜𝑟 ∅
𝑥 2 − 25 = 𝑥 − 5 𝑥 + 5 , where 𝑥 is real The set of real numbers
A statement can be simple or compound. A simple statement is a
statement that conveys a single idea. A compound statement is
a statement that conveys two or more ideas.
Example

SIMPLE STATEMENT COMPOUND STATEMENT

The highest mountain in the The highest mountain in the

Philippines is Mt. Apo, and the second
Philippines is Mt. Apo. highest mountain is Mt. Pulag.

Cebu is the oldest City in We will go to Camiguin island or

the Philippines. we will go to Mactan island.
To create a compound statement, connectives like and, or, if…
then, and if and only if are used.

The symbols 𝑝, 𝑞, 𝑟 and 𝑠 represent simple statements.

TYPE OF
STATEMENT CONNECTIVES SYMBOLS
STATEMENT

not 𝑝 not ∼𝑝 Negation

𝑝 and 𝑞 and 𝑝∧𝑞 Conjunction
𝑝 or 𝑞 or 𝑝∨𝑞 Disjunction
If 𝑝, ….then 𝑞 if … then 𝑝⟹𝑞 Conditional
𝑝 if and only 𝑞 if and only if 𝑝 ⟺q Biconditional
 The first example of compound statement which is “The
highest mountain in the Philippines is Mt. Apo, and the second
highest mountain is Mt. Pulag.” may be written using the following
symbols:

STATEMENT SYMBOL

The highest mountain in the Philippines is Mt. Apo. 𝑝

The second highest mountain is Mt. Pulag. 𝑞

The highest mountain in the Philippines is Mt. Apo,

𝑝∧𝑞
and the second highest mountain is Mt. Pulag.
Example
Write the second example of compound statement which is
“We will go to Camiguin island or we will go to Mactan island.”
using symbols:

STATEMENT SYMBOL

We will go to Camiguin island. 𝑝

We will go to Mactan island. 𝑞

We will go to Camiguin island or we will go to Mactan

𝑝∨𝑞
island.
Connectives
The negation of a statement 𝑝, denoted by ~𝑝 (to be read as “not
𝑝”), asserts that 𝑝 is false. Thus, if 𝑝 is true, then ~𝑝 is false, and
if 𝑝 is false, then ~𝑝 is true.

Example:

1. If 𝑝: Today is Thursday, then ∼ 𝑝: Today is not Thursday.

2. If 𝑝: 3 + 8 = 5, then ∼ 𝑝: 3 + 8 ≠ 5.
3. If 𝑝: −2 is an odd integer, then ∼ 𝑝: −2 is not an odd integer.

∼ 𝑝: −2 is an even integer.
Truth Table
a table that shows the truth value of a compound
statement for all possible truth values of its simple
statements.

𝒑 ∼𝒑

T F
F T
Connectives
The conjunction of two statements 𝑝 and 𝑞, denoted by 𝑝˄𝑞, is a
statement formed by combining two statements with the word
“and”.

It is true if both 𝑝 and 𝑞 are true.

The disjunction of 𝑝 and 𝑞, denoted by 𝑝˅𝑞, is a statement formed

by combining two statements with the word “or”.

It is true if either 𝑝 or 𝑞 is true.

Truth Tables

𝒑 𝒒 𝒑∧𝒒 𝒑 𝒒 𝒑∨𝒒
T T T T T T
T F F T F T
F T F F T T
F F F F F F
Example Consider the following simple statements.
𝑝: Today is Friday.
q : It is raining.
𝑟 : I am going to a movie.
𝑠 : I am not going to the basketball game.

Write the following compound statements in symbolic form:

a. Today is Friday and it is raining. Answer: 𝑝˄𝑞

b. It is not raining and I am going to a movie. Answer: ~𝑞˄𝑟
c. I am going to the basketball game or
Answer: ~𝑠˅𝑟
I am going to a movie.
In the next example, we translate symbolic statements into English sentences.

Example Consider the following statements:

𝑝 : The game will be played in MSU.
𝑞 : The game will be shown on ABS-CBN.
𝑟 : The game will not be shown on GMA.
𝑠 : The Creamline Cool Smashers are favored to win.

Write each of the following symbolic statements in words:

a. 𝑞˄𝑝 b. ~𝑟˄𝑠
Answers:
a. The game will be shown on ABS-CBN and the game will be played in MSU.
b. The game will be shown on GMA and the Creamline Cool Smashers are
favored to win.
Example Determine whether each statement is true or false.
a. 7  5.
b. 5 is a whole number and 5 is an even number.
c. 2 is a prime number and 2 is an even number.

Solution:

a. 7  5 means 7 > 5 or 7 = 5. Because 7 > 5 is true, the

statement 7  5 is a true statement.
b. This is a false statement because 5 is not an even number.
c. This is a true statement because each simple statement is true.
OPEN SENTENCE TRUTH SET NEGATION TRUTH SET
These identities
𝑝𝑥 ˄𝑞𝑥 𝑃∩𝑄 ~(𝑝𝑥 ˄𝑞𝑥 ) ≡ ~𝑝𝑥 ˅~𝑞𝑥 𝑃are
𝑐 called
∪ 𝑄 𝑐 “De
Morgan’s Laws for
𝑝𝑥 ˅𝑞𝑥 𝑃∪𝑄 ~(𝑝𝑥 ˅𝑞𝑥 ) ≡ ~𝑝𝑥 ˄~𝑞𝑥 𝑃Statements”.
𝑐
∩ 𝑄𝑐

Example: Given 𝑈 = −4, −3, −2, −1,0,1,2,3,4 . Find the negation of the
following and determine the truth sets of each negation:
1. 𝑝𝑥 ˄𝑞𝑥 : 𝑥 2 = 4 and 𝑥 + 5 𝑥 − 2 = 0.
2. 𝑝𝑥 ˅𝑞𝑥 : 𝑥 + 4 = 4 or 𝑥 2 < 5.
3. 𝑥 is odd and 𝑥 is less than 7.
Example: Write the negation of the following sentences.
1. 𝑝𝑥 ∧ 𝑞𝑥
2. 𝑝𝑥 ∨ (𝑞𝑥 ∧ 𝑟𝑥 )
3. ∼ 𝑟𝑥 ∨ 𝑞𝑥

Answers
1. ∼ 𝑝𝑥 ∨∼ 𝑞𝑥
2. ∼ 𝑝𝑥 ∧ (∼ 𝑞𝑥 ∨∼ 𝑟𝑥 )
3. 𝑟𝑥 ∧∼ 𝑞𝑥
Universal and Existential Statements

Universal Statement – a statement that states a property that

is TRUE TO ALL.

Example:
1. ALL positive numbers are greater than zero.
2. For EVERY even integer 𝑥, 𝑥 is divisible by 2.
3. Ang BAWAT ISA ay may pag-asa.
4. Ang LAHAT ng halaman ay nakakain.
Existential Statement – a statement which states that there is
AT LEAST ONE thing for which the property is true.

Example
1. THERE IS a prime number that is even
2. THERE EXIST a number which is divisible by any number except
itself.
3. Mayroon isang tao sa mundo na magmamahal saiyo.
Quantifiers
A quantifier turns an open sentence into a statement without
assigning a specific value/s for the variable.
❖ Let 𝑥 be a variable with domain S and let 𝑝𝑥 be an open sentence.
The expression
∀𝑥 ∈ 𝑆, 𝑝𝑥
is a statement.
► This statement is true, if the open sentence 𝑝𝑥 is true for all values of
𝑥 ∈ 𝑆.
► We read the statement ∀𝑥 ∈ 𝑆, 𝑝𝑥 as
``For all 𝑥 in 𝑆, 𝑝𝑥 ", ``For every 𝑥 in 𝑆, 𝑝𝑥 " or ``For each 𝑥 in 𝑆, 𝑝𝑥 “
► We call the symbol ``∀“ the universal quantifier.
Quantifiers

❖ Let 𝑥 be a variable with domain S and let 𝑝𝑥 be an open sentence.

The expression
∃𝑥 ∈ 𝑆, 𝑝𝑥
is a statement.
► This statement is true, if there exists an element 𝑥 ∈ 𝑆 such that 𝑝𝑥 is
true.
► We read the statement ∃𝑥 ∈ 𝑆, 𝑝𝑥 as
“there is some 𝑥 in 𝑆 such that 𝑝𝑥 ”,
“there is at least one 𝑥 in 𝑆 such that 𝑝𝑥 ”.

► We call the symbol ``∃“ the existential quantifier.

Example. Determine the truth value in each of the following:
1. ∀𝑥 ∈ 1,2,3 : 𝑥 2 is less than 10. True
2. ∀𝑥 ∈ 0,1,2,3 : 𝑥 − 1 is odd. False
3. ∃𝑥 ∈ 10,15,20 : 3𝑥 + 1 is odd. True
4. ∃𝑥 ∈ 2,4,6 : 2𝑥 − 5 = 5. False

5. ∀𝑥, 𝑦 ∈ 1,2,3 : 𝑥 + 𝑦 is prime. False

6. ∃𝑥 ∈ 2,4,6,8 : 𝑥 3 = 2𝑥. False
7. ∀𝑥 ∈ 0,1,2 : 𝑥 2 = 𝑥. False
8. ∃𝑥 ∈ 0,1,2 : 2𝑥 − 1 > 0. True
Negations of ∀𝒙: 𝒑𝒙 and ∃𝒙: 𝒑𝒙

STATEMENT NEGATION
∀𝑥: 𝑝𝑥 ∃𝑥: ~𝑝𝑥
∃𝑥: 𝑝𝑥 ∀𝑥: ~𝑝𝑥

To help us easily negate any quantified statement, the following tables

are useful
STATEMENT NEGATION
All 𝑋 are 𝑌 Some 𝑋 are not 𝑌
No 𝑋 are 𝑌 Some 𝑋 are Y
Some 𝑋 are not 𝑌 All 𝑋 are 𝑌
Some 𝑋 are 𝑌 No 𝑋 are 𝑌
Example: Write the negation of each of the following statements.
a. Some airports are open
b. All movies are worth the price of admission
c. No odd numbers are divisible by 2

Answers
a. No airports are open.
b. Some movies are not worth the price of admission.
c. Some odd numbers are divisible by 2.
Example: Write the negation of each of the following statements
and determine the truth value of each negation.
1. ∃𝑥 ∈ 10,15,20 : 3𝑥 + 1 is an odd integer.
2. ∀𝑥, 𝑦 ∈ 1,2,3 : 𝑥 = 𝑦 + 1.
3. ∃𝑥 ∈ 0,1,2 : 2𝑥 − 1 > 3.
4. ∀𝑥 ∈ 0,1,2,3 : 𝑥 2 is prime.
Answers
False 1. ∀x ∈ 10,15,20 : 3x + 1 is an even integer.
True 2. ∃x, y ∈ 1,2,3 : 𝑥 ≠ 𝑦 + 1.
True 3. ∀x ∈ 0,1,2 : 2𝑥 − 1 ≤ 3.
True 4. ∃x ∈ 0,1,2,3 : 𝑥 2 is not prime.
Connectives

Conditional statements can be written in “if 𝑝, then 𝑞” form or

in “if 𝑝, 𝑞” form.

For instance, all of the following are conditional statements.

1. If we order pizza, then we can have it delivered.
2. If you go to the movie, you will not be able to meet us for
dinner.
3. If 𝑛 is a prime number greater than 2, then 𝑛 is an odd
number.

In any conditional statement represented by “If 𝑝, then 𝑞” or

by “If 𝑝, 𝑞,” the 𝑝 statement is called the antecedent and the 𝑞
statement is called the consequent.
Example Identify the antecedent and consequent in the following
statements:
a. If our school was this nice, I would go there more than
once a week.

Antecedent: our school was this nice

Consequent: I would go there more than once a week

b. If you don’t get in that plane, then you’ll regret it.

Antecedent: you don’t get in that plane

Consequent: you’ll regret it
c. If 2 is even, then 4 is even. e. If 𝑥 = 5, 𝑡ℎ𝑒𝑛 𝑥 2 = 25.

Antecedent: 2 is even Antecedent: 𝑥 = 5

Consequent: 4 is even Consequent: 𝑥 2 = 25

d. If 13 > 7, then 2 + 3 = 5 f. If 𝑥 2 = 9, 𝑡ℎ𝑒𝑛 𝑥 > 0.

Antecedent: 13 > 7 Antecedent: 𝑥 2 = 9

Consequent: 2 + 3 = 5 Consequent: 𝑥 > 0
Equivalent Forms of Conditional Statement

Every conditional statement can be stated in many equivalent forms. It

is not even necessary to state the antecedent before the consequent.
For instance, the conditional
“If I live in Marawi City, then I must live in Lanao del Sur”
can also be stated as
“I must live in Lanao del Sur, if I live in Marawi City.”
The table below lists some of the various forms that may be used to
write conditional statement

CONDITIONAL STATEMENTS
If 𝑝, then 𝑞. Every 𝑝 is a 𝑞.
If 𝑝, 𝑞. 𝑞, if 𝑝.
𝑝 only if 𝑞. 𝑞 provided that 𝑝.
𝑝 implies 𝑞. 𝑞 is necessary condition for 𝑝
Not 𝑝 or 𝑞. 𝑝 is sufficient condition for 𝑞
Example. Write each of the following in “If p, then q” form:

a. The number is an even number provided that it is

divisible by 2.
b. Today is Friday, only if yesterday was Thursday.
c. Jenny is not Lisa’s sister or Jisoo is Lisa’s friend.
d. Being born in Korea is a necessary condition for being a citizen
of Korea.
Answer:

a. The statement, “The number is an even number

provided that it is divisible by 2” is in “q provided that
p” form.
Antecedent: “it is divisible by 2”
Consequent: “the number is an even number”

Thus its “If p, then q” form is

If it is divisible by 2, then the number is an even number.
b. The statement, “Today is Friday, only if yesterday was
Thursday” is in “p only if q” form.

Antecedent: “today is Friday”

Consequent: “yesterday was Thursday”

Thus its “If p, then q” form is

If today is Friday, then yesterday was Thursday.

c. The statement, “Jenny is not Lisa’s sister or Jisoo is Lisa’s friend” is
in “not p or q” form.

Antecedent: “Jenny is Lisa’s sister”

Consequent: “Jisoo is Lisa’s friend”

Thus its “If p, then q” form is

If Jenny is Lisa’s sister, then Jisoo is Lisa’s friend.

d. The statement, “Being born in Korea is a necessary condition for
being a citizen of Korea,” is in “𝑞 is necessary condition for p” form.

Antecedent: “Being a citizen of Korea”

Consequent: “Being born in Korea”

Thus its “If p, then q” form is

If you are a citizen of Korea, then you are born in Korea.

* The conditional statement , “If 𝑝, then 𝑞”, can be written using
the arrow notation “𝑝 ⇒ 𝑞". The arrow notation 𝑝 ⇒ 𝑞 is read as
“if p , then 𝑞” or as “𝑝 implies 𝑞”. The conditional 𝑝 ⇒ 𝑞 is false
only when 𝑝 is true and 𝑞 is false. It is true in all other cases.
Truth Table
𝒑 𝒒 𝒑⇒𝒒
T T T
T F F
F T T
F F T
Note: The conditional ∀𝑥: 𝑝𝑥 ⇒ 𝑞𝑥 is true if and only if 𝑃 ⊆ 𝑄,
where 𝑃 and 𝑄 are truth sets of 𝑝𝑥 and 𝑞𝑥 , respectively.
Example. Determine the truth value of each of the following statement.

1. If 2 is an integer, then 2 is a rational number.

2. If 3 is a negative number, then 5 > 7.
3. If 5 < 3, then 3 + 4 = 7.
4. If 4 ≥ 3, then 2 + 5 = 6.
5. If 23 and 27 are odd numbers, then these are not divisible by 2.
Answer:
1. Conditional Statement: If 2 is an integer, then 2 is a rational number.
Antecedent: “2 is an integer” True
Consequent: “2 is a rational number” True
Therefore, the given conditional statement is true.
2. Conditional Statement: If 3 is a negative number, then 5 > 7.
Antecedent: “3 is a negative number” False
Consequent: “5 > 7” False
Therefore, the given conditional statement is true.

3. Conditional Statement: If 5 < 3, then 3 + 4 = 7.

Antecedent: “5 < 3” False
Consequent: “3 + 4 = 7” True
Therefore, the given conditional statement is true.
4. Conditional Statement: If 4 ≥ 3, then 2 + 5 = 6.
True Antecedent: “4 ≥ 3” (can also be written as 4 > 3 or 4 = 3, a disjunction statement)

False Consequent: “2 + 5 = 6”
Therefore, the given conditional statement is false.
5. Conditional Statement: If 23 and 27 are odd numbers, then these are
not divisible by 2.
True Antecedent: “23 and 27 are odd numbers” (can also be written as 23 is an
odd number and 27 is an odd number , a conjunction statement)

True Consequent: “23 and 27are not divisible by 2” (can also be written as 23
is not divisible by 2 and 27 is not divisible by 2, a conjunction statement)

Therefore, the given conditional statement is true.

Negations of the conditional statement

Recall: The conditional statement 𝑝 ⇒ 𝑞 is equivalent to “not 𝑝 or 𝑞”

which is written in symbolically as ∼ 𝑝 ∨ 𝑞.

It follows that the negation of the conditional statement 𝑝 ⇒ 𝑞 ,

denoted by ∼ 𝑝 ⇒ 𝑞 , can be equivalently written as ∼ ∼ 𝑝 ∨ 𝑞 . By one of
the De Morgan’s Laws, it can be expressed as the conjunction 𝑝 ∧∼ 𝑞.

STATEMENT NEGATION
𝑝⇒𝑞 𝑝 ∧∼ 𝑞
Example. Write the negation of each of the following conditional
statement.

1. If they pay me the money, I will sign the contract.

2. If the lines are parallel, they do not intersect.
3. If 5 > 3, then 3 + 4 = 7.
4. If 𝑛2 = 25, then n is 5 or −5.
Answer:

1. They paid me the money and I did not sign the contract.
2. The lines are parallel and they intersect.
3. 5 > 3 and 3 + 4 ≠ 7.
4. 𝑛2 = 25 and n is not 5 and −5.
Derived Conditionals

Every conditional statement has three related statements. They

are called the converse, the inverse, and the contrapositive.

Statements related to the Conditional

Statement 𝒑 ⇒ 𝒒
Converse 𝑞⇒𝑝
Inverse ∼ 𝑝 ⇒∼ 𝑞
Contrapositive ∼ 𝑞 ⇒∼ 𝑝
Example Write the converse, inverse, and contrapositive of the
following:

1. If I get the job, then I will rent the apartment.

2. If 𝑥 is an odd integer, then 𝑥 2 + 2 is even.
3. If we have a quiz today, then we will not have a quiz tomorrow.

Answer:
1. Conditional: If I get the job, then I will rent the apartment.
Converse: If I rent the apartment, then I get the job.
Inverse: If I do not get the job, then I will not rent the
apartment.
Contrapositive: If I do not rent the apartment, then I did not
get the job.
2. Conditional: If 𝑥 is an odd integer, then 𝑥 2 + 3 is even.
Converse: If 𝑥 2 + 3 is even, then 𝑥 is an odd integer.
Inverse: If 𝑥 is an even integer, then 𝑥 2 + 3 is odd.
Contrapositive: If 𝑥 2 + 3 is odd, then 𝑥 is an even integer.

3. Conditional: If we have a quiz today, then we will not have a quiz

tomorrow.
Converse: If we will not have a quiz tomorrow, then we have a
quiz today.
Inverse: If we do not have a quiz today, then we will have a
quiz tomorrow.
Contrapositive: If we will have a quiz tomorrow, then we do not have
a quiz today.
 Truth Table for the converse inverse and contrapositive of
𝒑⇒𝒒

𝒑 𝒒 𝒒⇒𝒑 ∼ 𝒑 ⇒∼ 𝒒 ∼ 𝒒 ⇒∼ 𝒑
T T T T T
T F T T F
F T F F T
F F T T T

Note: The conditional and the contrapositive are equivalent. Similarly,

the converse and the inverse of the given conditional statement are
equivalent.
Example Determine the truth value of the converse, inverse and the
contrapositive of the following statements:

1. If 5 > 7, then 5 > 4.

2. For all 𝑥 ∈ {−5, −4, −3, −2, −1,0,1,2,3,4,5}: if 𝑥 2 = 25, then 𝑥 = 5.

Answer:

1. Conditional: If 5 > 7, then 5 > 4. F ⇒T True

Converse: If 5 > 4, then 5 > 7. T ⇒F False
Inverse: If 5 ≤ 7, then 5 ≤ 4. T ⇒F False
Contrapositive: If 5 ≤ 4, then 5 ≤ 7. F ⇒T True
2. For all 𝑥 ∈ {−5, −4, −3, −2, −1,0,1,2,3,4,5}: if 𝑥 2 = 25, then 𝑥 = 5.

In this example, 𝑝𝑥 : 𝑥 2 = 25 and 𝑞𝑥 : 𝑥 = 5. Note that the truth sets of

these open sentences are 𝑃 = {−5,5} and 𝑄 = {5}, respectively.

Since 𝑃 ⊈ 𝑄, it follows that the given conditional statement is false.

It follows also that the contrapositive is also false. Moreover, since
𝑄 ⊆ 𝑃, the converse is true which also follows that the inverse is also
true.
Connectives
The statement “𝑝 if and only if 𝑞” is called a biconditional. It is
denoted by 𝑝 ⇔ 𝑞 and is equivalent to the conjunction
𝑝⇒𝑞 ˄ 𝑞⇒𝑝 .
►Biconditional statements are true only when 𝑝 and 𝑞 have the
same truth value.
Truth Table
𝒑 𝒒 𝒑⇔𝒒
T T T
T F F
F T F
F F T
Example State whether each biconditional is true or false.

1. 33 = 27 if and only if 16 is a perfect square.

2. 3 + 2 = 5 if and only if Lake Lanao is in Iligan City.

Answer:
1. 33 = 27 if and only if 16 is a perfect square. True
T T

2. 3 + 2 = 5 if and only if Lake Lanao is in Iligan City. False

T F
Note: The biconditional ∀𝑥: 𝑝𝑥 ⇔ 𝑞𝑥 is true if and only if 𝑃 = 𝑄,
where 𝑃 and 𝑄 are truth sets of 𝑝𝑥 and 𝑞𝑥 , respectively.

Example: State whether each biconditional is true true or false.

1. 𝑥 + 4 = 7 if and only if 𝑥 = 3.
2. 𝑥 2 = 36 if and only if 𝑥 = 6.
3. 𝑥 + 5 > 7 if and only if 𝑥 > 2.
 Solution:
1. 𝑥 + 4 = 7 if and only if 𝑥 = 3.

𝑃 = {3} 𝑄 = {3} 𝑃=𝑄 True

2. 𝑥 2 = 36 if and only if 𝑥 = 6.

𝑃 = {6, −6} 𝑄 = {6} 𝑃≠𝑄 False

3. 𝑥 + 5 > 7 if and only if 𝑥 > 2.

𝑃 = (2,+∝) 𝑄 = (2,+∝) 𝑃=𝑄 True