Mathematical Logic

Dorothy Hope Go-Guerrero

 Logic Statements
and Quantifiers

• According to Immanuel
Kant (1785) [2], logic is a
science of the necessary
laws of thought, without
which no employment of
the understanding and
the reason takes place.
 Statements

A statement is
a declarative
sentence that is either
true or false, but not
both true and false.
Batangas is a
province of
the
Philippines.
STATEME
NT
People with ages from
21 to 59 years old
cannot be infected by
COVID19 virus.
STATEME
NT
x+1=5
STATEME
NT
Open
the
door.
NOT
STATEME
NT
What is
your
mother’s
name?
NOT
STATEME
1.Jaime Mora was the
coach of Philippine Sepak
Takraw
team in 2015 SEA Games.

2.In 2028, the next

president of the STATEME
NT
Philippines is a woman.
 “This is
false
sentence.”
NOT
STATEME
NT
two kinds of
statements: simple
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.
A compound statement
is a statement that
conveys two or more
ideas

•By 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.
 1. I will play Mobile
Simple Legend.
and
2. I will go to school.
compoun
3. I will play Mobile
d Legend or I will go to
school.
statement 4. I will play Mobile
Legend and I will go to
s school.
NOTATIONS
•Statements are usually represented by a
lower-case letter such as p, q, r, ands. 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 ”
negation
•In Mathematics, the negation of a
statement is the opposite of the given
mathematical statement. If “p” is a
statement, then the negation of statement
p is represented by ~p. The symbols used
to represent the negation of a statement.
negation
•In Mathematics, the negation of a
statement is the opposite of the given
mathematical statement. If “P” is a
statement, then the negation of statement
P is represented by ~P. The symbols used
to represent the negation of a statement.
negation
•For example, the given sentence is
“Arjun’s dog has a black tail”. Then, the
negation of the given statement is
“Arjun’s dog does not have a black tail”.
Thus, if the given statement is true, then
the negation of the given statement is
false.
 Basic Propositional Logic With Their Symbol.
 Consider the
following
statement a) today is Sunday and harry is not happy 𝑠∧ℎ

b) today is Sunday and harry is not going to watch a

volleyball game. 𝑠 ∧ ~𝑣
•h: harry is not happy.
c) if it’s going to rain, then harry is not going to watch a
v: harry is going to volleyball game. 𝑟 → ~𝑣

watch a volleyball game d) harry is going to watch a volleyball game if and only if
he is happy. 𝑣 ↔ ~ℎ
r: is it going to rain
e) harry is happy only if it is not going to rain. ~ℎ → ~𝑟
s: today is Sunday
f) harry going to watch a volleyball game or it is going to
rain 𝑣 ∨ r
 symbolic statements
into words given the
following
propositions. a) ~𝑝 Gian does not play volleyball.
Gian plays volleyball and Lanz plays
b) 𝑝 ∧ 𝑞. basketball.
p: Gian plays c) 𝑝 → ~𝑞 if Gian plays volleyball, then Lanz does not play
basketball.

volleyball d) 𝑝 ∨ (~𝑝 → 𝑞)
Gian plays volleyball, or if Gian does

q: Lanz plays
not play volleyball, then Lanz plays
basketball.

basketball
 Consider the
following
statement a) Write (𝑝 ∧ 𝑞) → ~𝑟 into words
if Adele is a singer and Adele is a songwriter,
then Adele is not an actress.
•p: Adele is a singer.
b) Write “if Adele is an actress,
•q: Adele is a then Adele is not a singer and
songwriter. Adele is not a songwriter” in
•r: Adele is an actress symbolic form.
𝑟 → (~𝑝 ∧
. ~𝑞)
DERIVED FORMS OF
A CONDITIONAL
STATEMENT
 There are three ways to restate a
conditional statement the converse, the
inverse,
and the contrapositive
 𝑝→𝑞
Converse form: 𝑞
→𝑝
INVERSE
FORM: ~𝑝 → ~𝑞
CONTRAPOSITIVE
: ~𝑞 → ~ 𝑝
 example
