class rules

q RULE #1: q RULE #3:

q RULE #2: q RULE #4:

course outline (GE Math 1)
Chapter 1 – The Nature of Mathematics
Chapter 2 – Mathematical Langauge and Symbols
Chapter 3 – The Language of Sets
Chapter 4 – Functions and Relations
Chapter 5 – Logic and Conditional Statements
Chapter 6 – Patterns and Problem Solving
Chapter 7 – Statistics
Chapter 8 – Graph Theory
Chapter 9 – Modular Arithmetic
Chapter 10 – Cryptology
CHAPTER 5a.
MATHEMATICAL LANGUAGE
AND SYMBOLS –
Introduction to Logic

Core Idea
“Mathematics has its own symbols,
syntax, and rules.”
learning objectives

1. discuss logical statements and its forms;

2. analyze information and the relationship between
statements;
3. transform statements in symbolic forms;
4. define a tautology; and
5. construct the truth table to evaluate whether a given
statement is a tautology or not.
challenge…
The mobster Big Maf's body was found floating in
his swimming pool. When Detective Columbus was
called to investigate the murder, he determined a
number of facts involving the prime - suspects.
Either the butler, James, was at home or Big Maf's
girlfriend, Blondie was out. If the private movie
projector was on, Blondie was at home. But if it was
off, Big Maf's first assistant, Godchild, murdered Big
Maf. On the other hand, if Godchild did not commit
the murder, the butler did it. However, James was
not at home at the time of the murder; a witness
verified that he was at the local curb market.
Detective Columbus quickly made his arrest. Whom
did he arrest? What reasoning did he follow?
LOGIC - science of correct thinking and reasoning
- an interdisciplinary field which studies truth
and reasoning

Uses of Logic
qLawyers and judges: communicate effectively, construct valid
arguments, analyze legal contracts, make decisions
qProgrammers: design computer software; formulate
algorithms
qMathematicians: solve problems, prove theorems
LOGIC - science of correct thinking and reasoning
- an interdisciplinary field which studies truth
and reasoning

Historical background

qGeorge Boole (1815-1864): English mathematician and

Father of symbolic logic

qCharles Lutwidge Dodgson (1832-1898): English writer

and “mathematician” known as Lewis Carroll who wrote
nonsensical classics such as Alice Adventures in
Wonderland Through the Looking Glass
Language we might use…

q Do we have a test today? Question

q Close the door. Command

q Math is a useful subject. Opinion

q CPU is an educational institution. Statement

 It is a declarative sentence that is
STATEMENT either true or false, but not both.

Example.
Determine whether each sentence is a statement or not.

a. Boracay Island is in the province of Iloilo.

b. How are you to find out?
c. 2 is a prime number.
d. � + 1 = 5 when � = 4.
SIMPLE STATEMENT It is a proposition/statement
that conveys a single idea.
It is a proposition/statement
COMPOUND STATEMENT that conveys two or more
ideas.
Example.
Determine which of the following is a simple or a compound
statement.
a. I am tired.
b. You will surrender or I will report you.
c. I still love her.
d. If you don’t love me, then it’s okay.
TABLE OF CONNECTIVES AND SYMBOLS
Connective/ Symbol Compound Statement Symbolic Type of Compound
Operation Form Statement

or ∨ � �� � �∨ � disjunction
and ∧ � ��� � �∧ � conjunction
If…then → �� �, �ℎ�� � �→� conditional
if and only if ↔ � �� ��� ���� �� � �↔� biconditional

not ∼ or ¬ ��� �; ��� � ∼ �; ∼ � negation

Historical background
George Boole used several symbols to represent simple
statements and connectives.
USING THE SYMBOLS
Example. Writing Compound Statements
Let �: “Hacksaw Ridge depicts a true story”;
�: “Hacksaw Ridge is a beautiful movie”.

Write the compound statement for each indicated.

1. � ∨ � 4. � ↔ �
2. � ∧ � 5. ¬ �
3. � → � 6. ¬ �
USING THE SYMBOLS

