Mathematics as a Language – UNIT 2

The Language of
Mathematics

Maria Luz A. Santos, MSME

University of Santo Tomas
What is a Language?

According to Merriam-
Webster Dictionary

Language is the
system of words or signs
that people use to express
thoughts and feelings to
each other
Language!
Language!
Math is the Language!
Math is the Language!
Math is the Language!
Math is the Language!
Mathematics is a Language!
Mathematics is a Language!

What is an “mathematical expression”?

A mathematical phrase that contains operations, numbers and / or

variables

Example: a subtract from b === b – a

What is “mathematical sentence”?

Mathematical sentence translated into equation or inequality. Or it

could be a group of symbols that state a relationship between two
mathematical expressions.

Example: the product of a number and 9 is 45 === 9x = 45

Mathematics is a Language!

Exercises:

Translate each of the following into mathematical phrase

1. The product of thrice a number and four

2. Four times a number minus nine

3. Five less than a twice a number

4. Three times a number divided by two

5. The quotient of five times a number and six

Mathematics is a Language!

More Exercises:

Translate each phrase into mathematical expressions

1. eight inches taller than Myra’s height

2. twelve more than four times a number

3. the difference of sixty and a number

4. three time s a number of tickets sold

5. fifteen dollar more than a saved amount

SET

Set
A set is a well defined collection of distinct
objects. Elements (∈)are the objects belongs to a given
set that is enclosed by braces. Set usually named by the
capital letters. Georg Cantor introduce this concept in
the late 18th centuries.
SET
SET

Kinds of Sets

Cardinality. Is the number of elements in a given set. Denoted

by n(S).
Example/s:
1. A = { x/x is a letter of Filipino alphabet}, n(A) = 28
2. C = { x/x is a counting number less than 15}, n(C) = 14

Finite Set. A set with elements that are countable.

Example/s:
1. K = {x/x is a member of “Beyond The Scene” group}
2. M = { x/x is a number of bag in a room}
SET
Infinite Set. A set that has unlimited elements
Example/s:
1. D = { x/x is an odd number}
2. L = {…..,…,-3, -2, -1, 0, 1, 2, 3,……}

Empty Set. A null set that denoted as ∅ 𝑜𝑟

Example/s:
1. G = {x/x is a counting number less than zero}
2. The set of female players in PBA.

Universal Set. Denoted by 𝒰 that means the complete elements that is being
considered in a given discussion
Example:
If the discussion involves the whole section then “Set of students in
_(state you section)_____ SY 2018-2019 First Semester”
SET
Equivalent Set. Two set can be called as equivalent set if they have the same
cardinality or the same number of elements. Denoted by 𝐴 ~ 𝐵 𝑜𝑟 𝐴 ↔ 𝐵
Example/s:
1. { 1, 2, 3} ~ { a, b, c}
2. { X/ x is a prime number less than 25} ~ { 1, 2, 3, 4, 5, 6, 7, 8}

Equal Set. Denoted by A = B. Two set said to be equal set if and only if they have
their elements are exactly the same as well as the cardinality.
Example:
{Jerry, Alvin, Paul} = {Paul, Jerry, Alvin}

Joint and Disjoint Set. Two sets A and B are joint if and only if A and B have
common elements, otherwise disjoint.
Example:
S = { 2, 4, 6} and T = { 1, 2, 3} Since A and B has common then it is joint
SET

Subset. If every elements of set A also an elements of set B, then A is subset of B,

denoted by 𝐴 ⊆ 𝐵. Number of subset can be computed as 2𝑛 , where n is the
cardinality and 2 is constant.

Proper Subset. If set A is a subset of B but B has at least one element that is not
found in A, then A is a not proper subset of B that denoted as 𝐴 ⊄ 𝐵 then it is
improper subset
Example/s:
1. Given N = {a, b, c}. To find the number of subset, need to find first the
cardinality of the given set n(N) = 3, then 23 = 8 𝑠𝑢𝑏𝑠𝑒𝑡𝑠 namely, { }, {a}, {b}, {c},
{a, b},
{a, c}, {b, c}, {a, b, c}

2. Given M = {1, 2, 3} N = { 1, 2, 3, 4, 5}

𝑀 ⊆ 𝑁 𝑜𝑟 𝑀 ⊂ 𝑁
SET

U 𝐴 ⊆ 𝐵, 𝐵 ⊆ 𝑈, 𝐴 ⊆ 𝑈
B A

Operations On Set

Union Set. Union set denoted as 𝐴 ∪ 𝐵 if the set of elements are in A or B or in both A
and .

