MATHEMATICS IN THE MODERN WORLD

GED 114 – SESSION 2 – PART 2 – PRE-FINALS

LOGIC STATEMENTS
&
QUANTIFIERS
A Statement
It 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. Florida is a state in the United States. a. A statement
b. How are you? b. Not a statement
c. 99 + 2 is a prime. c. A statement
d. X+1 = 5 d. A statement
A Statement
It is a declarative sentence that is either true or false, but not both true and false.

ACTIVITY #1
Determine whether each sentence is a statement.
a. Open the door.
b. 7055 is a large number.
c. In the year 2024, the president of the United States will be a woman.
d. X > 3
Simple Statements and Compound Statements
A simple statement is a statement that conveys a single idea.
A compound statement is a statement that conveys two or more ideas.

TABLE 1
Statement Connective Symbolic form Type of Statement
not p not ∼𝑝 negation
p and q and 𝑝 ∧ 𝑞 conjunction
p or q or 𝑝 ∨𝑞 disjunction
If p, then q If … then 𝑝→𝑞 conditional
p if and only if q if and only if 𝑝⟷𝑞 biconditional
Truth Value and Truth Tables
A truth value of a simple statement is either true (T) or false (F).
A truth value of a compound statement depends on the truth values of its simple
statements and its connectives.

A truth table is a table that shows the truth value of a compound statement for
all possible truth values of the simple statements.
Write the negation of a statement.
EXAMPLE: ACTIVITY #2
a. Ellie Goulding is an opera singer. a. The Queen Mary 2 is the world’s
b. The dog does not need to be fed. largest cruise ship.
b. The fire engine is not red.
ANSWER:
a. Ellie Goulding is not an opera singer.
b. The dog needs to be fed.
Write Compound Statement in Symbolic Form
Connective Symbolic form
EXAMPLE: not ∼𝑝
Consider the following simple statements. and 𝑝 ∧ 𝑞
p: Today is Friday. or 𝑝 ∨𝑞
q: It is raining. If … then 𝑝→𝑞
r: I am going to a movie. if and only if 𝑝⟷𝑞

s: I am not going to the basketball game.

ANSWER:
Write the following compound statements in symbolic form. a. 𝑝 ∧ 𝑞
a. Today is Friday and it is raining. b. ∼ 𝑞 ∧ 𝑟
b. It is not raining and I am going to a movie.
c. ∼ 𝑠 ∨ 𝑟
c. I am going to the basketball game or I am going to a movie.
d. 𝑞 ⟶ s
d. If it is raining, then I am not going to the basketball game.
Write Compound Statement in Symbolic Form
Connective Symbolic form
ACTIVITY #3 not ∼𝑝
Consider the following simple statements. and 𝑝 ∧ 𝑞
p: Today is Friday. or 𝑝 ∨𝑞
q: It is raining. If … then 𝑝→𝑞
r: I am going to a movie. if and only if 𝑝⟷𝑞

s: I am not going to the basketball game.

Write the following compound statements in symbolic form.

a. Today is not Friday and I am going to a movie.
b. I am going to the basketball game and I am not going to a movie.
c. I am going to the movie if and only if it is raining.
d. If today is Friday, then I am not going to a movie.
Compound Statements and Grouping Symbols
If it is written in symbolic form, then parenthesis are used to indicate which simple
statements are grouped together.

Table 2
Symbolic Form The parenthesis indicate that:

p ∧ (q ∨ ∼ r) q and ∼ r are grouped together

p ∧ q ∨ r p and q are group together

p and ∼ q are grouped together.

(p ∧ ∼ q) ⟶ (r ∨ s)
r and s are also grouped together.
Compound Statements and Grouping Symbols
If it is written in English sentence, then a comma are used to indicate which simple
statements are grouped together.

Table 3
English sentence
p, and q or not r.
p and q, or r.
If p and not q, then r or s.
The comma indicate that:
q and ∼ r are grouped together because they are
both on the same side of the comma.
p and q are grouped together because they are
both on the same side of the comma.
p and ∼ q are grouped together because they are
both to the left of the comma.
r and s are grouped together because they are
both to the right of the comma.
Compound Statements and Grouping Symbols
EXAMPLE: Symbolic Form English sentence