Example. Compound Statements in Symbolic Form

Consider the following statements:
�: It is raining
�: The streets are flooded.
�: There is heavy traffic.
Translate the following in symbolic form.
a. It is raining and the streets are flooded.
b. The streets are flooded or there is heavy traffic.
c. If it is not raining, then there is no heavy traffic.
USING THE SYMBOLS

Practice. Compound Statements in Symbolic Form

Consider the following simple statements.
�: Today is Friday. �: It is raining.
� : I am going to a movie. �: I am not going to the basketball game.

Write the following compound statements in symbolic form.

a. Today is Friday and it is raining.
b. It is not raining and I am going to a movie.
c. I am going to the basketball game or I am going to a movie.
d. If it is raining, then I am not going to the basketball game.
e. I am going to the basketball game if and only if today is Friday.
COMPOUND STATEMENTS AND GROUPING SYMBOLS

If a compound statement is written as an English

sentence, then a comma is used to indicate which
simple statements are grouped together. Statements
on the same side of a comma are grouped together.

Sentence Form (English)

�, ��� � �� ��� �.
� ��� �, �� �.
�� � ��� ��� �, �ℎ�� � �� �.
COMPOUND STATEMENTS AND GROUPING SYMBOLS
Example. Translating Compound Statements
Let �, �, and � represent the following.
� : You get a promotion.
�: You complete the training.
� : You will receive a bonus.

a. Write � ∧ � → � as an English sentence.

b. Write “If you do not complete the training, then you will not
get a promotion and you will not receive a bonus.” in symbolic
form.
COMPOUND STATEMENTS AND GROUPING SYMBOLS
Example. Translating Compound Statements
Solution for (a):
Given: � ∧ � → �
COMPOUND STATEMENTS AND GROUPING SYMBOLS

Example. Translating Compound Statements

Solution for (b):
“If you do not complete the training, then you will not get a promotion
and you will not receive a bonus.”
TRUTH VALUE
The truth value of a simple statement is
either true (T) or false (F).
The truth value of a compound statement
depends on the truth values of its simple
statements and its connectives.

TRUTH TABLE
The truth table shows the truth value of a
compound statement for all possible truth
values of its simple statements.
TRUTH TABLE
for Disjunction, Conjunction, Conditional,
Biconditional, and Negation
� � �∨� �∧� �→� �↔� ¬�
� � � � � � �
� � � � � � �
� � � � � � �
� � � � � � �
TRUTH VALUE OF NEGATION
� � ¬�
�: Two is an � � � ~�: Two is an
even number. � � � odd number.

�: Three is an � � � ~�: Three is an

even number. � � � odd number.

Moreover, ~ ~� = �.
Remark: Negating a true statement makes it false,
and negating a false statement makes it true.
NEGATION OF QUANTIFIERS

Existential quantifiers are used as prefixes to assert

the existence of something (ex. “there exists” and “at
least one”).

Universal quantifiers
- deny the existence of something
(ex. none, no);
- used to assert that every (or all) element of a
given set satisfies some condition
(ex. “all”, “every”).
NEGATING QUANTIFIERS

Statement Negation
All � are �. Some � are not �.
No � are �. Some � are �.
Some � are not �. All � are �.
Some � are �. No � are �.
NEGATING QUANTIFIERS
Examples:

Statement Negation
All integers are real numbers. - Some integers are not real numbers.

Some integers are not real numbers. - All integers are real numbers.

No integers are real numbers. - Some integers are real numbers.

Some integers are real numbers - No integers are real numbers

TRUTH VALUE OF A DISJUNCTION
Determine the truth value of each statement.

� � �∨�
� � � q 2 is less than 5 or even.
� � � q 2 is less than 5 or odd.
� � � q 2 is greater than 5 or even.
� � � q 2 is greater than 5 or odd.
TRUTH VALUE OF A CONJUNCTION
Determine the truth value of each statement.

