Mathematics MIDTERMS

CDU – CN
MATH / Lecture / First Semester

Module 2: Mathematical Language and Symbols

Topic Outline MATHEMATICAL SENTENCE

2.1 Mathematical Language  Mathematical sentence – a sentence that express a

2.2 Mathematical Symbols complete thought, thus, can be regarded as true or
2.3 Sets false
2.4 Relations and Function  Examples of Mathematical Sentence:
2.5 Mathematical Logic
o 3y = 2x + 5
o 11 > 7
o √36 = 6
2.1 MATHEMATICAL LANGUAGE
o 𝑥+2≥5
CHARACTERISTICS OF THE MATHEMATICAL o 5 + 4 = √81
LANGUAGE o 1/3 = 1/1/3
 Each example states a complete thought
 It is precise  Can determine if it is true or false
 It is concise  Check how the verb “is” are used in each
 It is powerful mathematical sentence
 It is non-temporal
 It has vocabulary and parts of speech WRITE AS MATHEMATICAL SENTENCES

PART OF SPEECH FOR MATHEMATICS  Write as mathematical sentences. Discuss how the
word “is” is used
 Numbers – represents quantity, nouns/objects
 Operation symbols – connectives 1. Ten is the square root of 100 – 10 = √100
 Relation symbols – used for comparison, act as o “is” denotes equality
verbs
2.Ten is greater than 9 – 10 > 9
 Grouping symbols – associate numbers and
o “is” denotes inequality
operators
 Variables – letters that represents quantities, acts 3.Ten is an even number – 10 ∈ {2x | x ∈ ℕ}
as pronouns o “is” denotes a membership to a set
4.Ten is multiple of 5 - 10 ∈ {5x | x ∈ ℕ}
MATHEMATICAL EXPRESSION VS MATHEMATICAL o “is” denotes a membership to a set
SENTENCE
2.2 MATHEMATICAL SYMBOLS
MATHEMATICAL EXPRESSION
Mathematical Symbols
 Mathematical expression – refers to the objects of Symbols Meaning
interest acting as a subject in the ordinary language ∈ is an element of
 Examples of Mathematical Expression: ∉ is not an element of
o 9 ⊆ is a subset
o 5+4 ⊂ is a proper subset of
o 3x – 16 ℝ real number
ℕ natural number
o 1/y
ℤ integers
o > 5x
ℚ rational numbers
o (0,0) W whole numbers
∃ there exists
 Each example does not express a complete thought ∀ for all
 Cannot determine if it is true or false ∑ the sum of

Mathematical Language and Symbols | 1

Mathematics MIDTERMS
CDU – CN
MATH / Lecture / First Semester

Module 2: Mathematical Language and Symbols

MATHEMATICAL SYMBOLS INTO ENGLISH 2. The set of integers satisfying 𝑥 − 2 ≤ 5

SENTENCE o B = {…-1, 0, 1, 2, 3, 4, 5, 6, 7)
3. The first names of all member of the group One
 Write as an English sentence and tell whether they Direction
are TRUE or FALSE o C= {Harry, Liam, Niall, Zayn, Louis}
2
1. ∀ 𝑥 ∈ ℝ, x ≥ 0 – TRUE 4. The set of numbers that are divisible by 3 and less
o For all real numbers x, its square is greater than equal to 12.
than or equal to zero. o D = {3, 6, 9, 12}
2 2 2
2. ∀ 𝑥, 𝑦 ∈ ℝ, (𝑥 + 𝑦) = 𝑥 + 2𝑥𝑦 + 𝑦 - TRUE
o For all real numbers x and y, the square of
 Use the set Builder Notation in describing the
their sum is equal to the sums of their squares
plus twice their product. following sets:
3. ∃ 𝑚, 𝑛 ∈ ℤ, 𝑚 − 𝑛 ≤ 𝑚 + n - TRUE 1. The set of natural numbers that are less than 7
o There exists integers m and n such that m o A = {x | x ∈ ℕ, x < 7}
minus n is less than or equal to the sum of m 2. The set of whole numbers less than 8
and n. o B = {x | x ∈ W, x < 8}
4. ∀ 𝑎, 𝑏 ∈ ℚ, 𝑎𝑏 = 0 ⇒ 𝑎 = 0 ∨ 𝑏 = 0 - TRUE 3. C = {1, 4, 9, 16, 25, 36, 49, …}
o For all rational numbers a and b, if their 2
o C = {x | x ∈ ℤ, x ≠ 0} or C = { x2 | x ∈ ℕ}
product is zero then either a or b equals 0.
2.3 SETS 4. The set of positive even numbers that is less than 15
o D = {2x | x ∈ ℕ, x < 15}
 Sets - collection of objects which are called elements
