SED MATH
223
Chapter 1-
Mathematic
al Logic
Speaker name:
A. Logic
Statement
and
Quantifiers
Speaker name:
“Are you - question
okay?”
Part 01
“Bring me - command
Logic Statements your crush.”
Every languange “This is a -opinion
contains different nice car”
types of sentences,
such as, statements, “Manila is -statement
questions and the capital of of fact
commands. the
Phillipines.”
Part 01 Simple Declarative
Statement sentences
Is a declarative Has a simple structure,
sentences that are consisting of subject
either true or false, but and predicate.
not both true or false.
Has a simple structure,
Part 01 consisting of subject
and predicate.
Simple
Declarative Examples:
1. My cat is sick.
sentences 2. It is a great day.
3. Pizza is the best.
4. Paul is smart.
Part 01
Example 1 Identify
Statement
Determine whether each sentence is a
statement.
1. Manila is a province in -True
the Phillipines.
2. How are you? - It is not a statement.
3. 9^9 + 2 is a prime - It is a statement.
number. - It is a statement.
4. x+1=5
Types of statement
Connecting simple statement with words and phrases such as and, or,
if... then, and if and only if creates a compound statement.
-is a statement that conveys a Simple statement
simple idea
Compound -is a statement that conveys two
statement or more ideas.
Examples:
“I will attend the I will attend the
meeting or go to the meeting
school?” Simple sentence
-Compound sentence
I will go to
The word or is a
school
connective for the
two simple Simple sentence
statements
Logic Connective and
Symbols
Statement Connective Symbolic form Type of
Statement
not p not ~p Negation
p and q and p^q Conjunction
p or q or pvq Disconjunction
If p, then q If p, then q p q Conditional
p and if only if q If and only if p q Biconditional
Example 2 Write the negation of a
statement
a. Liezel Tan is a singer.
Ans. Liezel Tan is not a singer.
b. I like you.
Ans. I don’t like you.
Connective Symbolic
Example 3 Write form If...then p q
Compound Statements not ~p
in Symbolic Forms and p^q
if and only if p q
Consider the following or pvq
simple statements.
Write the following compound statements in
symbolic forms.
p: Today is friday.
a. Today is friday and it is raining.
b. It is not raining and I’am going to a movie.
r: I’am going to a movie.
c. I’am going to the basketball game or I’am
going to a movie.
q: It is raining. d. If it is raining, then I’am not going to the
basketball game.
s: I’am not going to the
basketball game.
Compound sentence and Grouping symbols
If a compound statement is written in a symbolic form,
then the parentheses are used to indicate which simple
statements are grouped together. The used of
parentheses to indicate groupings for statements in
symbolic form.
Symbolic Forms The Parentheses indicate that:
p^(q v ~r) q and ~r are grouped together
(p ^q) v r p and q are grouped together
(p ^ ~q)--> (r v s) p and ~q are grouped together
Compound sentence and Grouping symbols
If a compound statement is written in English sentence,
then a commma is used to indicate in which simple
statements are grouped together. Statements on the
same side of a comma are grouped together.
English sentence The comma indicate that:
p, and q ornot r. q and ~r are grouped together because they are both
on the same side of the comma
p and q, or r. p and q are grouped together because they are both
on the same side of the comma
If p not q, then r or s. p and ~q are grouped together because they are both
on the left side of the comma.
r and s are grouped together because they are both
on the right side of the comma
p q p ∧q p q p ∨q
Example 5 Determine
T T T T T T
the truth value of a
statement T F F T F T
F T F F T T
Determine wether each F F F F F F
statement is true or false.
a. 7 ≥ 5
b. 5 is a whole number and 5 is even number
solution: T ∧
F
7≥5 means 7>5 or 7=5 This is a false statement because 5 is not an even
7>5 or 7=5 number
T ^ F
is a true statement
Quantifiers specify the
Part 02 quantity of instances
for which a predicate
Negation and is true.
Quantifiers
Negation is the logical
operation that
reverses the truth
value of a statement
Statement Negation
Example 1 Write the All X are Y Some X are not Y
Negation of a
No X are Y Some X are Y
Quantified Statement
Some X are not Y All X are Y
Write the negation of each of Some X are Y No X are Y
the following statements.
a. Some airports are open.
Solutions :
a. No airports are open.
b. All the movies are worth
the price of the admission.
b. Some movies are not worth the price of the
admission.
c. No odd numbers are
divisible by 2.
c. Some odd numbers are divisible by 2.
THANK YOU
REFERRENCES
• https://youtu.be/A1faV4t0Vrc?si=CnBegjDgiogWeKtw