� � �∧�
� � � q 2 is less than 5 and even.
� � � q 2 is less than 5 and odd.
� � � q 2 is greater than 5 and even.
� � � q 2 is greater than 5 and odd.
TRUTH VALUE OF A CONDITIONAL STATEMENT
Determine the truth value of each statement.

� � �→�
� � � q If 12 is divisible by 2, then it is even.
� � � q If 12 is divisible by 2, then it is odd.
� � � q If 12 is not divisible by 2, then it is even.
� � � q If 12 is not divisible by 2, then it is
not even.
TRUTH VALUE OF A BICONDITIONAL STATEMENT
Determine the truth value of each statement.

� � �↔�
� � � q 12 is divisible by 2 if and only if it is even.

� � � q 12 is divisible by 2 if and only if it is odd.

� � � q 12 is not divisible by 2 if and only if it is

even.
� � � q 12 is not divisible by 2 if and only if it is
not even.
TRUTH TABLE (Review)
for Disjunction, Conjunction, Conditional,
Biconditional, and Negation
� � �∨� � ∧ � � → � � ↔ � ¬�
� � � � � � �
� � � � � � �
� � � � � � �
� � � � � � �
TRUTH VALUE OF STATEMENTS

Practice. Identify the compound statement. Then, determine the truth value
of each statement.
1. -5 < -3 or -3 <-5.
2. If -5 < -3, then -5 > -3.
3. Two is an even and a prime number.
4. An angle is right if and only if it measures 90 degrees.
CONSTRUCTING TRUTH TABLE
FOR A LOGICAL STATEMENT

Example. Construct a truth table for the given logical statement.

1. ~ � → �
2. ¬ � ∧ � ∨ ¬ �
3. � → � ∧ � → �
VERIFY EQUIVALENT LOGICAL STATEMENTS

Example. Construct a truth table for the given logical statement

and verify if each are equivalent.
1. � ∧ ¬� ; ¬ � → �
2. �↔� ; �→� ∧ �→�

Remarks: � ↔ � ≡ � → � ∧ � → � (Biconditional)
 VERIFY EQUIVALENT LOGICAL STATEMENTS
Practice. Construct a truth table for the given logical statement and
verify if each are equivalent.
1. � → � and ¬ � ∨ � 4. ¬ � ∨ � and ¬ � ∧
¬�
2. ¬ � → � and � ∧ ¬ � 5. ¬ � ∧ � and ¬ � ∨ ¬�
3. � ↔ � and � → � ∧ � → �
Remarks: By De Morgan’s Law the following equivalence are considered:
1. � → � ≡ ¬ � ∨ � (Conditional)
2.¬ � → � ≡ � ∧ ¬ � (Negation of Conditional)
3. � ↔ � ≡ � → � ∧ � → � (Biconditional)
4.¬ � ∨ � ≡ ¬ � ∧ ¬� (Negation of Disjunction)
5. ¬ � ∧ � ≡ ¬ � ∨ ¬� (Negation of Conjunction
TAUTOLOGY It is a proposition (statement) that is always
true, regardless of the truth values of the
propositional variables it contains.
Example. Construct a truth for the given statement below. Is it a tautology?
�∨ ¬�∨�

p v (~p v q)
T T F T T
T T F F F
F T T T T
F T T T F
2 1
CONTRADICTION It is a proposition/statement
that is always false.

Example. Show that � ∧ ¬ � ∧ � is a self contradiction.

p ∧ (~p ∧ q)
T F F F T
T F F F F
F F T T T
F F T F F
3 1 2
CONTINGENCY It is a proposition/statement
that is neither true or false.

Example. Show that ¬ � ∧ � ∨ ¬ � is a contingency.

~ (p ∧ q) v ~q
F T T T F F
T T F F T T
T F F T T F
T F F F T T
2 1 4 3
VERIFY TAUTOLOGIES, CONTRADICTION, &
CONTINGENCY

Practice. Determine which statement is a tautology,

contradiction, or contingency.

1. [� ∧ � → � → ¬�
2. � ∧ � → ¬ � ∨ �
3. ¬� ∧ � ∧ ¬�
End of Discussion…