Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

6.1 MMW

Download as pdf or txt
Download as pdf or txt
You are on page 1of 27

Logic Statements and

Quantifiers
Mathematics in the Modern World
GEd 102 | Module 6.1

Week 14 | Ms. Cristine Untalan LPT, MA.Ed


Learning Objectives:
At the end of this lesson, the student should be
able to:
1. Define statements, translate simple
and compound statements into symbols
2. Determine the truth value of a
statement
Statement

It is a declarative sentence that is


either true or false, but not both
true and false.
STATEMENT OR NOT

1. Three is an odd number. Statement


2. Square is a rectangle. Statement
3. 𝒙 – 𝟏𝟔 = 𝟎 Statement

4. Longest side of the triangle. Not a statement

5. 𝒙𝟐 − 𝟒 Not a statement
Statements
1. In 2025, BTS will have a concert in the
Philippines.
2. In 2028, the next president of the
Philippines is a woman.
3. Jaime Mora was the coach of Philippine
Sepak Takraw team in 2015 SEA Games.
There are some sentences that are both true and false
at the same time. This kind of sentence is not considered a
statement, based on the definition of a statement.

“This is false sentence."


The above sentence is not a statement because if we
assume it to be a true sentence, then it is false, and if we
assume it to be a false sentence, then it is true. Statements
cannot be true and false at the same time.
TWO KINDS OF
STATEMENT

A simple statement is a statement that


conveys a single idea. A compound
statement is a statement that conveys two or
more ideas.
CONNECTIVES

or if … then
and if and only if

By connecting simple statements with these words


and phrases creates a compound statement. These
words and phrases are called connectives.
SYMBOL MEANING
∧ and
∨ or
→ if … then
⟷ If and only if
~ not
Symbolic Type of
Statement Connective
form Statement
𝒑 𝒂𝒏𝒅 𝒒 and 𝒑∧𝒒 Conjunction
𝒑 𝒐𝒓 𝒒 or 𝒑∨𝒒 Disjunction
𝑰𝒇 𝒑, 𝒕𝒉𝒆𝒏 𝒒 if … then 𝒑→𝒒 Conditional
𝒑 𝒊𝒇 𝒂𝒏𝒅 𝒐𝒏𝒍𝒚 𝒊𝒇𝒒 If and only if 𝒑 ⟷ 𝒒 Bi - conditional
𝒏𝒐𝒕 𝒑 not ~𝒑 Negation
CONNECTIVES 𝒑 : I will play table tennis
𝒒 : I will go to school
𝒓 : I will not do my assignment

1. I will play table tennis or I will go 𝒑∨𝒒


to school.
2. I will go to school and I will not 𝒒 ∧∼ 𝒑
play table tennis.
3. If I will do my assignment then I ∼ 𝒓 →∼ 𝒑
will not play table tennis.
COMPOUND STATEMENTS
AND GROUPING SYMBOLS

Compound statements may contain more than two


simple statements. To avoid confusion with the
meaning of the statements, groupings of statements
are necessary.
RULES OF GROUPING OF A
COMPOUND STATEMENT

1. In symbolic form, the parentheses are used to indicate


the simple statements that are being grouped together.

2. In sentence form, a comma is used to indicate which


simple statements are group together. That is, statements
on same side of the comma are group together.
EXAMPLES

“It is not true that,


∼ 𝒑∧𝒒
𝒑 ∧ 𝒒”

∼𝒑∧𝒒 “Not p and q"


𝒑 : John’s playing style is the same as Lebron’s.
EXAMPLE 𝒒 : Hazel has straight hair.
𝒓 : John is a basketball player.

Write the symbolic form as an English sentence


(𝒑 ∧ 𝒒) → 𝒓
If John’s playing style is the same as Lebron’s
and Hazel has straight hair, then John is a
basketball player.
𝒑 : John’s playing style is the same as Lebron’s.
EXAMPLE 𝒒 : Hazel has straight hair.
𝒓 : John is a basketball player.

Write the symbolic form as an English sentence


(𝒒 ∨ 𝒓) →∼ 𝒑
If Hazel has straight hair or John is a basketball
player, then John’s playing style is not the same as
Lebron’s.
𝒑 : John’s playing style is the same as Lebron’s.
EXAMPLE 𝒒 : Hazel has straight hair.
𝒓 : John is a basketball player.

Write in symbolic form the given statement below.


If John is not a basketball player or Hazel has a
straight hair, then John’s playing style is not the same
as Lebron’s.

(∼ 𝒓 ∨ 𝒒) →∼ 𝒑
QUANTIFIERS AND
THEIR NEGATION

In English sentences, some are true for


all, or it is true for some conditions. In
order that these kinds of sentences are to
be statements, quantifiers are needed.
EXISTENTIAL QUANTIFIERS

These are used as prefixes to assert the


existence of something. These include the
word some, and the phrases there exists and
at least one.
UNIVERSAL QUANTIFIERS

These are used as prefixes to assert that every


element of a given set satisfies some conditions or
to deny the existence of something. These include
the words all, every, none, and no.
EXAMPLES

1. Some coffee shops are open.


2. There exists an integer n such that 𝟑𝒏 ≥ 𝟏𝟐𝟎.

3. All players are nice people.


4. No even integers are divisible by 𝟑.
Negation of statements
involving quantifiers

In the previous discussion, it is known that the


negation of a statement is false if the statement is
true, and it is true if the statement is false. This
concept must be considered in constructing the
negation of a statement involving quantifiers.
EXAMPLE

Some coffee shops are open.


Negation Statement:
No coffee shops are open.
Quantified statements and their
negations

QUANTIFIED
NEGATION
STATEMENTS
All 𝑿 are 𝒀 Some 𝑿 are not 𝒀
No 𝑿 are 𝒀 Some 𝑿 are 𝒀
Some 𝑿 are 𝒀 No 𝑿 are 𝒀
Some 𝑿 are not 𝒀 All 𝑿 are 𝒀
EXAMPLE

All classic movies were first


produced in black and white.
Negation Statement:
Some classic movies were not
produced in black and white.
EXAMPLE

No even numbers are odd numbers.


Negation Statement:
Some even numbers are odd
numbers.
Thank you!
Feel free to ask me your questions.
cristine.untalan@g.batstate-u.edu.ph

You might also like