Logic

JULIUS CORPUZ PAGDILAO, LPT

 Statements

•A statement is a declarative sentence

that is either true or false, but not both
true and false. A simple statement is a
statement that does not contain a
connective.
 Statements
•Determine whether each sentence is a
statement.
• a. Florida is a state in the United States.
• b. How are you?
• c. 99 + 2 is a prime number.
• d. 𝑥 + 1 = 5.
 Statements
•Determine whether each sentence is a
statement.
• e. Open the door.
• f. 7055 is a large number.
• g. x > 3.
 Compound Statements

•A compound statement is formed by

connecting simple statements with the
connectives and, or, if . . . then, and if and
only if.
 Compound Statements
Type of
Statement Connective Symbolic Form
Statement
not p not ∼𝑝 Negation

p and q and 𝑝∧𝑞 Conjunction

p or q or 𝑝∨𝑞 Disjunction

If p, then q If… then 𝑝⟶𝑞 Conditional

p if and only if q if and only if 𝑝⟷𝑞 Biconditional

 Negation

•The negation of a statement is the

opposite or the contradictory of the
statement and is denoted by the curl (∼).
 Negation

•Write the negation of each statement.

• a. Bill Gates has a yacht.
• b. Avatar was not selected as best picture
at the 82nd Academy Awards ceremony.
 Negation

•Write the negation of each statement.

• c. The Queen Mary 2 is the world’s largest
cruise ship.
• d. The fi re engine is not red.
 Conjunction
•Conjunction is a compound statement
whose simple statements are joined by
the conjunction “and”, “however”, “yet”,
“but”, “also”, “although”, “nevertheless”
and “still” which is represented by the
wedge (∧).
 Disjunction

•Disjunction is a compound statement

whose simple statements are joined by
the word “or” and “unless” which is
represented by the vel (∨).
 Conditional
• Statements that are connected by “if…then”, “implies
that”, “entails that”, and similar phrases are called
conditional statement denoted by rightwards arrow
(⟶). By convention the first part of the conditional is
termed the antecedent (also less often called the
"implicans" or the "protasis"), and the second part of
the conditional is the consequent (less often termed
the "implicate" or "apodosis"). This, however, is not
always the case.
 Biconditional
• Statements that are connected by “if and only
if”, “is equivalent to”, and “is a sufficient and
necessary condition for” is called biconditional
statement denoted by left right arrow (⟷). In
logic, two statements have truth functional
equivalence when they have the same truth-
value, not because they have the same content
or meaning.
 Compound Statement
Write Compound Statements in Symbolic Form
• Consider the following simple statements.
p: Today is Friday.
q: It is raining.
r: I am going to a movie.
s: I am not going to the basketball game.
 Compound Statement
Write 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.
 Compound Statement
Write Compound Statements in Symbolic Form
• e. Today is not Friday and I am going to a movie.
• f. I am going to the basketball game and I am not
going to a movie.
• g. I am going to the movie if and only if it is raining.
• h. If today is Friday, then I am not going to a movie.
 Activity
State whether the sentence is a conjunction,
a disjunction, a negation, a conditional, or a
biconditional and write each sentence in
symbolic form. Represent each simple
statement of the sentence with the letter
indicated in parentheses.
 Activity
1. It is hard to fail (f), but it is worse never
to have tried to succeed (s).
2. If a polygon has four edges (p), it is a
quadrilateral (q).
3. Either the Warriors (w) or Cavaliers (c)
will win the championship.
 Compound Statements and Grouping Symbols
•If a compound statement is written in
symbolic form, then parentheses are used to
indicate which simple statements are
grouped together.
 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.
 Compound Statements and Grouping Symbols

•If a statement in symbolic form is written

as an English sentence, then the simple
statements that appear together in
parentheses in the symbolic form will all
be on the same side of the comma that
appears in the English sentence.
 Compound Statements and Grouping Symbols

Example
•Let p, q, and r represent the following.
p: You get a promotion.
q: You complete the training.
r: You will receive a bonus.
 Compound Statements and Grouping Symbols

Example
•a. Write (𝒑 ∧ 𝒒) ⟶ r 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
•Let p, q, and r represent the following.
p: Kesha’s singing style is similar to Uffie’s.
q: Kesha has messy hair.
r: Kesha is a rapper.
 Compound Statements and Grouping Symbols

Example
•a. Write (𝒑 ∧ 𝒒) ⟶ r as an English sentence.
• b. Write “If Kesha is not a rapper, then Kesha
does not have messy hair and Kesha’s
singing style is not similar to Uffie’s.” in
symbolic form.
 Truth Value and Truth Tables
•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. A truth table is a table that
shows the truth value of a compound
statement for all possible truth values of its
simple statements.
 Truth Value and Truth Tables
•Negation
The Truth Table of the Negation of p
P ∼𝒑
T F
F T
 Truth Value and Truth Tables
•Conjunction
The Truth Table for 𝒑 ∧ 𝒒
P q 𝒑∧𝒒
T T T
T F F
F T F
F F F
 Truth Value and Truth Tables
•Disjunction
The Truth Table for 𝒑 ∨ 𝒒
P q 𝒑∨𝒒
T T T
T F T
F T T
F F F
 Truth Value and Truth Tables
•Conditional
The Truth Table for 𝒑 ⟶ 𝒒
P Q 𝒑⟶𝒒
T T T
T F F
F T T
F F T
 Truth Value and Truth Tables
•Biconditional
The Truth Table of 𝒑 ⟷ 𝒒
P Q 𝒑⟷𝒒
T T T
T F F
F T F
F F T
 Truth Value and Truth Tables
Example
• Determine whether each statement is true or false.
a. 7 ≥ 5.
b. 5 is a whole number and 5 is an even number.
c. 2 is a prime number and 2 is an even number.
d. 21 is a rational number and 21 is a natural number.
e. 4 ≤ 9.
 Quantifiers and Negation
•In a statement, the word some and the
phrases there exists and at least one are
called existential quantifiers.
• Existential quantifiers are used as prefixes to
assert the existence of something.
•While the words none, no, all, and every are
called universal quantifiers.
 Quantifiers and Negation
•The universal quantifiers none and no
deny the existence of something,
whereas the universal quantifiers all and
every are used to assert that every
element of a given set satisfies some
condition.
Quantifiers and Negation

The Negation of a Quantified Statement

All X are Y negation Some X are not Y
No X are Y negation Some X are Y
 Quantifiers and Negation
Example
• Write the negation of each of the following
statements.
a. Some airports are open.
b. All movies are worth the price of admission.
c. No odd numbers are divisible by 2.
 Quantifiers and Negation
Example
• Write the negation of each of the following
statements.
d. All bears are brown.
e. No smartphones are expensive.
f. Some vegetables are not green.
 Logic
JULIUS CORPUZ PAGDILAO, LPT