The shaded region represent 𝐴 ∪ 𝐵

A B

A = { a, b, c, d} and B = {a, c, e, f} = 𝐴 ∪ 𝐵 = {𝑎, 𝑏, 𝑐, 𝑑, 𝑒, 𝑓}

SET
Intersection Set. Two sets whose elements are common to set A and set B. Denoted by
𝐴 ∩𝐵
A = {a, b, c, d, e} B = { c, d, e, f} 𝐴 ∩ 𝐵 = 𝑐, 𝑑, 𝑒

The shaded region represent 𝐴 ∩ 𝐵

A B

Complement of Set A. With respect to the universal set, is the set with elements found in
the universal set, but not in the set A. Denoted by 𝐴′ 𝑜𝑟 𝐴𝑐

The shaded region represent the

complement of set A
A’
A

If U = { 1, 2, 3, 4, 5, 6, 7} A = {1, 3, 5, 7} , A’ = {2, 4, 6}
SET

The Difference of Se A and Set B. Is the set whose elements are in A but not in B.
Denoted as 𝐴 − 𝐵

A B

If A = { 1, 2, 6, 8, 12} and B = {3, 0, 6, 8}, then 𝐴 − 𝐵 = 1, 2, 12

and for 𝐵 − 𝐴 = { 3, 0, }
SET

