Mathematical Language

and Symbols
(Module 2)
“One very important element for a
student to succeed in mathematics is the
ability to communicate effectively in
mathematics.”

—Schiro , 1997
OBJECTIVES
At the end of the module, the students are expected to use
mathematical language appropriately in speaking and writing
mathematical ideas. This module also aims to introduce basic
symbolic logic and set theory.
Sections
01 Mathematics as a Language

02 Basic Concepts of Mathematical

Language: Sets, Functions, and
Binary Operations

03 Mathematical Logic
Section 01
Mathematics as a
Language
Learning Outcomes

Outcome 1
Students should be able to classify group
of words or symbols as mathematical
expressions or mathematical sentences,

Outcome 2
Students must be able to identify the
verbs in mathematical sentences.
DIAGNOSTICS:
Agree or Disagree?

1. In mathematical language, a mathematical expression is

considered as a noun.
2. Just like English sentences, mathematical sentences have
verbs too.
3. Mathematics is a language with its own parts of speech.
4. “5 + 8 = 13” is a mathematical language.
Introduction
Although Mathematics and English Language have many things in
common in terms of structure, the rules in mathematics are stricter and
some forms are more complicated. The following items summarize some
unique characteristics of the mathematical language.
• It is precise because it can be stated clearly.
• It is concise because it can be stated briefly.
• It is powerful because it is capable of expressing complex ideas into
simpler forms.
• It is nontemporal (i. e. it has no tenses) which makes it so unique as
compared to other languages.
• It also has vocabulary and parts of speech.
Parts of Speech
in
Mathematics
Parts of Speech for Mathematics
Just like ordinary language, mathematics also has syntax(rules) and
structure, which can be categorized into five forms.

• Numbers
- Are the very first symbols that can be used to represent quantity.
- These are nouns (objects) in the English language.

• Operation symbols
- Symbols like plus “+”, minus “-”, can act as connectives in
mathematical sentence.
Parts of Speech for Mathematics
• Relation Symbols
- Symbols such as = (equal to) , ≤ (less than or equal to) and ~
(similar to) are used for comparison.
- Acts as verbs in mathematical language.

• Grouping symbols
- Symbols like parenthesis ‘( )’, braces ‘{ }’, and brackets ‘[ ]’ are
used to associate groups of numbers and operators.

• Variables
- Are letters (x, y, z) that represent quantities
- Act as pronouns
What is the difference between
“Mathematical Expression”
and
“Mathematical Sentence”?
Mathematical Expression
A mathematical expression refers to objects of interest
acting as the subject in the ordinary language.

Ex.
4, -5, 5+2, 2e
(All do not state complete thoughts)
Mathematical Sentence
A sentence with a complete thought is a mathematical
sentence which can be regarded as true or false.

Ex.
1. 5 plus 2 is equal to the square root of 49.
5 + 2 = 49
Here the symbol ‘+’ is a connective while ‘=‘ is the verb.
The sentence is true.
EXERCISE:
Which of the following are sentences?

1. Manila is the capital of the Philippines.

2. The province of Cavite
3. The number 5 is a composite number.
4. 𝑥 + 1 2
5. 𝑥 + 1 = 3
Section 02
Basic Concepts of Mathematical
Language: Sets, Functions, and
Binary Operations
Learning Outcomes

Outcome 1
Students can demonstrate understanding
of the basic concepts in sets, functions,
and binary operations

Outcome 2
Students can represent sentences
using set notations
Learning Outcomes

Outcome 3
Students can identify if a given set is a
function

Outcome 4
Students can perform binary
operations on sets
Introduction

The mathematical language is full of terminologies

and mathematical notations, and has very precise and
powerful meaning. Notations are very important in
understanding the mathematical language which may
include the use of sets, functions, and binary operations.
Sets
Sets
A set is a collection of objects which are called elements of a set.

If an object belongs to a particular set 𝑺 then write 𝒂 ∈ 𝑺.

If 𝑎 is not an element of the set, then write 𝒂 ∉ 𝑺.

There are two ways to represent the element of the set:

