Is a declarative sentence that can be objectively

determined to be either true or false, or both.

Which of the following are statement?
1. Most scientist agree that global warming is a
threat to the environment.
2. Is that your laptop?
3. Man, that hurts!
Which of the following are statement?
4. 432 + 8 ÷ 1.3 = 𝟏𝟏𝟓, 𝟎𝟎𝟎
5. This book is about database management.
6. Watching reality shows turns your brain to
mush
Which of the following are statement?
1. Most scientist agree that global warming is a
threat to the environment.

Statement

Because they can be judged as true or

false.
Which of the following are statement?
2. Is that your laptop?

Not a Statement

Because it is a question
Which of the following are statement?
3. Man, that hurts!

Not a Statement

Because it is an exclamation
Which of the following are statement?
4. 432 + 8 ÷ 1.3 = 𝟏𝟏𝟓, 𝟎𝟎𝟎

Statement

Because they can be judged as true or

false.
Which of the following are statement?
5. This book is about database management.

Statement

Because they can be judged as true or

false.
Which of the following are statement?
6. Watching reality shows turns your brain to
mush

Not a Statement

Because it requires an opinion

Which of the following are statement?

1. Those pants rock!

2. 12 – 8 = 5
3. Give me a bottle of anything!
4. Can cat send picture messages?
5. Cat can send picture messages.
6. History is interesting.
Contains only one idea.

1. Your jeans are torn.

2. My dorm room has a pile of dirty socks in it.

3. Daytona beach is in Florida.

Formed by joining two or more simple statements
with connective.

And (conjunction or disjunction)

If…... Then (conditional)

If…and only if (biconditional)

1. John studied for 5 hours, and he got an A.
(conjunction)
2. I’m going to pass this class or I’’m going to
change my major. (disconjunction)
3. If I get 80% of the questions on the LSAT right,
then I will get into law school (conditional)

4. We will win the game if and only if we can score

more points than the other team. (biconditional)
Classify each statement as simple or compound. If it is a
compound, state the name of the connective used.

1. Our mascot is a moose.

Simple statement
Classify each statement as simple or compound. If it is a
compound, state the name of the connective used.

2. If you will register to wifi service, you will get

three days of free access.

Compound statement

Conditional
Classify each statement as simple or compound. If it is a
compound, state the name of the connective used.

3. Tomorrow is the last day to register for

classes.
Simple statement
Classify each statement as simple or compound. If it is a
compound, state the name of the connective used.

4. In the interest of saving the planet, I plan to

buy either a hybrid or a motorcycle.

Compound statement

Disjunction
Classify each statement as simple or compound. If it is a
compound, state the name of the connective used.

5. My jacket is both warm and light.

Compound statement

Conjunction
Classify each statement as simple or compound. If it is a
compound, state the name of the connective used.

6. If it doesn’t rain tomorrow, I am going to

windsurfing.

Compound statement

Disjunction
Classify each statement as simple or compound. If it is a
compound, state the name of the connective used.

7. I’am going to eat Taco bell or Wendy’s today

Compound statement

Disjunction
Classify each statement as simple or compound. If it is a
compound, state the name of the connective used.

8. Yesterday was the deadline to withdraw

from the class.

Simple statement
The discipline that considers the methods of
reasoning.

It provides the rules and techniques for

determining whether an argument is valid or
not.
Ex:
1. To prove to your parents that you passed;
2. To prove that you paid your bill
In mathematics and
computer science,
mathematical logic or logic
is used to prove results.
To be specific;
In mathematics, logic or logical reasoning is
used to prove theorems

In computer science, logic or logical reasoning

is used to prove the correctness of programs
and also to prove theorems.
Theorem is a statement that can be shown to
be true (under certain conditions).

Ex;

If x is an even integer, then x + 1 is an odd

Proof of theorem is an argument consisting of a
sequence of statements aimed at
demonstrating the truth of the assertion.

