LOGIC STATEMENTS

AND
QUANTIFIERS
 Logic Statements and Quantifiers
LOGIC
Logic

- as the science that evaluates arguments

- the study of the methods used to distinguish correct reasoning
from poor reasoning
 Logic Statements
Every language contains different types of sentences, such as:
“Is the test today?” is a question.

“Go get the newspaper.” is a command.

“This is a nice car!” is an opinion.

“Denver is the capital of Colorado.” is a statement of fact.

 A Statement
A statement is a declarative sentence that is either true or
false, but not both true and false.
In other references, the term statement is also called proposition.
Consider the following sentence.

American Shaun White won an Olympic gold medal

in speed skating.
 A Statement
Example: Identify Statements
Determine whether the following sentences are statements or not a statement.
1. Cebu is a province of the Philippines.
- This is a statement.
4. What is your mother’s name?
2. x + 1 = 5.
- This is not a statement.
- This is a statement.
5. Please stop shouting.
3. Open the door.
- This is not a statement. - This is not a statement.
 Simple Statements and
Compound Statements
A simple statement is a statement that conveys a single
idea.
A compound statement is a statement that conveys two or
more ideas.
Connecting simple statements with words and phrases such as
and, or, if . . . then, and if and only if creates a compound
statement. These words and phrases are called connectives.
 Simple Statements and
Compound Statements
Example:
Simple 1. I will play Mobile Legend.

Simple 2. I will go to school.

Compound 3. I will play Mobile Legend or I will go to school.

Compound 4. I will play Mobile Legend and I will go to
school.
 NOTATIONS
Statements are usually represented by a lowercase letter such as p, q, r,
and s. The symbols for connectives are as follows:

∧ - symbol for the connective “and”

∨ - symbol for the connective “or”
→ - symbol for the connective “if . . . then”
↔ - symbol for the connective “if and only if”
 NOTATIONS
Another important notion here is the negation of a statement. The
definition of the negation and its notation is given below.
Let be p a statement. The negation of p, denoted by ∼ p, (read as
“not p ”) is a statement that is false if p is true and it is true if p is false.
Statement Negation of the Statement

1. Rachel is a Blue Badge umpire in table tennis. 1. Rachel is not a Blue Badge umpire in table tennis.

2. The color of the roof is not green. 2. The color of the roof is green.

It is worth noting that the negation of the negation of the statement is the
original statement. That is, if p is a statement, then ∼ (∼ p) = p.
 NOTATIONS
The next example tells us how to write compound statements into symbolic forms.
p : I will play table tennis;
q : I will go to school;
r : I will not do my assignment
Example 1: Consider the symbols corresponding to the statements below.
Translate the following compound statements in symbolic form.
1. I will play table tennis or I will go to school. - p ∨ q
2. I will go to school and I will not play table tennis. - q∧ ∼ p
3. If I will go to school then I will do my assignment. - q →∼ r
4. I will play table tennis if and only if I will not go to school.- p ↔ ∼q
 NOTATIONS
Example 2: In the next example, we translate symbolic statements into English
sentences.
Consider the following statements.
p : The game will be played in Atlanta.
q : The game will be shown on CBS.
r : The game will not be shown on ESPN.
s : The Dodgers are favored to win.
Write each of the following symbolic statements in words.
a. q ∧ p - The game will be shown on CBS and the game will be played in Atlanta.
b. ∼ r ∧ s - The game will be shown on ESPN and the Dodgers are favored to win.
c. s ↔ ∼ p - The Dodgers are favored to win if and only if the game will not be played in
Atlanta.
 Type of Statements
A compound statement can be classified according to the connectives used.

1. A statement is called disjunction if the connective “or” is used.

2. A statement is called a conjunction if the connective “and” is
used.
3. A statement is called conditional if the connective “if . . . then” is
used.
4. A statement is called biconditional if the connective “if and only
if” is used.
 Type of Statements
Type of
Statement Connective Symbolic Form
Statement
p and q and p∧q Conjunction
p or q or p∨q Disjunction
if p then q If … then p→q Conditional
p if and only if q If and only if p↔q Biconditional
not p not ∼p Negation