Let p, q, and r represents the following: p ∧ (q ∨ ∼ r) p, and q or not r.

p: You get a promotion. p ∧ q ∨ r p and q, or r.
q: You complete the training.
r: You will receive a bonus. (p ∧ ∼ q) ⟶ (r ∨ s) If p and not q, then r or s.

a. Write (𝑝 ∧ 𝑞) ⟶ 𝑟 as an English sentence. ANSWER:

b. Write “If you do not complete the training,
then you will not get a promotion and receive
a bonus.” in symbolic form.
a. If you get a promotion and
you complete the training,
then you will receive a bonus.
b. ∼ q ⟶ (∼ 𝑝 ∧ ∼ 𝑟)
Compound Statements and Grouping Symbols
ACTIVITY #4 Symbolic Form English sentence

Let p, q, and r represents the following: p ∧ (q ∨ ∼ r) p, and q or not r.

p: Kesha’s singing style is similar to Uffie’s. p ∧ q ∨ r p and q, or r.
q: Kesha has messy hair.
r: Kesha is a rapper. (p ∧ ∼ q) ⟶ (r ∨ s) If p and not q, then r or s.

a. Write (𝑝 ∧ 𝑞) ⟶ 𝑟 as an English sentence.

b. Write “If Kesha is not a rapper, then Kesha does not have messy hair and
Kesha’s singing style is not similar to Uffie’s.” in symbolic form.
 TRUTH VALUE
Of a CONJUNCTION Of a DISJUNCTION
𝑝 𝑞 𝒑 ∧ 𝒒 𝒑 𝒒 𝒑 ∨ 𝒒
T T T T T T
T F F T F T
F T F F T T
F F F F F F
TRUTH VALUE
Of a CONJUNCTION EXAMPLE:
𝑝 𝑞 𝒑 ∧ 𝒒 Determine whether each statement is true
T T T
or false.
T F F
a. 7 ≥ 5. ‒ True statement
F T F
F F F b. 5 is a whole number and 5 is an
even number. ‒ False statement
c. 2 is a prime number and 2 is an
Of a DISJUNCTION
even number. ‒ True statement
𝒑 𝒒 𝒑 ∨ 𝒒
T T T
T F T
F T T
F F F
TRUTH VALUE
Of a CONJUNCTION ACTIVITY #5
𝑝 𝑞 𝒑 ∧ 𝒒 Determine whether each statement is true
T T T
or false.
T F F
a. 21 is a rational number and 21 is a
F T F
F F F natural number.
b. 4 ≤ 9.
c. −7 ≥ −3.
Of a DISJUNCTION
𝒑 𝒒 𝒑 ∨ 𝒒
T T T
T F T
F T T
F F F
 QUANTIFIERS AND NEGATION
In a statement, the word some and the phrases there exists and
at least one are called existential quantifiers.

In a statement, the words none, no, all, and every are called
universal quantifiers.
 QUANTIFIERS AND NEGATION
Quantified Statement and Their Negation EXAMPLE:
Statement Negation Write the negation of each of the following statements.
a. Some airports are open.
All X are Y. Some X are not Y. b. All movies are worth the price of admission.
c. No odd numbers are divisible by 2.
No X are Y. Some X are Y.
ANSWER:
Some X are not Y. All X are Y. a. No airports are open.
b. All movies are worth the price of admission.
Some X are Y. No X are Y.
c. No odd numbers are divisible by 2.
 QUANTIFIERS AND NEGATION
Quantified Statement and Their Negation ACTIVITY #6
Statement Negation Write the negation of each of the following statements.
a. All bears are brown.
All X are Y. Some X are not Y. b. No smart phones are expensive.
c. Some vegetables are not green.
No X are Y. Some X are Y.

Some X are not Y. All X are Y.

Some X are Y. No X are Y.

 PRE-FINALS SESSION 2 PART 2
GED 114
PRE-FINALS P R E PA R E D B Y:
NOVEMBER 07, 2020 J A N A R H G R AY P. V E R D I D A