John Venn (1834 - 1883 An English Logician introduce the Venn diagram
SET

Illustrate the given set by shading the region it represent

1. 𝐴 − 𝐵′

2. 𝐴 ∩ ( 𝐵 − 𝐴)′

3. 𝐴 ∪ 𝐵 − 𝐶
Function and Relation

A function is a relation such that each element of the domain (x) is paired with exactly one
element of the range (y).

Remarks:
8 For every element of
200
Set A is paired with
10 exactly one elements in
250
Set B.
15 375

28 700
Set of Numbers of Hours Set of Earnings
A B
domain (x) range (y)
Function and Relation

Relation is a correspondence of the elements of A with the elements of B such that

every elements of B such that every elements of A is paired with at least one element of
B. A Relation can also be defined as a set of ordered pairs.

Remarks:
Relation can be;
x1 y1 One – to – one
One – to – many
x2 y2 Many – to – one

x3 y3

x4 y4

A B
Logic

Logic is commonly known as the science of reasoning. Mathematical

reasoning and arguments are based on the rules of logic.

Proposition is any meaningful statement that is either true or false.

Lower cases will be used to represent proposition such as a, b, ……, p, q, r, ……..
If the proposition truth value is true then it is denoted as T or 1 otherwise F or
0.
Example/s:

p: Daniel loves Kathryn.

a: Rat have wings.

q: Smoking is dangerous.
 Statement

LOGIC
PROPOSITION
the science of reasoning
Logic
Logic
Proposition

Is this a proposition?

Thrice a
number
LOGIC the science of reasoning
Proposition

Is this a proposition?

LISTEN!

LOGIC the science of reasoning

Proposition

Is this a proposition?

Pia is beautiful.

LOGIC the science of reasoning

Proposition

Is this a proposition?

SMART.
LOGIC the science of reasoning
Proposition symbols

Pia is beautiful.

LOGIC p
the science of reasoning
Proposition symbols

Pia is not beautiful.

LOGIC ~p
the science of reasoning
Proposition symbols

SMART.
p
LOGIC the science of reasoning
Negation symbol

~p
LOGIC
NOT SMART.
the science of reasoning
Negation symbol

NOT
LOGIC
Some reference use ¬ to denote negation.
thesame
~ p is the science
asof¬ reasoning
p.
TRUTH TABLE
a tabular
representation of
all the
combinations of
values for inputs
and their
corresponding the science of reasoning
outputs
TRUTH TABLE

p ~p
T F
F T
the science of reasoning
Compound propositions

pq
a proposition
formed by
combining two or

s r
more simple

LOGIC
propositions
the science of reasoning
Compound propositions

Examples:
I am a Thomasian.

LOGIC
p the science of reasoning
Compound propositions

Examples:

q
LOGIC
I enjoy flooded areas.
the science of reasoning
 Compound propositions

Examples:

p LOGIC
q
I am a Thomasian. I enjoy flooded area

the science of reasoning

 Connectives

Examples:
and
p LOGIC
^ q
I am a Thomasian I enjoy flooded area.

the science of reasoning

 Connectives

Examples:
or
p LOGIC
v q
I am a Thomasian I enjoy flooded area.

the science of reasoning

 Connectives

Examples:
If thenI enjoy flooded area.
p LOGIC
q
I am a Thomasian

→
the science of reasoning
Conjunction

Let p and q be propositions.

The conjunction p and q,
LOGIC
denoted by p ∧ q is the
proposition.
p ∧ q is true if and only if both
p and q are true. Otherwise,
the science of reasoning

false.
Conjunction
p ∧ q is true if and only if both p and q are true. Otherwise,
false.

p q p∧q
T LOGIC
T T
T F F
F T F
the science of reasoning
F F F
Conjunction
Construct the truth table for ~p ∧ q

p q ~p ~p∧q
T LOGIC
T F F
T F F F
F T T T
the science of reasoning
F F T F
Conjunction
Construct the truth table for ~p ∧ ~q

p q ~p ~q ~p∧~q
T
T
T
F
LOGIC F
F
F
T
F
F
F T T F F
the science of reasoning
F F T T T
Conjunction
Construct the truth table for ~(p ∧ q)

p q p∧q ~(p∧q)
T TLOGIC T F
T F F T
F T F T
the science of reasoning
F F F T
Disjunction
p v q is false if and only if both of p and q is false.
Otherwise, true.

p q pvq
T LOGIC
T T
T F T
F T T
the science of reasoning
F F F
Disjunction
Construct the truth table for p v ~q

p q ~q P v ~q
T LOGIC
T F T
T F T T
F T F F
the science of reasoning
F F T T
Disjunction
Construct the truth table for ~p v ~q

p q ~p ~q ~pv~q
T
T
T
F
LOGIC F
F
F
T
F
T
F T T F T
the science of reasoning T
F F T T
Disjunction
Construct the truth table for ~(p v q)

p q p v q ~(p v q)
T
T
T
F
LOGIC T
T
F
F
F T T F
the science of reasoning
F F F T
~p ∧ ~q is exactly
the the same
science as ~(p v q)
of reasoning
~(p ∧ q) is exactly the same
the science as ~p v ~q
of reasoning
De Morgan’s Law
De Morgan’s Law
~p ∧ ~q ≡ ~(p v q)
~p v ~q ≡ ~(p ∧ q)
Exclusive disjunction
p ⊕ q is true when exactly one of p and q is true.
Otherwise, false.

p q p⊕q
T T F
T F T
F T T
F F F
Exclusive Disjunction
Construct the truth table for ~p ⊕ q

p q ~p ~p ⊕ q
T
T
T
F
LOGIC F
F
T
F
F T T F
the science of reasoning
F F T T
 NAND (not and)
p NAND q or p|q is false when both p and q are true.
Otherwise, true.

p q p|q
T LOGIC
T F
T F T
F T T
the science of reasoning
F F T
NAND (not and)
Construct the truth table for p|~q

p q ~q p|~q
T LOGIC
T F T
T F T F
F T F T
the science of reasoning
F F T T
TRY THIS!
Construct the truth table for ~(p ⊕ ~q) ∧ r
p q ~q (p ⊕ ~q) ~(p ⊕ ~q) r ~(p ⊕ ~q) ∧ r

T T F T F T T
T F T F T T T
F T F F T T T
F F T T F T T
T T F T F F F
T F T F T F T
F T F F the science
T of reasoning
F T
F F T T F F F
TRY THIS!
Construct the truth table for ~(p ⊕ ~q) ∧ r
p q ~q (p ⊕ ~q) ~(p ⊕ ~q) r ~(p ⊕ ~q) ∧ r

T T F T F T T
T F T F T T T
F T F F T T T
F F T T F T T
T T F T F F F
T F T F T F T
F T F F the science
T of reasoning
F T
F F T T F F F
TRY THIS!
Construct the truth table for ~(p ⊕ ~q) ∧ r
p q ~q (p ⊕ ~q) ~(p ⊕ ~q) r ~(p ⊕ ~q) ∧ r

T T F T F T T
T F T F T T T
F T F F T T T
F F T T F T T
T T F T F F F
T F T F T F T
F T F F the science
T of reasoning
F T
F F T T F F F
TRY THIS!
Construct the truth table for ~(p ⊕ ~q) ∧ r
p q ~q (p ⊕ ~q) ~(p ⊕ ~q) r ~(p ⊕ ~q) ∧ r

T T F T F T T
T F T F T T T
F T F F T T T
F F T T F T T
T T F T F F F
T F T F T F T
F T F F the science
T of reasoning
F T
F F T T F F F
TRY THIS!
Construct the truth table for ~(p ⊕ ~q) ∧ r
p q ~q (p ⊕ ~q) ~(p ⊕ ~q) r ~(p ⊕ ~q) ∧ r

T T F T F T F
T F T F T T T
F T F F T T T
F F T T F T F
T T F T F F F
T F T F T F F
F T F F the science
T of reasoning
F F
F F T T F F F
TRY THIS!
Is (p v q) ∧ r ≡ (p ∧ r) v (q ∧ r)?
p q pvq r (p v q) ∧ r p∧r q∧r (p ∧ r) v (q ∧ r)

T T T T T T T T
T F T T T T F T
F T T T T F T T
F F F T F F F F
T T T F F F F F
T F T F F F F F
F T T F F the science
F ofF reasoning F
F F F F F F F F
TRY THIS!
Is (p v q) ∧ r ≡ (p ∧ r) v (q ∧ r)?
p q pvq r (p v q) ∧ r p∧r q∧r (p ∧ r) v (q ∧ r)

T T T T T T T T
T F T T T T F T
F T T T T F T T
F F F T F F F F
T T T F F F F F
T F T F F F F F
F T T F F the science
F ofF reasoning F
F F F F F F F F
TRY THIS!
Is (p v q) ∧ r ≡ (p ∧ r) v (q ∧ r)?
p q pvq r (p v q) ∧ r p∧r q∧r (p ∧ r) v (q ∧ r)

T T T T T T T T
T F T T T T F T
F T T T T F T T
F F F T F F F F
T T T F F F F F
T F T F F F F F
F T T F F the science
F ofF reasoning F
F F F F F F F F
TRY THIS!
Is (p v q) ∧ r ≡ (p ∧ r) v (q ∧ r)?
p q pvq r (p v q) ∧ r p∧r q∧r (p ∧ r) v (q ∧ r)

T T T T T T T T
T F T T T T F T
F T T T T F T T
F F F T F F F F
T T T F F F F F
T F T F F F F F
F T T F F the science
F ofF reasoning F
F F F F F F F F
TRY THIS!
Is (p v q) ∧ r ≡ (p ∧ r) v (q ∧ r)?
p q pvq r (p v q) ∧ r p∧r q∧r (p ∧ r) v (q ∧ r)

T T T T T T T T
T F T T T T F T
F T T T T F T T
F F F T F F F F
T T T F F F F F
T F T F F F F F
F T T F F the science
F ofF reasoning F
F F F F F F F F
TRY THIS!
Is (p v q) ∧ r ≡ (p ∧ r) v (q ∧ r)?
p q pvq r (p v q) ∧ r p∧r q∧r (p ∧ r) v (q ∧ r)

T T T T T T T T
T F T T T T F T
F T T T T F T T
F F F T F F F F
T T T F F F F F
T F T F F F F F
F T T F F the science
F ofF reasoning F
F F F F F F F F
 LOGIC
CONDITIONAL
STATEMENTS

the science of reasoning

 In the example,
If thenI enjoy flooded area.
p LOGIC
q
I am a Thomasian

→
the science of reasoning
Conditional Statment
p→q
p is called the hypothesis,
LOGIC
the premise or the antecedent.

q is called the conclusion or

consequence. the science of reasoning
Conditional Statment

If I am a K-pop 𝑡ℎ𝑒𝑛 I understand 사랑해.

LOGIC
p→q

p: I am a K-pop.
q: I understand 사랑해.
the science of reasoning
Conditional Statment
p→q

LOGIC
If p 𝑡ℎ𝑒𝑛 q.
p is sufficient for q.
q if p.
q is necessary for
the science p.
of reasoning
p only if p.
Conditional Statment
p→q

LOGIC
If p 𝑡ℎ𝑒𝑛 q.
q when p.
q follows from p.
the science of reasoning
Conditional Statement
p → q is true on the condition the p holds.

p q p→q
T LOGIC
T T
T F F
F T T
the science of reasoning
F F T
Conditional Statement
Construct a truth table for ~p→~q

p q ~p ~q ~p→~q
T T F F T
T F F T T
F T T F F
the science of reasoning
F F T T T
Conditional Statement
Note that:

q → p is the converse of p → q.
~q → ~p is the contrapositive of p → q.
~p → ~q is the inverse of p → q.
the science of reasoning
Bi-conditional Statement
p ↔ q is true when both (p and q) statements are the same.

p q p↔q
T T T
T F F
F T F
the science of reasoning
F F T
Bi-conditional Statement
Construct a truth table for p ↔ ~q.

p q ~q p↔~q
T T F F
T F T T
F T F T
the science of reasoning
F F T F
Exercise:
Construct a truth table for (p ∧ q) → (p → q)
p q p∧q p→q (p ∧ q) → (p → q)
T T T T T
T F F F T
F T F T T
F F F T
Tthe science of reasoning
Types of compound propositions
If a compound proposition is always true, it is called
a tautology.

If a compound proposition is always false, it is called

a contradiction or absurdity.

A compound proposition is called a contingency if it

is not a tautology nor a contradiction.
the science of reasoning
An argument is said to be valid if it is a tautology.

the science of reasoning

Types of compound propositions

the science of reasoning

Is this a valid argument?
If you smoke, then you will have lung cancer.
You have lung cancer.
Therefore, you smoke.

the science of reasoning

If you smoke, then you will have lung cancer.
You have lung cancer.
Therefore, you smoke.

p: You smoke.
q: You have lung cancer.
the science of reasoning
If you smoke, then you will have lung cancer.
p→q
You have lung cancer.

q
Therefore, you smoke.
the science of reasoning
∴p
p→q q p

the science of reasoning

(p→q ∧ q )→ p

the science of reasoning

[(p → q) ∧ q ] → p

the science of reasoning

Construct a truth table for [(p → q) ∧ q ] → p
p q p → q [(p → q) ∧ q [(p → q) ∧ q ] → p
T T T T T
T F F F T
F T T T F
F F T F T
the science of reasoning
Is this a valid argument?
If you smoke, then you will have lung cancer.
You have lung cancer.
Therefore, you smoke.

the science of reasoning

Is this a valid argument?
If it rains nonstop, then UST will be flooded.
If is UST is flooded, then there will be
no classes.
It rains nonstop, then there will be no
classes
p: It rains nonstop.
q: UST will be flooded.
r: There are no classes.
If it rains nonstop, then UST will be flooded.
p→q
If is UST is flooded, then there will be no classes.
q→r
It rains nonstop, then there will be no classes
p→r
Truth table
[(p → q) ∧ (q → r)] → (p → r)
p q p→q r q→r [(p → q) ∧ (q→r)] p→r [(p → q) ∧ (q → r)] → (p → r)

T T T T T T T T
T F F T T F T T
F T T T T T T T
F F T T T T T T
T T T F F F F T
T F F F T F F T
F T T F F F
the science ofTreasoning T
F F T F T T T T
Truth table
[(p → q) ∧ (q → r)] → (p → r)
p q p→q r q→r [(p → q) ∧ (q→r)] p→r [(p → q) ∧ (q → r)] → (p → r)

T T T T T T T T
T F F T T F T T
F T T T T T T T
F F T T T T T T
T T T F F F F T
T F F F T F F T
F T T F F F
the science ofTreasoning T
F F T F T T T T
Truth table
[(p → q) ∧ (q → r)] → (p → r)
p q p→q r q→r [(p → q) ∧ (q→r)] p→r [(p → q) ∧ (q → r)] → (p → r)

T T T T T T T T
T F F T T F T T
F T T T T T T T
F F T T T T T T
T T T F F F F T
T F F F T F F T
F T T F F F
the science ofTreasoning T
F F T F T T T T
Truth table
[(p → q) ∧ (q → r)] → (p → r)
p q p→q r q→r [(p → q) ∧ (q→r)] p→r [(p → q) ∧ (q → r)] → (p → r)

T T T T T T T T
T F F T T F T T
F T T T T T T T
F F T T T T T T
T T T F F F F T
T F F F T F F T
F T T F F F
the science ofTreasoning T
F F T F T T T T
Truth table
[(p → q) ∧ (q → r)] → (p → r)
p q p→q r q→r [(p → q) ∧ (q→r)] p→r [(p → q) ∧ (q → r)] → (p → r)

T T T T T T T T
T F F T T F T T
F T T T T T T T
F F T T T T T T
T T T F F F F T
T F F F T F F T
F T T F F F
the science ofTreasoning T
F F T F T T T T
Truth table
[(p → q) ∧ (q → r)] → (p → r)
p q p→q r q→r [(p → q) ∧ (q→r)] p→r [(p → q) ∧ (q → r)] → (p → r)

T T T T T T T T
T F F T T F T T
F T T T T T T T
F F T T T T T T
T T T F F F F T
T F F F T F F T
F T T F F F
the science ofTreasoning T
F F T F T T T T
Is this a valid argument?
If it rains nonstop, then UST will be flooded.
If is UST is flooded, then there will be
no classes.
It rains nonstop, then there will be no
classes
http://web.stanford.edu/class/cs103/tools/truth-table-tool
http://web.stanford.edu/class/cs103/tools/truth-table-tool
Mathematics in the Modern World – UNIT 2

END OF UNIT 2