It is not easy to give a complete and rigorous

definition of a statement.
Statement or proposition is a declarative
sentence that is either true or false, but not
both.

Ex 1:
i. 4 is an integer
ii. 𝟓 𝒊𝒔 𝒂𝒏 𝒊𝒏𝒕𝒆𝒈𝒆𝒓
iii. Manila is the capital of the Philippines
Ex 1:
i. 4 is an integer true

ii. 𝟓 𝒊𝒔 𝒂𝒏 𝒊𝒏𝒕𝒆𝒈𝒆𝒓 true

iii. Manila is the capital of the Philippines

true
Ex 2:
p: 5 is less than 3
q: 7 is an integer
r: every even integer greater than 4 is a sum
of two odd primes
Ex 2:
r: every even integer greater than 4 is a sum
of two odd primes

R is a statement because it is either true or

false but not both.

Goldbach’s Conjecture
Ex 3:
p: Will you go?

q: Enjoy the lovely weather!

STATEMENT
Truth value is one of the values “”truth or
falsity that is assigned to a statement.

If a statement is true, say that the (logical)

truth value of p is true and write p is T.
Exercise 1: Which of the following are statements?
(a)2 is an even integer.
(b)On January 6, 1986, the temperature of Omaha
dropped below freezing.
(c)Why should we study mathematics?
(d)There is an integer x such that 𝑥 2 =3.
(e)7+3=11
(f)New Delhi is the Capital of India.
(g)Please be quiet.
(h)Dogs can fly.
(i) There will be snow on December.
Solution:

(a) This is a declarative sentence and it is also true. Hence it is a

statement.
(b) This is a declarative sentence and it is either true or false but not
both. Hence, it is a statement.
(c) This is not a declarative sentence. Hence, it is not a statement.
(d) (d) This is a declarative sentence and because there is no integer x
such that 𝑥 2 =3, we fine that the given sentence is false. Hence,
the given sentence is a statement.
(e) 7+3=11 is a declarative sentence, which is also false. Hence, it is a
statement.
(f) This is a declarative sentence, which is also true. Hence it is a
statement.
(g) This is not a declarative sentence , hence, it is not a statement.
(h) This is a declarative sentence, which is also false. Hence, it is a
statement.
(i) This is a declarative sentence and it is either true or false but not
both. Hence, it is a statement.
 Quantified Statements
Involve terms such as all, each, every, no, none,
there exists, and at least one.

Universal quantifiers – (all, each, every, no

none) – they either include or exclude every
element in the universal set.

Existential quantifiers claim the existence of

something, but don’t include the entire
universal set.
 Truth Table
A diagram in table form that is used to show
when a compound statement is true or false
based on the truth values of the simple
statements that make up that compound
statements.

Will allow to analyze arguments objectively.

 Negation
A corresponding statement with the opposite truth
value.

p: 2 is positive
q: It is not the case that 2 is positive

We see that statement p is true and statement q is

false.
Statement q is obtained by negating the statement
p, and the truth values of p and q are opposite.
Statement q is the negation statement p.
 Negation
Let p be a statement . The negation of p written
~p (read as tilde p) is the statement obtained
by negating statement p.

It follows the truth values of p and ~ p are

opposite .

The Symbol ~ is called not we read ~p as “not

p.”
Example
p:2 is positive

Then

~p: is not the case that 2 is positive; or

~p: 2 is not positive.

By the definition of negation the truth value of
~p is opposite to the truth value of p.

Truth table.

p ~p
T F
F T
Exercise 2: Write the negation of each of the following
statements.
(a) 7 is an even integer.
(b) 5+8 > 3
(c)It is hot.

Solution:
(a)7 is not an even integer.
(b)5+8 not > 3. This can also be 5+8 ≤< 3.
(c)It is not hot.
 Conjunction
p : 2 is an even integer
q: 7 divides 14

