MODULE 4

Basic Concept of
Mathematical
Language and
Elementary Logic
 Objectives
At the end of the period, the students should be able to:
1. Perform operations on mathematical expressions
correctly.
2. Acknowledge that mathematics is a useful language
 Set
• is a collection of objects which are called elements of the
set.
 2 ways to represent the elements of the
set.
1.Roster Method - lists of all the elements
Example: Set A is the set of counting numbers less than
5: A = { 1, 2, 3, 4}
2.Set Builder Notation - presents the elements by stating
their common properties
Example: Set B is a set of integers greater than 10
B = { x / x Ɛ Z and x< 10}
 Function
• f assigns each element of x set A to a unique element, y
of set B. In symbols, y = f(x)

A function can be described in the following ways:

• Verbally
• Equation or formula
• Diagram
 Which of the following is a function?
1.A = {(-2,4), (-1,1), (2,4)}
2.B = {(4,-2), (1,-1), (4,2)}
 Answers

1. Function 2. Not a function

-2
1
-1
4
2
 Mathematical Logic
• symbolic logic is a powerful tool for analysis and
communication in mathematics. It:
Allows us to determine the validity of arguments in and out of
mathematics
Illustrates the importance of precision and conciseness of the
language of mathematics
 Statement or Proposition
•Must express a complete thought.
•A declarative sentence or statement that is either true or
false but not both.
 Which of the following is a Proposition?
1. All multiples of 5 are odd numbers.
2. Sketch the graph of the function.
 Basic Propositional Logic
Connectives Propositional Symbol Example Read as Logic
Logic
Not Negation ~ ~p not p reciprocal of p
And / But Conjunction ^ p^q P and Q True if and only if P and
Q are both true
Or Disjunction ˅ pvq P or Q True if and only if P is
true or Q is true or both
are true
Implies Conditional → p →q P implies QIf P True under all
then QQ if PP circumstances except
only if Q when P is true and Q is
false.

If and Only Bi conditional ↔ p↔q P if and only if True if and only if P and
If Q Q are both true or both
false
 p: today is cloudy day.
q: it will rain today.
1. p ^ q
Today is cloudy day and it will rain.
2. p v ~q
Today is cloudy day or it will not rain.
3. p→q
If today is cloudy day then it will rain.
4. p ↔q
Today is cloudy day if and only if it will rain.
 The Converse, the Inverse and the
Contrapositive
Given the conditional statement: p →q
Converse: q →p
Inverse: ~p → ~q
Contrapositive: ~q →~p
 Write the converse, the inverse and the contrapositive of the
given sentence.

“She is allowed to join the volleyball team, only if 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 table
• is the summary of all possible truth values of a statement.
 Compound Statement
• are complex statements built up on two simple
statements by using connectives.
 Tautology and Contradiction
Tautology
• If the truth tale of a compound statement is always true
regardless of the truth values of each component
statement

Contradiction
• If the truth tale of a compound statement is false true
regardless of the truth values of each component
statement
Construct the truth table of the compound
statement: (p˅q) ^ ~p

p q ~p p˅q (p˅q) ^ ~p
T T F T F
T F F T F
F T T F T
F F T F F
 Logical Equivalence
• Two mathematical statements are logically equivalent if
the final output of their truth tables are exactly the same.
Verify if the statements (p →q) and (~p ˅
q)
are logically equivalent.
p q ~p p →q ~p ˅q
T T F T T
T F F F F
F T T T T
F F T T T
 De Morgan’s Law
• states that complement of the union of two sets will be
equal to the intersection of their individual complements.
~(p ^ q) ↔ ( ~p ) ˅ ( ~q )
~(p ˅ q) ↔ ( ~p ) ^ ( ~q )
 Quantifiers
• are special words (e.g. all, any, every, some) that can be
used to analyze mathematical sentences or may be used
to define mathematical terms.
 Categorized of Quantifiers
1. Universal Quantifiers (e.g. all, every) are used to denote
that all elements in the set satisfy a given property .
Example:
Every triangle has 3 sides.
2. Existential Quantifiers (e.g. some there exists) are used
to denote that one or more elements of a set satisfy a given
property.
Example:
Some triangles are isosceles.
 Notations for Quantifiers

If S is a Set and P(x) is a statement about the element x,

then the notation ( Ɐx Ɛ S) P(x)
means “ For all x in S, P of x is true” or “ P(x) is true for
every x in set S”

the notation : ( Ǝx ƐS) P(x)

means “ There exists x in S, or which P of x is true” or “
There exists at least one element of x of S for which P(x) is
true”
 Use quantifiers to define odd and even
numbers.
1.An integer is even if there exists an integer y such that
x = 2y.
Answer: (Ǝy ƐZ) x = 2y

2.An integer is odd if there exists an integer y such that x =

2y+1.
Answer: (Ǝx ƐZ) x=2y+1
 Exercise 1.
Give the formal form of the given statements using the following
propositions.

p: Paul is happy.
q: Queenie is happy.
r: Paul is playing the guitar.

1.Both Paul and Queenie are happy.

2.Paul plays the guitar provided that he is happy.
3.If Paul is happy and plays the guitar, then Queenie is not happy.
 Exercise 2.
Translate the following symbols into words, given the propositions

m: Mark is British.
l: Lem is German.

4.m˅l
5.l ^ ~m
6.m˅(~m→l)
 Exercise 3.
Construct the truth tables for the following compound
statements.
7. p ^ (~q)
8. (p^q) ˅ [(~p) ˅q]
 Exercise 4.
Determine whether each pair of statements is logically
equivalent.
9. p˅(q^r) and (p˅q) ^ (p˅r)
10. ~(~p→q) and p→~q