▪ Roster Method
▪ Set Builder Notation
Sets
• Roster Method
- Lists down all the elements.
Example:
Set A is the set of counting numbers less than 6.
Set Notation: A = {1, 2, 3, 4, 5}
This is the finite set with the cardinality of 5
- the number of
elements a given
set contains
Remember:
• Natural numbers (N) are the set of positive integers commonly
used for counting and ordering. They typically start from 1 and
continue indefinitely.
• An integer (Z) is a whole number that can be positive, negative,
or zero
• Rational Numbers (Q) can be expressed as fractions where the
numerator and denominator are integers, and the denominator is
not zero.
• Irrational numbers (P or R/Q): These cannot be expressed as
simple fractions and have non-repeating, non-terminating
decimal expansions (e.g., 2,𝜋,𝑒)
• Real numbers (R) are the set of numbers that include all the
rational and irrational numbers.
• Composite numbers are positive integers that have more than
two distinct positive divisors. In other words, a composite number
can be divided evenly by 1, itself, and at least one other integer.
Exercise
1. The set of counting numbers greater than -1 and less
than 9.
2. The set of integers satisfying 𝑥−2≤5.

Remember:
Z - represent integers
Try This!
Direction: Use the ROSTER method to represent each given set
1. Set of Natural Numbers Less Than 6
2. Set of Even Integers Between 1 and 10
3. Set of Odd Integers from 1 to 15
4. Set of Prime Numbers Less Than 20
5. Set of Whole Numbers Less Than 5
6. Set of Letters in the English Alphabet
7. Set of Months in a Year:
8. Set of Colors in a Rainbow:
9. Set of Fibonacci Numbers Less Than 30
10. Set of Digits
Sets
• Set Builder Notation
- Presents the elements by stating their common properties.
- It is also useful when describing infinite sets
Example:
Set A is the set of counting numbers greater than 6.
Set Notation: 𝑨 = 𝒙 𝒙 ∈ 𝑵 𝒂𝒏𝒅 𝒙 > 𝟔}
where N = set of counting numbers
It is read as “the set of all x such that x is a counting
number and greater than 6”.
Exercise
1. The set of natural numbers that are less than 7.
2. The set of composite numbers that are divisible by 4
and less than 18.
Remember:
ℕ - symbolizes natural
number
Functions
Functions
A function 𝒇 assigns each element x of set A to a unique element,
y of set B. In symbols 𝒚 = 𝒇 𝒙 .

Set A Set B
Functions
A function can be described in following ways:
• Verbally
• Equations or formulas
• Diagrams
Example:
Which of the following is a function?
a. 𝐴 = { −2, 4 , −1, 1 , 1, 1 , 2, 4 }
b. B = { 4, −2 , 1, −1 , 1, 1 , 4, 2 }
Functions
a. 𝐴 = −2, 4 , −1, 1 , 1, 1 , 2, 4
Solution:
Set A is a function, since every first element in any
ordered pair (x, y) is assigned with exactly one element.

-2

-1 1

1 4

2
Functions
Notes:
(x, y) = ordered pairs
x = first element / first coordinate in ordered pairs
y = second coordinate in ordered pairs

From previous example:

Domain – the set of all first coordinates
𝐷 = −2, −1, 1, 2
Range – the set of all second coordinates
𝑅 = {1, 4}
Functions
b. B = { 4, −2 , 1, −1 , 1, 1 , 4, 2 }
Solution:
Set B is not a function since 1 is paired with two numbers
(-1 and 1), and 4 is paired with -2 and 2.

-2

1 -1

4 1

2
Binary Operations
Binary Operations
A binary operation is an operation that takes two input
elements from a set and gives a unique result that also belongs
to the same set. It is denoted as ∗, ۨ, ⋆ , 𝑒𝑡𝑐.

Example: Let set of integers 𝐼 = {… , −2, −1, 0, 1, 2, … }

Operation: a ⋆ b = a + b
Given a = 3, b = 5
Then, 3 ⋆ 5 = 3 + 5 In this example the binary operation
=8 is denoted as star "⋆". Moreover, 3, 5,
and 8 all elements of Set I.
Binary Operations
A set S is considered to be closed under a binary operation " ⋆ “,
if for every s and t in S, s ⋆ t ∈ S.

Previous example: (Addition of Integers)

Let set of integers 𝐼 = {… , −2, −1, 0, 1, 2, … }
Operation: a ⋆ b = a + b
Given a = 3, b = 5
In this example Set I is closed under
Then, 3 ⋆ 5 = 3 + 5 binary operation (basic addition
=8 “+”), because any number you add
from the set of integers will always
result another integer.
Binary Operations

Example: (Division of Integers)

Let set of integers 𝐼 = {… , −2, −1, 0, 1, 2, … }
Operation: a ⋆ b = a ÷ b
Given a = 3, b = 5 In this example Set I is not closed
under binary operation (basic
Then, 3 ⋆ 5 = 3 ÷ 5
division “÷ ”), because although you
= 3/5 or 0.6 can divide 6 and 3 to get 2, which
are all integer, not all combinations
will remain true like 3 divided 5,
which resulted 0.6, which is not in
the set of integers.
EXERCISE:
Directions: Use the roster method to represent each given set.