r: 2 is an even integer and 7 divides 14

Because r is true, r is a statement.

r is a combination of statements p and q.

r can be expressed by joining p and q using the word “and.”

A statement such as r is called conjunction of p and q.

 Conjunction
The conjunction of p and q is written as p ^ q,
(caret / circumflex) is the statement formed by
joining statements p and q using the word
“and.”

The statement p ^ q is true if both p and q are

true; otherwise p ^ q is false.
 Conjunction
Truth table of p^q is given by:

p q p^q
T T T
T F F
F T F
F F F
 Disjunction
Given 2 statements p and q, we can
form the statement “p or q” by putting
the word “or” between the statements
such that the statement p or q is true if
at least one of the statements p or q is
true.
 Disjunction
Ex;

p : 2 is an integer
q: 3 is greater than 5

Then we can form statement.

r:2 is an integer or 3 is greater than 5

r the disjunction of p and r.

 Disjunction
The disjunction of p and q, written p v q, is the
statement formed by putting statements p and q
together using the word “or”.
Truth table
P q pvq
T T T
T F T
F T T
F F F
1.Determine if the given sentence is
declarative or not, if declarative write
true or false, statement or not a
statement.

a. 5 is an odd integer.
b. There is an integer x such that 𝒙𝟐 = 2
c. 5 + 6 =11.
d. Ø ⊆ {1}.
e. Every integer is a real number.
1.Determine if the given sentence is
declarative or not, if declarative write
true or false, statement or not a
statement.
f. Every set can be represented in computer memory.
g. Today is Sunday.
h. Why should we study computer science.
i. Boston is the capital of the United States.
j. Please do this work
k. There will be a rainy day in September.
QUIZ 2
2. Write the negation of each of the following
statements.

a. 13 is an even integer.
b. 5 + 8 < 18.
c. Allyssa is beautiful.
d. Rondil always follow the school rules and
regulations
e.Villoria will drop discrete math
Also known as Conditional statements.

- Consists of two simple statements

using the connective if…. Then.
1. If 49,301 is divisible by 6, then 49,301 is
divisible by 3.
2. If it is cold, then I will wear jacket.
3. If I wanted to pass, then I will study
Let p and q be two statements.

Then “if p, then q” is a statement called an

implication, or a condition, written p → q.

The statement p →q also to be read as

p implies q OR
p is sufficient for q
Let p and q be two statements.

The statement p →q also to be read as

p implies q
p is sufficient for q
q if p
q whenever p
 Implication
p→ q is considered false when p is true and q is
false otherwise it is true

p q p→q
T T T
T F F
F T T
F F T
In the implication p →q also to be read as
p - hypothesis
q - conclusion
Let p and q be statements;

i. The statement q → p is called the converse of the

implication p → q.

ii. The statement ~p → ~q is called the inverse of the

implication p → q.

iii. The statement ~q → ~p is called the contraceptive

of the implication p → q.
Consider the statement, “if today is Sunday, then I will go
for a walk”

p: Today is Sunday
q: I will go for a walk

i. The statement q → p is called the converse of the

implication p → q.

q → p: If I will go for a walk, then

today is Sunday.
Consider the statement, “if today is Sunday, then I will go for a
walk”

p: Today is Sunday
q: I will go for a walk

ii. The statement ~p → ~q is called the inverse of the

implication p → q.

~p → ~q: If today is not Sunday, then I will not go for a walk

Consider the statement, “if today is Sunday, then I
will go for a walk”

p: Today is Sunday
q: I will go for a walk

iii. The statement ~q → ~p is called the

contraceptive of the implication p → q.

~q → ~p: If I will not go for a walk, then today is

not Sunday.
 𝒑↔𝒒

Also called biconditional of statements p and q.

Can be read as “ q if and only if p.”

If p and q have the same truth values and false

then
𝒑↔𝒒
Is True
 𝒑↔𝒒
p q 𝒑↔𝒒