2.4 RELATIONS AND FUNCTIONS
of the set
 If an object a belongs to particular set S, then it can
 Relation – rule that relates values from a set of
be symbolized as 𝒂 ∈ 𝑺 values called a domain to a second set of values called
 If an object b does not belong to set S, then 𝒃 ∉ 𝑺 the range, represented by the set of ordered pairs
(x,y)
TWO WAYS TO DESCRIBE A SET o Relation: {(5,10), (1, 20), (3,9), (4,7)}
o Domain {x | x = 5, 1, 3, 4}
ROSTER METHOD o Range: {y | y = 10, 20, 9, 7}

 Roster Method - list down all the elements  Function - is a type of relation wherein each element
o A = {1, 2, 3, 4, 5} in the domain is related to only one value in the range
o B = {2, 4, 6, 8, …} by some rule, a set of order pairs (x,y) such that NO
o C = {1, 2, 3, 4, 5, …} two ordered pairs have the same x-value but different
y-values

SET BUILDER NOTATION

 Set builder notation - presents the elements by

stating their common properties. Useful for infinite sets
o A = {x I x ∈ ℕ and x > 6}
o B = {x I x ∈ ℤ}
o C = {x I x ∈ ℝ}

USING ROSTER METHOD AND SET BUILDER

NOTATION

 Use the Roster Method in describing the following

sets:
1. The set of counting numbers greater than – 1 and less
than 9
o A = {1, 2, 3, 4, 5, 6, 7, 8}

Mathematical Language and Symbols | 2

Mathematics MIDTERMS
CDU – CN
MATH / Lecture / First Semester

Module 2: Mathematical Language and Symbols

WHICH IS A FUNCTION  We will now shift our focus from expressions as our
object of interest to sentences instead, particularly,
1. {(d,a), (a,a), (e,b), (b,c)} – Function (many to one) statements.
 Recall that there are different types of sentences in
English
d  In logic, we will only consider declarative sentences
a a those which relay information
e b
b c LOGIC STATEMENTS

 A statement is a declarative sentence that is either

true or false, but cannot be both at the same time
2. {(2,1), (5,2), (5,3), (6,4)} – Relation (one to many)
SKILLS CHECK

1  Determine whether the given sentence is a statement.

2
2 If it is, state whether it is true or false.
5
6 3
1. 𝑥 + 6 = 5 Not a statement. (An open statement)
4
2. Study your MMW notes. Not a statement. (An
imperative sentence)
DOMAIN AND RANGE 3. 6 > 0 Statement which is true.
4. Wow! Math is amazing! Not a statement. (An
 Given the domain, find the range and list the ordered exclamatory sentence)
pairs 5. The heart has four chambers: two atria and two
ventricles. Statement which is true.
1. 𝑓(𝑥) = 𝑥 − 3 , with domain {4, 8, 12, 16}
o {(4,1), (8,5), (12, 9), (16,13)} SYMBOLIC LOGIC

2. (𝑡) = 𝑡+1 / , with domain {3, 4, 5}  Symbolic Logic - is a powerful tool for analysis and
communication in mathematics. It represents the
o {(3,4/3), (4,5/4), (5, 6/5)} natural language and mathematical language with
symbols and variables
DETERMINE IF EACH SCENARIO IS A FUNCTION
BRIEF HISTORY
1. Each person is assigned a birth date
o Function  Gottfried Wilhelm Leibniz (1646-1716)
2.Each course in a degree program is assigned to a o tried to advance the study of logic from a
tuition fee merely philosophical subject to a formal
o Function mathematical subject
3. Each basketball player has his own jersey number  Augustus De Morgan (1806-1871) and George Boole
o Function (1815-1864)
o contributed to the advancement of symbolic
2.5 MATHEMATICAL LOGIC logic as a mathematical discipline
o Boole published The Mathematical Analysis of
 Mathematical Logic - Tools for analysis and Logic in 1848
communication in mathematics o In 1854 he published the more extensive work,
An Investigation of the Laws of Thought
“Pure Mathematics is, in its way, the poetry of logical o concerning this document, the mathematician
ideas” – Albert Einstein Bertrand Russell stated, “Pure mathematics
was discovered by Boole in a work which is
 Logic – is the study of truth and reasoning called The Laws of Thought.”

Mathematical Language and Symbols | 3

Mathematics MIDTERMS
CDU – CN
MATH / Lecture / First Semester

Module 2: Mathematical Language and Symbols