1. The set of counting numbers greater than -1 and less than 9.

2. The set of integers satisfying x-2≤5.
3. The first names of all the members of the class organization.
4. The set of months of a year ending with the letters “ber”.
5. Set of barangays in Siocon starting with letter “T”.
Section 03

Mathematical Logic
Learning Outcomes

Outcome 1
Students should be able to write
statements in symbolic forms

Outcome 2
Students must be able to write
symbolic statements in words
Learning Outcomes

Outcome 3
Students should be able to construct a
truth table for a given compound
statement

Outcome 4
Students must be able to use truth
table for logical equivalence
Learning Outcomes

Outcome 5
Students should be able to write a
conditional statement in other forms
DIAGNOSTICS:
Agree or Disagree?

1. The statement 2 ≤ 5 is a disjunction.

2. The statement ~ 𝑝 ∧ 𝑝 is a self contradiction.

Statements
Statements
• A statement is an assertion which can be regarded as true or
false.
• A simple statement is a single statement which does not
contain other statements as parts.
• A compound statement contains two or more statements
• A logical connective combines simple statements into
compound statements.
Statements
Simple statements

Example: The following sentences are simple statements.

a. I will go to the mall.
b. The sky is cloudy.
c. You will receive your promotion.
Statements
Logical Connectives

Propositional
Connectives Symbols Example Read
Logic
Not Negation ~ ~𝑝 Not p

And/But Conjunction ∧ 𝑝∧𝑞 p and q

Or Disjunction ∨ 𝑝∨𝑞 p or q

Implies Conditional ⟶ 𝑝⟶𝑞 If p then q

p implies q and q implies p /
If and only if Biconditional ⟷ 𝑝⟷𝑞
p if only if q
Statements
Compound statements
• Consider the following:
h: Harry is happy.
v: Harry is going to watch a volleyball game.
r: It is going to rain.
s: Today is Sunday.

Compound Sentence to symbolic form

1. Today is Sunday and Harry is not happy.
𝒔 ∧ ~𝒉
2. If it is going to rain, then Harry is not going to watch a volleyball game.
𝒓 → ~𝒗
The Converse, the Inverse,
and the Contrapositive
The Converse, the Inverse, and the Contrapositive

• The conditional statement, p (antecendent) ⟶ q

(consequent), has the following forms:
a. If p, then q. j. p yields q.
b. p implies q. k. q follows from p
c. p only if q.
d. Not p or q.
e. Every p is q.
f. q, if p.
g. q provided that p.
h. q is a necessary condition for p.
i. p is a sufficient condition for q.
The Converse, the Inverse, and the Contrapositive

Example:
p = She is allowed to join the volleyball team.
q = She knows how to receive a ball.

a. If she is allowed to join the volleyball team, then she knows how
to receive a ball. (form a)
b. Being able to receive a ball is a necessary condition to be
allowed to join the volleyball team. (form h)
c. She is allowed to join the volleyball team only if she knows how
to receive a ball. (form c)
The Converse, the Inverse, and the Contrapositive

Derived Forms of a Conditional Statement

There are three (3) ways to restate a conditional statement –-
-- the converse, the inverse and the contrapositive. However,
restating the statement into one of these forms may change the
meaning of the original statement.
The conditional statement 𝑝 ⟶ 𝑞 may be restated to:
• Converse Form: 𝑞 ⟶ 𝑝
• Inverse Form: ~𝑝 ⟶ ~𝑞
• Contrapositive form: ~𝑞 ⟶ ~𝑝
The Converse, the Inverse, and the Contrapositive

Example:
p = She is allowed to join the volleyball team.
q = She knows how to receive the ball.

Converse: If she knows how to receive the ball, then she is allowed
to join the volleyball team.
Inverse: If she is not allowed to join the volleyball team, then she
does not know how to receive the ball.
Contrapositive: If she does not know how to receive the ball, then
she is not allowed to join the volleyball team.
Truth Tables
Truth Tables
A logical statement A. Assertion C. Conjunction
may be either true or p p q p∧q
false. The truth table
T T T T
is a summary of all
F T F F
possible truth values
of a statement. Here F T F

are some examples. B. Negation F F F

p ~p

T F

F T
Truth Tables
D. Disjunction E. Conditional F. Biconditional
p q p∨q p q p⟶q p q p⟷q

T T T T T T T T T

T F T T F F T F F

F T T F T T F T F

F F F F F T F F T
Compound Statements and their Truth Table

Compound statements Example:

