MATHEMATICS IN THE MODERN WORLD

LOGIC
LEARNING OUTCOMES
1. Use symbols in expressing logical
statements
2. Construct simple statements and
compound statements and transform in
symbolic form.
3. Express Simple and Compound
Statement in symbolic form to English
sentence.
4. Construct a truth table and identify its
truth values.
 LOGIC
DEFINITION:
Logic is “the science of correct
reasoning; science which
describes relationships among
propositions.
(Webster’s New World College Dictionary)
History Gottfried Wilhelm Leibniz
(1646 – 1716).
• He is the first mathematician to
make a serious study of
symbolic logic.
• Advance the study of logic from
a merely philosophical subject
to a formal mathematical
subject.
• Augustus De Morgan (1806 –
1871) and George Boole (1815 –
1864), contributed to the
advancement of symbolic logic
as a mathematical discipline.
History
George Boole
• Published The
Mathematical Analysis
of Logic in 1848.
• In 1854 he published
the more extensive
work, An
Investigation of the
Laws of Thought.
 LOGIC STATEMENTS
Every language contains different types of
sentences, such as statements, questions,
opinions, 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.
STATEMENT (PROPOSITION)

-A statement is a
declarative sentence
that is either true or
false, but not both true
and false.
Example: American Shaun
White won an Olympic gold
medal in speed skating.
You may not know if the sentence is
true, but you do know that the
sentence is either true or it is
false, and that it is not both true
and false. Thus, you know that the
sentence is a statement.
 Identify
Statements
Determine whether each
sentence is a statement.
Bhutan is a country
in Asia.

Statement
May jowa ka?

Not
 China is a
province of
Manila.
Statement
 May quiz ba
mamaya after
nito?
Not
𝟗 + 𝟐 is a prime
𝟗

number.

Statement
𝑥 + 1 = 5.

Not
He wrote Noli Me
Tangere.

Not
SIMPLE STATEMENT

▪ Today is Monday.
▪ It is raining outside.
Statement that conveys
a single idea.
COMPOUND STATEMENT

▪ Today is Monday and it

is raining outside.
Statement that conveys
two or more ideas.
SIMPLE TO COMPOUND

-Connecting simple
statements with words
and phrases such as
and, or, if ... then, and
if and only if creates a
compound statement.
SYMBOLS IN LOGIC
➢ George Boole used symbols lower
case letter such as p, q, r, s and t as
the most frequently used letter to
represent simple statements. and the
symbols
➢ ∧ 𝑐𝑎𝑟𝑒𝑡 ,
➢ ∨ 𝑟𝑒𝑣𝑒𝑟𝑠𝑒 𝑐𝑎𝑟𝑒𝑡 ,
➢ → 𝑎𝑟𝑟𝑜𝑤 ,
➢ ↔ (double arrow), and
➢ ~(tilde) to represent connectives.
 Logic Connectives and Symbols
Statements Connective Symbolic Type of
Form Statements

Not p Not P Negation

P and Q And PQ Conjunction

P or Q Or PQ Disjunction
If P, then q If…. Then P→ Q Conditional
P if and only If and only if PQ Biconditional
if q
~ p, Negation
➢ Today is Monday (p)
➢ Today is not Monday (~p)
In symbolic logic, the tilde
symbol ~ is used to denote
the negation of a
statement.
~(~p)
➢ The negation of the
negation of a statement
is the original statement.
➢ Thus ~ (~p) can be
replaced by p in any
statement.
Write the negation of the
statement.
1. The Queen Mary 2 is the
world’s largest cruise ship.
Answer: The Queen Mary 2 is
not the world’s largest cruise
ship.
2. Bill Gates does not have a
yacht.

Answer: The Queen Mary 2 is

not the world’s largest cruise
ship.
3. Avatar was selected as best
picture at the 82nd Academy
Awards ceremony.
Answer: Avatar was not
selected as best picture at the
82nd Academy Awards
ceremony.
4. Some senators are
Liberal.
Answer: No senators are
Liberal.
5. No senators are PDP Laban.

Answer: Some senators are

PDP Laban.
6. All senators are voted by
the people.
Answer: Some senators are
not voted by the people.
*
*The words some, all,and no
(or none) are referred to as
quantifiers.
 Statement Negation

All X are Y. Some X are not Y.

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.

*TRY THIS!