SIMPLE STATEMENT TRUTH VALUE

 A simple statement is a statement that expresses a  The truth value of a simple statement is either True
single idea (T) or False (F)
o George Boole introduced the use of letters such  The truth value of a compound statement depends on
the truth values of its simple statements and its
as 𝒑, 𝒒, 𝒓, and 𝒔 to represent simple
connectives
statements. Note that it is necessary to use
lower case letters GROUPING SYMBOLS
o The truth value of a simple statement is based
on whether it is true or false
 Examples of Simple Statements: Symbolic Form The parenthesis indicate that
o I will stay at home. 𝑞 and ~r are grouped together
𝑝 ∧ (𝑞 ∨ ~r)
o I will go to the park.
o I will read a book. 𝑝 and 𝑞 are grouped together
(𝑝 ∧ 𝑞) ∨ r
o I will buy that bracelet.
𝑝 and 𝑞 are grouped together 𝑟
COMPOUND STATEMENT (𝑝 ∧ 𝑞) → (𝑟 ∨ s) and 𝑠 are also grouped
together
 A compound statement is a statement that conveys
two or more ideas TRUTH TABLE
o where simple statements are connected by
 A truth table is a table that shows the truth value of
words and phrases such as “and”, “or”, “if. . .
a compound statement for all possible truth values of
then”, and “if and only if” its simple statements
 Examples of Compound Statements:
o I will stay at home or I will go to the park. OBJECTIVES OF THE STUDY
o I will go to the park and I will read a book
 To provide elements for discussion on the usefulness
LOGICAL CONNECTIVE of teaching formal logic in medical training. Medical
students can improve and systematize their medical
 A logical connective combines simple statements into reasoning, specifically during diagnostic and
compound statements therapeutic decision-making
 As a corollary, this approach assimilates complex
STATEMENTS AND CONNECTIVES
diagnostic and therapeutic processes to logical
 The main parts of symbolic logic are statements and formulae, truth tables and flowcharts that can be
connectives easily incorporated into clinical decision support
systems
Statement Connective Symbolic Propositiona
form l Logic UNDERSTANDING TRUTH TABLES
not 𝒑 not ~𝒑 Negation
 Given a single statement 𝒑,
𝒑 and 𝒒 and 𝒑∧𝒒 Conjunction o there is two possible truth values: true (T) and
𝒑 or 𝒒 or 𝒑∨𝒒 Disjunction false (F)

If 𝒑, then 𝒒 If…then 𝒑→𝒒 Conditional

p
𝒑 if and If and only 𝒑↔𝒒 Biconditional T
only if 𝒒 if
F

Mathematical Language and Symbols | 4

Mathematics MIDTERMS
CDU – CN
MATH / Lecture / First Semester

Module 2: Mathematical Language and Symbols

 Given two statements 𝒑 and q, o If 𝒑 is true, then ∼ 𝒑 is false

o there are four possible truth value o If 𝒑 is false, then ∼ 𝒑 is true
combinations, that is, TT, TF, FT, FF. As a
result, there are four rows in the truth table p ~p
T F
p q
F T
T T
T F  For example:
F T o p: Even numbers are divisible by 2. TRUE
F F ~p: Even numbers are not divisible by 2. FALSE

Note: The negation of the negation of a statement is

 Given three statements p, q and r,
the original statement. Thus ~ (~𝒑) can be replaced by
o there are eight truth value combinations,
𝒑 in any statement
ranging from TTT to FFF. In general, given n
statements, there are 𝟐𝒏 rows (or cases) in CONJUNCTION
the truth table
 Conjunction of 𝒑 and 𝒒 is formed by joining two
p q r statements or propositions 𝒑 and 𝒒 with the word
“and” denoted by 𝒑 ∧ 𝒒 (read as “ 𝒑 and 𝒒”)
T T T
T T F  Writing the conjunction of two statements
T F T o 𝒑: Yesterday is Wednesday.
T F F o 𝒒: Tomorrow is Friday.
F T T 𝒑 ∧ 𝒒: Yesterday is Wednesday and tomorrow
F T F is Friday.
F F T
F F F  The truth table of conjunction:
o A conjunction 𝒑 ∧ 𝒒 is true only when both of
BASIC TRUTH TABLES its conjuncts are true. It is false in all other
three cases
NEGATION
p q p∧q
 Negation of p indicates the opposite of the
proposition p denoted by ~𝒑 read as “not 𝒑”
T T T
T F F
 Writing the negation of a statement F T F