𝑝 ∨ 𝑞 ∧ ~𝑝
are complex statements
built up on two or more
Truth Table:
simple statements by
p q p∨q ~p 𝑝 ∨ 𝑞 ∧ ~𝑝
using connectives. In
joining two statements, T T T F F

parenthesis is used to T F T F F
enclose a single F T T T T
statement. F F F T F
 Compound Statements and their Truth Table
Example:
~𝑝 ∨ (~𝑞 ⟶ 𝑝)
Truth Table:
p q ~p ~q (~𝑞 ⟶ 𝑝) ~𝑝 ∨ (~𝑞 ⟶ 𝑝)

T T F F T T

T F F T T T

F T T F T T

F F T T F T

Tautology – a statement that is true for all truth values. (Above is an example)
Contradiction - a statant that is false for all truth values.
Logical Equivalence

Two mathematical Example:

𝑝 ⟶ 𝑞 𝑎𝑛𝑑 ~𝑝 ∨ 𝑞
statements are
logically equivalent
Truth Table:
if their truth tables
p q ~p 𝑝⟶𝑞 ~𝑝 ∨ 𝑞
are the same.
T T T T T

T F T F F

F T F T T

F F F T T
De Morgan’s Laws

Let p and q are propositional statements, then,

~ 𝑝 ∧ 𝑞 ⟷ (~𝑝) ∨ (~𝑞)
~ 𝑝 ∨ 𝑞 ⟷ (~𝑝) ∧ (~𝑞)
Example:
Prove: 𝑝 ⟶ 𝑞 ⟷ (~𝑞) ⟶ (~𝑝)
𝑝 ⟶ 𝑞 ⟷ (~𝑝) ∨ 𝑞 Logical equivalence of 𝑝 ⟶ 𝑞
Proof:
𝑝 ⟶ 𝑞 ⟷ 𝑞 ∨ (~𝑝) The operator ∨ is commutative.

𝑝 ⟶ 𝑞 ⟷ ~(~𝑞) ∨ (~𝑝) For any statement p, ~(~p) = p

𝑝 ⟶ 𝑞 ⟷ (~𝑞) ⟶ (~𝑝) The converse of 𝑝 ⟶ 𝑞 is also true.

Quantifiers

Quantifiers are special words like “all”, “any”, “every”, and

“some”, which can be used to analyze mathematical
sentences or may be used to define mathematical terms. It
is categorized into universal and existential quantifiers.
Quantifiers and Notations

Universal Quantifiers such as “all” and “every” are used to denote

that all elements in the set satisfy a given property. Its notation is
"∀“.

Notation Example:
∀𝑥 ∈ 𝑆 𝑃(𝑥) this means that “For all x in set S, P of x is true” or
“the statement P(x) is true for every x in set S”
Quantifiers and Notations

Existential Quantifiers such as “some” and “there exists” are used

to denote that one or more elements of a set satisfy a given
property. Its notation is "∃“.

Notation Example:
∃𝑥 ∈ 𝑆 𝑃(𝑥) this means that “There exists x in set S, P of x is true” or
“there exists at least one element x of set S for which
P(x) is true”
END
Thanks!
Do you have any questions?
youremail@[Link]
+34 654 321 432
[Link]

CREDITS: This presentation template was created by Slidesgo, and

includes icons by Flaticon, and infographics & images by Freepik

Please keep this slide for attribution

Resources
Did you like the resources in this template? Get them on these websites:

Vectors
● Business workshop twitter header

Photos
● Side view people correcting grammar mistakes
● Businessperson's hand marking tick on sticky notes over document
● College mates studying together
● Colleagues doing team work for a project
● Close up on still life of hard exams
 Instructions for use
If you have a free account, in order to use this template, you must credit Slidesgo by keeping the Thanks slide. Please
refer to the next slide to read the instructions for premium users.

As a Free user, you are allowed to:

● Modify this template.
● Use it for both personal and commercial projects.

You are not allowed to:

● Sublicense, sell or rent any of Slidesgo Content (or a modified version of Slidesgo Content).
● Distribute Slidesgo Content unless it has been expressly authorized by Slidesgo.
● Include Slidesgo Content in an online or offline database or file.
● Offer Slidesgo templates (or modified versions of Slidesgo templates) for download.
● Acquire the copyright of Slidesgo Content.

For more information about editing slides, please read our FAQs or visit our blog:
[Link] and [Link]
 Fonts & colors used
This presentation has been made using the following fonts:

Montserrat
([Link]

Roboto
([Link]

#372549 #fcf2e7 #f2d0a9 #eaac8b

#774c60 #eacdc2