T T T
T F F
F T F
F F T
 ~p negation

p^q conjunction

pvq disjunction

p →q implication
𝒑↔𝒒 biimplication
~p

p ~p
T F
F T
p^q
p q p^q
T T T
T F F
F T F
F F F
pvq
P q pvq
T T T
T F T
F T T
F F F
p →q

p q p→q
T T T
T F F
F T T
F F T
𝒑↔𝒒
p q 𝒑↔𝒒

T T T
T F F
F T F
F F T
p: Triangle ABC is isosceles.
q: Triangle is equiangular
r: Triangle ABC is equilateral
p: Pythagorean Theorem is used to solve right
triangle.
q: Triangle with sides 3, 4 and 5 is an example of
right triangle.
r: Square of 4 is equal to the sum of squares of 3
and 5.
 Example
Let A be the statement of formula
A: (~(p v q))→(q^p).

To construct the truth table .

1. First set up columns labeled p, q, (p v q),~(p v q), (q ^ p ) and A.

2. Write the p, q columns all possible combinations of the truth values T and F.

3. Form the truth value table of v, ^ , write the truth value in the columns of
(p v q) and (q ^ p).

4. With the help of the truth table for ~, fill in the column of ~(p v q)

5. Finally using the truth table of →, fill in the column of A

 p q (pvq) (~(p v q)) (p ^ q) A

A: (~(p v q))→(q^p).

1. First set up columns labeled p, q, (p v q),~(p

v q), (q ^ p ) and A.
 p q (pvq) (~(p v q)) (p ^ q) A
T T
T F
F T
F F

A: (~(p v q))→(q^p).

2. Write the p, q columns all possible combinations of

the truth values T and F.
 p q (pvq) (~(p v q)) (p ^ q) A
T T T T
T F T F
F T T F
F F F F

A: (~(p v q))→(q^p).

3. Form the truth value table of v, ^ , write the

truth value in the columns of (p v q) and
(q^p).
 p q (pvq) (~(p v (p ^ q) A
q))
T T T F T
T F T F F
F T T F F
F F F T F

A: (~(p v q))→(q^p).

4. With the help of the truth table for ~, fill in

the column of ~(p v q)
 p q (pvq) (~(p v (p ^ q) A
q))
T T T F T T
T F T F F T
F T T F F T
F F F T F F

A: (~(p v q))→(q^p).

5. Finally using the truth table of →, fill in

the column of A
(a) Truth table for (~p) ˄ q

p q ~ p ~ p^q
T T
T F
F T
F F
(a) Truth table for ~p ˄ q

p q ~ p ~ p^q
T T F
T F F
F T T
F F T
(a) Truth table for ~p ˄ q

p q ~ p ~ p^q
T T F F
T F F F
F T T T
F F T F
(b) Truth table of ~ (p V q) → q is the following.

p q pvq ~ ( p ˅ q) ~ (p ˄ q) → q
(b) Truth table of ~ (p V q) → q is the following.

p q pvq ~ ( p ˅ q) ~ (p ˄ q) → q
T
T
F
F
(b) Truth table of ~ (p V q) → q is the following.

p q pvq ~ ( p ˅ q) ~ (p ˄ q) → q
T T
T F
F T
F F
(b) Truth table of ~ (p V q) → q is the following.

p q pvq ~ ( p ˅ q) ~ (p ˄ q) → q
T T T
T F T
F T T
F F F
(b) Truth table of ~ (p V q) → q is the following.

p q pvq ~ ( p ˅ q) ~ (p ˄ q) → q
T T T F
T F T F
F T T F
F F F T
(b) Truth table of ~ (p V q) → q is the following.

p q pvq ~ ( p ˅ q) ~ (p ˄ q) → q
T T T F T
T F T F T
F T T F T
F F F T F
(C) Truth table of ~ ( ~ p ˄ q) V q is the following.
 (C) Truth table of ~ ( ~ p ˄ q) V q is the following.