o 𝒑: Today is Monday F F F
~𝒑: Today is not Monday
o 𝒒: 𝟐 is a rational number  For example:
~𝒒: 𝟐 is an irrational number o Determine whether each compound statement
is true of false
o 𝒓: Even numbers are divisible by 2
o Given: 𝟒 + 𝟐 = 𝟔 and 𝟑 is not a prime number.
~𝒓: Even numbers are not divisible by 2 𝒑: 𝟒 + 𝟐 = 𝟔
𝒒: 𝟑 is not a prime number
 The truth table of negation
o The possible truth values of a negation are
opposite to the possible truth values of the p q p∧q
statement it negates. T F F

Mathematical Language and Symbols | 5

Mathematics MIDTERMS
CDU – CN
MATH / Lecture / First Semester

Module 2: Mathematical Language and Symbols

DISJUNCTION p q p→q
 Disjunction of 𝒑 and 𝒒 is formed by joining two T T T
statements/propositions 𝒑 and 𝒒 with the word “ or ” T F F
denoted by 𝒑 ∨ 𝒒 (read as “ 𝒑 or 𝒒”) F T T
F F T
 Writing the disjunction of two statements
o 𝒑: I am going to the park.  For example:
o 𝒒: I am going to sleep all day. o Identify the truth value of the statement,
“If 𝟓 > 𝟑, then 𝟐 + 𝟕 = 𝟑.”
𝒑 ∨ 𝒒: I am going to the park or I am going to
o Statement is false because the antecedent is
sleep all day. true and the consequent is false

 The truth table of disjunction:  The Derived Forms of Conditional Statements

o Converse Form: 𝒒 → 𝒑
o A disjunction 𝒑 ∨ 𝒒 is false only when both of
o Inverse Form: ~𝒑 → ~𝒒
its disjuncts are false. In the other three cases, o Contrapositive Form: ~𝒒 → ~p
the disjunction is true
 Writing the converse, inverse and contrapositive of
p q p∨q a given sentence

T T T o Given: “Every rectangle is a parallelogram.”

T F T 𝒑 → 𝒒: If it is a rectangle, then it is a
parallelogram
F T T o Converse Form:
F F F 𝒒 → 𝒑: If it is a parallelogram, then it is a
rectangle.
o Inverse Form:
 For example: ~𝒑 → ~𝒒: If it is not a rectangle, then it is not a
o Determine whether each compound statement parallelogram
is true of false. o Contrapositive Form:
o Given: 𝟗 ≥ 𝟒 ~𝒒 → ~𝒑: If it is not a parallelogram, then it is
not a rectangle
𝒑: 𝟗 = 𝟒
𝒒: 𝟗 > 4 BICONDITIONAL

p q p∨q  Biconditional statements are expressed as 𝒑 ↔ 𝒒

which represents “𝒑 if and only if 𝒒.” This statement is
F T T equivalent to (𝒑 → 𝒒) ∧ (𝒒 → 𝒑)

CONDITIONAL  Writing biconditional statements

o 𝒑: You pass the exam.
 Conditional Statements are usually expressed as “If o 𝒒: You get a score of 75% or higher.
𝒑 then 𝒒 ” denoted by 𝒑 → 𝒒 (read as “ 𝒑 implies 𝒒”) 𝒑 ↔ 𝒒: You pass the exam if and only if you
where 𝒑 is a hypothesis/premise and 𝒒 is a conclusion get a score of 75% or higher.

 Writing conditional statements  The truth table of biconditional:

o 𝒑: Two triangles are similar. o The biconditional 𝒑 ↔ 𝒒 is true only when 𝒑
o 𝒒: The corresponding sides are proportional. and 𝒒 have the same truth value. It is false in
𝒑 → 𝒒: If two triangles are similar then the all other cases
corresponding sides are proportional.

 The truth table of conditional:

o The conditional 𝒑 → 𝒒 is false if 𝒑 is true and
𝒒 is false. It is true in all other cases

Mathematical Language and Symbols | 6

Mathematics MIDTERMS
CDU – CN
MATH / Lecture / First Semester

Module 2: Mathematical Language and Symbols

p q p↔q TRUTH TABLE TO SHOW EQUIVALENCE EXAMPLE

T T T 1. Truth Table to show the equivalence of 𝒑 → 𝒒 and

T F F ~𝒑 ∨ 𝒒.
F T F
p q ~p p→q ~p ∨ q
F F T
T T F T T
 For example: T F F F F
o Identify the truth value of the statement,
“𝒙 + 𝟒 = 𝟕 if and only if 𝒙 = 𝟑.” F T T T T
o Both equations have the same truth value for F F T T T
any given value of 𝑥, so this is a true
statement NOTATION FOR EQUIVALENT STATEMENTS