Statement: Negation:
1.All of you here are 1.Some of you here
good in math. are not good in
2.No smart phones are math.
expensive. 2.Some smart phones
3.Some students did are expensive.
not wish the class 3.All students wished
today to be the class today to be
suspended. suspended.
 p ~p
T F
F T
If a statement p is true, its
negation ~p is false, and if a
statement p is false, its negation
~ p is true.
CONJUNCTION ( p ∧ q)
read as“p and q”
SIMPLE STATEMENT
p: The food is aromatic.
q: The food is spicy.
COMPOUND STATEMENT
The food is aromatic and it is (food) spicy.
In SYMBOL (p ∧ q)
CONJUNCTION consists of two or
more statements connected by the
word and.
 *
Note: The only way for a conjunction to be
true is when all its components are true.

p q p⋀ q
T T T
T F F
F T F
F F F
Example: Consider the following simple
propositions:
p =“June has 30 days”
q = “3 is odd”

p ⋀ q= “June has 30 days and 3 is odd”

p ⋀ q is TRUE
DISJUNCTION ( p v q)

Statements connected by the word

“or”. Thus, the disjunction “p∨q”
represents the compound
statement “p or q” or both.
 DISJUNCTION ( p v q) read as “p or q”

SIMPLE STATEMENT
p: Today is Monday.
q: It is a holiday.
COMPOUND STATEMENTS
“Today is Monday or it is a holiday”.
In SYMBOL ( p v q) represents the statement
“Today is Monday or it is a holiday(or both).”
Therefore, “p or q” means “p or q or both.”
 *
p q p⋁ q

T T T

T F T

F T T

F F F
Note: The only way for a disjunction to be false is
when all its components are false.
Example:

p = Mayon Volcano is in Batangas.

q = 2 is odd.
2

p ⋁ q = “ Mayon Volcano is in Batangas or

22 is odd”
p ⋁ q is False
Using the symbolic representations
p: Joey is a college graduate.
q: Joey is employed.
express the following compound
statements in words
a.p∧ q
b.p ∨ ~ q
c. ~ p v q
 ∧,∨, →, ↔, and ~

a. “Joey is a college graduate and Joey

is employed.”
“Joey is a college graduate and he is
employed.”
b. “Joey is a college graduate or he is
not employed.”
c. “Joey is not a college graduate or he
is employed.”
 *CONDITIONAL (p → q)
SIMPLE STATEMENTS
p: It is raining
q: The streets are wet.

COMPOUND STATEMENT:
“If it is raining, then the streets are wet.”
 CONDITIONAL (p → q) “if p then q”
(p implies q)
-Any statement of the form “if p
then q” is called a conditional(or
an implication);
- p is called the hypothesis(or
premise) of the conditional, and
- q is called the conclusion of the
conditional.
-When people use conditionals in
everyday speech, they often omit
the word then, as in
-“If it is raining, the streets are wet.”
-Alternatively, the conditional
-“if p then q” may be phrased as
-“q if p”
- “The streets are wet if it is raining”.
Using the symbolic representations
below, express the following compound
statements in symbolic form:
p:I am healthy.
q:I eat junk food.
r:I exercise regularly.
1. If I exercise regularly, then I am
healthy.
Using the symbolic representations
below, express the following compound
statements in symbolic form:
p:I am healthy.
q:I eat junk food.
r:I exercise regularly.
2. I am healthy if I exercise regularly.
Using the symbolic representations below,
express the following compound
statements in symbolic form:
p:I am healthy.
q:I eat junk food.
r:I exercise regularly.
3. If I eat junk food and do not exercise,
then I am not healthy.
a. “I am healthy if I exercise regularly” is a
conditional (if ... then . . . ) and can be
rephrased as follows:
“ If I exercise regularly, then I am healthy.”

Symbol: r → p
*
b. “If I eat junk food and do not exercise, then I
am not healthy” is a conditional
(if... then. . . ) that contains a conjunction (and)
and two negations (not):

The premise of the conditional can be

