5.
LOGIC
ARIEL F. MELAD
LOGIC
• Logic statements and Quantifiers
• Truth tables, equivalent statements, and tautologies
• The conditional and the biconditional
• Symbolic arguments
• Arguments and Euler Diagrams
LOGIC
HISTORY
Gottfried Wilhelm Leibniz (1646-1716). The first
mathematician to make a serious study of symbolic
logic. Leibniz tried to advance the study of logic
from a philosophical subject to a formal
mathematical subject.
LOGIC
Augustus De Morgan (1806-1871) and George
Boole (1815-1864) contributed to the advancement
of symbolic logic as a mathematical discipline.
Boole published The Mathematical Analysis of
Logic in 1848 and An Investigation of the Laws of
Thought in 1854.
LOGIC
Logic Statements
Definition. A statement is a declarative
sentence that is either true or false, but not both
true and false.
LOGIC
Example 1. Identify Statements
1. Manila is the capital of Philippines.
2. How are you?
9
3. 9 + 2 is a prime number.
4. x+1 = 5.
LOGIC
Solution.
1. Manila is the capital of the Philippines, so this
statement is true and it is a statement.
2. The sentence, “how are you” is a question; it is
not a declarative sentence. Thus it is not
statement.
LOGIC
Solution.
3. You may not know whether 99 + 2 is a prime
number, however you know that is a whole number
larger than 1, so it is either a prime or not a prime
number. The sentence is ether true or false not both
true or false. Hence, it is a statement.
LOGIC
Solution.
4. x+1 = 5 is a statement called an open
statement. It is true for x = 4 but false for any
other number. For any given value of x, it is true
or false but not both.
LOGIC
Check your progress.
1. Open the door.
2. 9055 is a large number.
3. In the year 2022, the president of the country will be
a woman.
4. p>5.
LOGIC
Simple and Compound Statements
Definition. A simple statement is a statement
that conveys a single idea. A compound
statement is a statement that conveys two or
more ideas.
LOGIC
Simple and Compound Statements
Note: Connecting statements with words and
phrases such as and, or, if…then and if and only
if creates a compound statement.
LOGIC
Simple and Compound Statements
Example 2.
1. Ariela is beautiful. (simple)
2. Ariela is beautiful and sexy. (compound)
LOGIC
Logic Connectives and Symbols
Statement Connective Symbolic Type of
form Statement
not p not ~𝑝 negation
p and q and 𝑝∧𝑞 conjunction
p or q or 𝑝∨𝑞 disjunction
if p, then q if…then 𝑝→𝑞 conditional
if p and only if q if and only if 𝑝↔𝑞 biconditional
LOGIC
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 value of the statements and its
connectives.
LOGIC
Truth Value and Truth Tables
A truth table is a table the shows the truth value
of a compound statement for all possible truth
values of its simple statements.
LOGIC
Illustration. The negation of the statement,
“Today is Tuesday.” is the statement “Today is
not Tuesday.” If the statement is false, then its
𝒑 ∼𝑝
negation is true.
T F
F T
Truth Table for ∼ 𝑝
LOGIC
Example 3. Write the negation of a statement.
1. Sharon Cuneta is an actress.
2. Tomorrow is a not a rainy day.
3. I eat banana.
LOGIC
Solution.
1. Sharon Cuneta is not an actress.
2. Tomorrow is a rainy day?
3. I don’t eat banana.
LOGIC
Example 4. Consider the ff 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.
LOGIC
Write the ff 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 a basketball game or I am going to
a movie.
LOGIC
Write the ff compound statements in symbolic
form.
d. If it is raining, then I am not going to the
basketball game.
LOGIC
Solution.
a. 𝑝∧𝑞
b. ∼𝑞∧𝑟
c. ∼𝑠∨𝑟
d. 𝑞→𝑠
LOGIC
Example 5. Translate compound statements
Let p,q, and r represents the ff:
p: You get a promotion
q: You complete the training.
r: You will receive a bonus.
LOGIC
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.
LOGIC
Solution:
a. If you get a promotion and you complete the
training, then you will receive a bonus.
b. ∼ 𝑞 → ∼ 𝑝 ∧∼ 𝑟 .
LOGIC
Truth table for 𝑝 ∧ 𝑞
𝒑 𝒒 𝒑∧𝒒 The Truth Value of
T T T Conjunction.
T F F The conjunction 𝑝 ∧ 𝑞
F T F is true iff both 𝑝 and
F F F 𝑞 are true .
LOGIC
Truth table for 𝑝 ∨ 𝑞
𝒑 𝒒 𝒑∨𝒒 The Truth Value of
T T T Disjunction.
T F T The disjunction 𝑝 ∨ 𝑞 is
F T T true iff p is true, q is true,
F F F or both 𝑝 and 𝑞 are true .
LOGIC
Example 6. Determine the truth value of the a
statement.
a. 7 ≥ 5.
b. 5 is a whole number and an even number.
c. 2 is a prime number and an even number.
LOGIC
Solution.
a. True
b. False
c. True
LOGIC
Check your progress.
1. 21 is a rational and natural number.
2. 4 ≤ 7.
3. −7 ≥ −3.
LOGIC
Truth tables, Equivalent Statements and
Tautologies
Truth Tables
Example 1. Construct a table for ∼ ∼ 𝑝 ∨ 𝑞 ∨ 𝑞
LOGIC
Truth Tables
Solution. Start with standard truth table form
𝒑 𝒒 ∼𝒑 ∼𝒑∨𝒒 ∼ (∼ 𝒑 ∨ 𝒒) ∼ (∼ 𝒑 ∨ 𝒒) ∨ 𝒒
T T F T F T
T F F F T T
F T T T F T
F F T T F F
LOGIC
Check your Progress
a. Construct a truth table for 𝑝 ∧∼ 𝑞 ∨ ∼ 𝑝 ∨ 𝑞 .
b. Use the truth table to determine the truth value of
𝑝 ∧∼ 𝑞 ∨ ∼ 𝑝 ∨ 𝑞 , given that p is true and q is
false.
LOGIC
Check your Progress
c. Construct a truth table for 𝑝 ∧ 𝑞 ∧ ∼ 𝑟 ∨ 𝑞 .
LOGIC
Defintion. A tautology is a statement that is always
true. A self-contradiction is a statement that is
always false.
Example. Show that 𝑝 ∨ ∼ 𝑝 ∨ 𝑞 is tautology.