TRUTH TABLES OF COMPOUND STATEMENTS  The notation 𝒑 ≡ 𝒒 is used to indicate that the
statements 𝒑 and 𝒒 are equivalent.
 For a statement that involves a combination of ● From the example, we can write that:
conjunctions, disjunctions, negations, conditionals o 𝒑 → 𝒒 ≡ ~𝒑 ∨ q
and/or biconditionals
DE MORGAN’S LAWS
TRUTH TABLES FOR COMPOUND STATEMENTS
EXMAPLES  De Morgan’s Laws for Statements
o For any statements 𝒑 and 𝒒 ,
1. Construct a table for: ~𝒑 ∨ q ~(𝒑 ∨ 𝒒) ≡ ~𝒑 ∧ ~𝒒
~(𝒑 ∧ 𝒒) ≡ ~𝒑 ∨ ~𝒒
p q ~p ~p ∨ q
 Show that ~(𝒑 ∨ 𝒒) and ~𝒑 ∧ ~𝒒 are equivalent
T T F T statements
T F F F
p q ~p ~q p∨q ~(𝒑 ∨ 𝒒) ~𝒑 ∧ ~𝒒
F T T T
F F T T T T F F T F F
T F F T T F F
2. Construct a table for: (~𝒑 ∨ 𝒒) ∧ ~𝒒 F T T F T F F
F F T T F T T
p q ~p ~q ~p ∨ q (~𝒑 ∨ 𝒒) ∧ ~𝒒
T T F F T F  Show that ~(𝒑 ∧ 𝒒) and ~𝒑 ∨ ~𝒒 are equivalent
statements
T F F T F F
F T T F T F p q ~p ~q p∨q ~(𝒑 ∧ 𝒒) ~𝒑 ∨ ~𝒒
F F T T T T
T T F F T F F
LOGICAL EQUIVALENCE T F F T F T T
F T T F F T T
 Two mathematical statements are logically F F T T F T T
equivalent if the final output of their truth tables are
exactly the same LET”S TRY THIS
 For example, 𝒑 → 𝒒 is not logically equivalent to
𝒒 → 𝒑 but 𝒑 → 𝒒 is logically equivalent to ~𝒑 ∨ 𝒒.  Use De Morgan’s laws to restate the following
 If P and Q are compound statements, then P and Q sentences in an equivalent form
are logically equivalent if and only if 𝑝 ↔ 𝑞 is a
tautology. 1. Given: It is not true that, I graduated or I got a job
Solution:
o Let 𝒑 represent the statement “I graduated.”
o Let 𝒒 represent the statement “I got a job.”

Mathematical Language and Symbols | 7

Mathematics MIDTERMS
CDU – CN
MATH / Lecture / First Semester

Module 2: Mathematical Language and Symbols

o In symbolic form, the original sentence is,  Examples:

~ (𝒑 ∨ 𝒒). o 𝒑: All dogs are mean. F
o One of De Morgan’s laws states that this is ~𝒑: Some dogs are not mean. T
equivalent to ~𝒑 ∧ ~𝒒. o 𝒒: No doctors write in a legible manner. F
o Thus, a sentence that is equivalent to the ~𝒒: Some doctors write in a legible manner.
original sentence is “I did not graduate and I
did not get a job.”
~ END OF MODULE 2 ~
2. Given: “It is not true that, I am going to the dance
and I am going to the game.” Trans by: Jan Kylle Jala BSN 1-I
Solution:
o Let 𝒑 represent the statement “I am going
to the dance.”
o Let 𝒒 represent the statement “I am going to
the game.”
o In symbolic form, the original sentence is,
~(𝒑 ∧ 𝒒).
o One of De Morgan’s laws states that this is
equivalent to ~𝒑 ∨ ~𝒒.
o Thus, a sentence that is equivalent to the
original sentence is “I am not going to the
dance or I am not going to the game.”

QUANTIFIERS

EXISTENTIAL QUANTIFIER

 An Existential quantifier indicates that the statement

is true for at least one element denoted by ∃
 uses the words “some”, “there exists” and “at least
one”
 Examples:
o Some birds do not fly.
o There exists a relationship between the
mathematical language and the English
language.
o There is a number whose square is 9

UNIVERSAL QUANTIFIER

 A Universal quantifier indicates that the statement

is true for all or at all times denoted by ∀
 “None” or “no” indicates the non-existence of
something
 “All” and “every”
 Examples:
o All prime numbers are greater than 1.
o No prime number is less than 1.

NEGATION OF QUANTIFIED STATEMENTS

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

Mathematical Language and Symbols | 8