represented by q∧ ~ r, while the conclusion can
be represented by ~ p
SYMBOLIC FORM : (q∧ ~ r) →~ p
Using the symbolic representations below,
express the following compound
statements in symbolic form:
p:I am healthy.
q:I eat junk food.
r:I exercise regularly.
1. ~𝐩 → 𝒒
If I am not healthy, then I eat junk food.
Using the symbolic representations below,
express the following compound
statements in symbolic form:
p:I am healthy.
q:I eat junk food.
r:I exercise regularly.
2. ~𝒒 → (𝒑 ∧ 𝒓)
If I don’t eat junk food, then I am
healthy and I exercise regularly.
Note:
Given a conditional proposition:
p→q
Two other variants, namely
q → p (converse)
∼p → ~q (inverse) and
∼q → ~p (contrapositive)
can be formed.
p→q “If 4 is even, then 4 is divisible by 2”

q→p (converse)

“If 4 is divisible by 2, then 4 is even”

∼p→~q (inverse)

“If 4 is not even, then 4 is not divisible

by 2”
∼q →~p (contrapositive)

“If 4 is not divisible by 2, then 4 is not

even”
Statements that start with the
quantifiers (All and No) can be
translated into CONDITIONALS…

Express the following statements in

symbolic form:
a. All mammals are warm-blooded.
b. No snake is warm-blooded.
 *
a. The statement “All mammals are warm-
blooded” can be rephrased as
“If it is a mammal, then it is warm-blooded.”
Therefore, we define two simple statements p
and q as
p:It is a mammal.
q:It is warm-blooded.
In symbol : p → q
In general, any statement of the form
“All p are q” can be symbolized as p→q.
 *
b. The statement “No snake is warm-blooded” can be rephrased
as
“If it is a snake, then it is not warm-blooded.”
Therefore, we define two simple statements p and q as
p:It is a snake.
q:It is warm-blooded.
The statement now has the form
“If it is a snake, then it is not warm-blooded.”

In symbol can be expressed as p→ ~ q.

In general, any statement of the form “No p is q”
can be symbolized as p→ ~ q.
TRUTH VALUE FOR CONDITIONAL
Consider the compound
statement
“If you give me P500, then I
will give you a ticket to the
ballet.”
Under what circumstances is a
conditional true, and when is it
false?
 TRUTH VALUE FOR CONDITIONAL

This statement is a conditional and

has the following representation:
p:You give me P500.
q:I give you a ticket to the ballet.
p→q: If you give me P500, then I
will give you a ticket to the
ballet.
TRUTH TABLE FOR (p → q)
 Determine the truth value of
each of the following.
a. If 2 is an integer, then 2 is a
rational number.
b. If 3 is a negative number,
then 5>7.
c. If 5>3, then 2+ 7 = 4
BICONDITIONAL (p ↔ q)
“p if and only if q”
p: A citizen is eligible to vote.
q: A citizen is at least 18 years old.
The statement p ↔ q represents
the sentence
" A citizen is eligible to vote if and
only if he is at least 18 years old."
TRUTH TABLE FOR BICONDITIONAL

p q p↔q
T T T
T F F
F T F
F F T
SUMMARY TABLE FOR TRUTH VALUE
p q p∧ q p∨q p→ 𝒒 p↔q
∧,∨, →, ↔, and ~
T T T T T T
T F F T F F
F T F T T F
F F F F T T
*CONSTRUCTING A TRUTH TABLE
Example:
Under what specific conditions is the following
compound statement true?
“I have a high school diploma, or I have a full-
time job and no high school diploma.”
Translate in symbolic form
p:I have a high school diploma.
q:I have a full-time job
Symbolic form : p v (q ∧ ~ p)
*
As is indicated in the truth table, the symbolic
expression p v (q ∧ ~ p)
is true under all conditions except one:
row 4; the expression is false when both p and
q
are false.
Therefore, the statement “I have a high school
diploma, or I have a full-time job and no high
school diploma” is true in every case except
when the speaker has no high school diploma
and no full-time job.
“I walk up the stairs if I want to exercise or if
the elevator isn’t working.”
Rewriting the statement so the word if is first,
we have
“If I want to exercise or (if) the elevator isn’t
working, then I walk up the stairs.”
p:I want to exercise.
q:The elevator is working.
r:I walk up the stairs
In symbol:
(p∨ ~ q) →r.
*
*
*
As shown on the table, TRUE in all
situations except those listed in rows 2,
4, and 8.
For instance, the statement is FALSE
(row 8) when the speaker does not
want to exercise, the elevator is not
working, and the speaker does not walk
up the stairs—in other words, the
speaker stays on the ground floor of the
building when the elevator is broken.