p q ~p ~p ˄ q ~(~ (p ˄ q) ~ ( ~ p ˄ q) V q
 (C) Truth table of ~ ( ~ p ˄ q) V q is the following.

p q ~p ~p ˄ q ~(~ (p ˄ q) ~ ( ~ p ˄ q) V q
T
T
F
F
 (C) Truth table of ~ ( ~ p ˄ q) V q is the following.

p q ~p ~p ˄ q ~(~ (p ˄ q) ~ ( ~ p ˄ q) V q
T T
T F
F T
F F
 (C) Truth table of ~ ( ~ p ˄ q) V q is the following.

p q ~p ~p ˄ q ~(~ (p ˄ q) ~ ( ~ p ˄ q) V q
T T F
T F F
F T T
F F T
 (C) Truth table of ~ ( ~ p ˄ q) V q is the following.

p q ~p ~p ˄ q ~(~ (p ˄ q) ~ ( ~ p ˄ q) V q
T T F F
T F F F
F T T T
F F T F
 (C) Truth table of ~ ( ~ p ˄ q) V q is the following.

p q ~p ~p ˄ q ~(~ (p ˄ q) ~ ( ~ p ˄ q) V q
T T F F T T
T F F F T T
F T T T F T
F F T F T T
(D) Truth table of (~ p → q) → (~q → ~p)
 (D) Truth table of (~ p → q) → (~q → ~p) is the follo

p q ~p ~p ˄ q ~(~ (p ˄ q) ~ ( ~ p ˄ q) V q
T T F F T T
T F F F T T
F T T T F T
F F T F T T
 Examples for p,q and r
We have to consider all eight assignments and
hence there will be eight rows per table
because there are 3 values.
Consider the formula A: (~p ^ q) → r
The truth table is
 Examples for p,q and r
Consider the formula A: (~p ^ q) → r
Truth Table:
p q r ~p ~p ^ q (~p ^ q) → r
T T T
T T F
 Examples for p,q and r
Consider the formula A: (~p ^ q) → r
Truth Table:
p q r ~p ~p ^ q (~p ^ q) → r
T T T
T T F
T F T
T F F
F T T
 Examples for p,q and r
Consider the formula A: (~p ^ q) → r
Truth Table:
p q r ~p ~p ^ q (~p ^ q) → r
T T T
T T F
T F T
T F F
F T T
F T F
F F T
F F F
 Examples for p,q and r
Consider the formula A: (~p ^ q) → r
Truth Table:
p q r ~p ~p ^ q (~p ^ q) → r
T T T F
T T F F
T F T F
T F F F
F T T T
F T F T
F F T T
F F F T
 Examples for p,q and r
Consider the formula A: (~p ^ q) → r
Truth Table:
p q r ~p ~p ^ q (~p ^ q) → r
T T T F F
T T F F F
T F T F F
T F F F F
F T T T T
F T F T T
F F T T F
F F F T F
 Examples for p,q and r
Consider the formula A: (~p ^ q) → r
Truth Table:
p q r ~p ~p ^ q (~p ^ q) → r
T T T F F T
T T F F F T
T F T F F T
T F F F F T
F T T T T T
F T F T T F
F F T T F T
F F F T F T
 Example
Let A denote the statement formula p ^(p→q)
and B be q.
WeP
show QA logically
p→q
implies B. For
P^(p→q) A→B
this we
construct
T Tthe truth
T tableT A -> B.T
T F F F T
F T T F T
F F T F T
 In this example, we show that the implication p → q is
equivalent to ~p v q. For this we construct the truth table of
(p → q)<->(~p v q)

p q ~p (p → q) ~p v q (p→ q )<-
>(~pvq)
T T F T T T
T F F F F T
F T T T T T
F F T T T T

The truth table represents that (p→ q ) is equal to ( ~p v q )