•Write the converse, inverse, and contrapositive of the
given sentence “she is allowed to join the volleyball
team, only if she knows how to receive the ball”

𝑝 → 𝑞: if she allowed to join the volleyball team, then

she knows how to receive the ball.
CONVERSE: if she knows how to receive the ball,
then she is allowed to join the volleyball team
INVERSE: if she is not allowed to join the volleyball
team, then she does not know how to receive the ball.

CONTRAPOSITIVE: if she does not know how to receive the

ball, then she is not allowed to join the volleyball team.
 Example 2
•Write the converse, inverse, and contrapositive of the
given sentence. “Every rectangle is a parallelogram”

𝑝 → 𝑞: If it is a rectangle, then it is a parallelogram.

CONVERSE: if it is a parallelogram, the it is a

rectangle
INVERSE: If it is not a rectangle, then it is not a
parallelogram
CONTRAPOSITIVE: If is not a parallelogram, the it is
not a rectangle
Truth Value and
Truth Table of a
Statement
 Mathematicians normally use a two-valued logic: Every
statement is either True or False. This is called the Law of the
Excluded Middle.

The truth value of a true

statement is true (T)
Truth value of a false statement
is false (F)
Definition 5.5 (Truth value
and Truth table).
Truth value. 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.

.
Truth table.
A truth table is a
table that shows the
truth value of a
compound statement
for all possible truth
values of its simple
statements.
Here's the
table for
negation:
p ~p
T F
F T
Truth value for
conjunction:
p q p^q
T T T
T F F
F T F
F F F
Truth value for
disjunction:
p q pvq
T T T
T F T
F T T
F F F
Truth value for
conditional:
p q p q
T T T
T F F
F T T
F F T
Truth value for
biconditional:
p q p q
T T T
T F F
F T F
F F T
 COMPOUND
STATEMENTS AND
THEIR TRUTH
TABLES
 Construction
of Truth Tables
In computing the truth values of
compound statements, the rule is like
those used to evaluate algebraic
expressions. First, evaluate the
expressions within the inner most
parentheses, then evaluate the
expressions within the next inner most
set of parentheses, and so forth until you
have the truth values for the complete
expression.
 Example 1. Construct the
truth table for the statement

~p ^ (P Q)
p q ~p (p ~p ^ (p
q) q)
T T
T F
F T
F F
 Example 1. Construct the
truth table for the statement

~p ^ (P Q)
p q ~p p q) ~p ^ (p q)
T T F
T F F
F T T
F F T
 Example 1. Construct the
truth table for the statement

~p ^ (p q)
p q ~p (p ~p ^ (p
q) q)
T T F T
T F F F
F T T T
F F T T
 Example 1. Construct the
truth table for the statement

~p ^ (P Q)
p q ~p (p ~p ^ (p
q) q)
T T F T F
T F F F F
F T T T T
F F T T T
 Example 2. Construct the
truth table for the statement
(p ∨ q) ∧ (∼ q ∧ p)
p q
T T
T F
F T
F F
 Example 2. Construct the
truth table for the statement
(p ∨ q) ∧ (∼ q ∧ p)
p q ~
q
T T F
T F T
F T F
F F T
 Example 2. Construct the
truth table for the statement
(p ∨ q) ∧ (∼ q ∧ p)
p q ~ pv
q q
T T F T
T F T T
F T F T
F F T F
 Example 2. Construct the
truth table for the statement
(p ∨ q) ∧ (∼ q ∧ p)
p q ~ p v ~q
q q ^p
T T F T F
T F T T T
F T F T F
F F T F F
 Example 2. Construct the
truth table for the statement
(p ∨ q) ∧ (∼ q ∧ p)
p q ~ p v ~q (p ∨ q)
q q ^ p ∧ (∼ q
∧ p)
T T F T F F
T F T T T T
F T F T F F
F F T F F F
Assignment:. Construct the
truth table for the statement
~p v (~q p)
p q ~ ~ ~q- ~p v (~q
p q >p ->p
T T
T F
F T
F F
Thank you!