PAMANTASAN NG LUNGSOD NG MAYNILA
(University of the City of Manila)
MMW 0001 – 65 Mathematics in the Modern World
CHAPTER 5
5.1 Logic Statements and Quantifiers
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.
Compound Statements. A compound
statement is formed by connecting simple
statements with the connectives and, or, if
. . . then, and if and only if.
Example:
Determine whether each sentence is a
statement.
a. Florida is a state in the United States.
b. How are you?
c. x + 1 = 5
Solution
a. Florida is one of the 50 states in the
United States, so this sentence is true,
and it is a statement.
b. The sentence “How are you?” is a
question, it is not a declarative sentence.
Thus, it is not a statement.
c. x + 1 = 5 is a statement. It is known as an
open statement. It is true for x = 4. And
it is false for any other values of x. For
any given value of x, it is true or false but
not both.
Example:
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.
Write the following compound statement 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 its is not raining, then I am not going
to the basketball game.
 Solution
a. p ∧ q
b. ~q ∧ r
c. ~s ∨ r
d. q → s

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
Truth Values. The conjunction p ∧ q is true number
if and only if both p and q are true. The
disjunction p ∨ q is true provide p is true, q Solution
is true, or both p and q are true. a. 7 ≥ 5 means 7 > 5 or 7 = 5, because 7 > 5
is true, the statement is a true
statement.
b. This is a false statement because is not
an even number.
c. This is a true statement because each
simple statement is true.

The negation of a Quantified Statement. Example:

The information in the following table can Write the negation of each of the following
be used to write the negation of many statements.
quantified statements. a. Some airports are open.
b. All movies are worth the price of
admission.
c. No odd numbers are divisible by 2.

Solution
a. No airports are open.
b. Some movies are not worth that prices
of admission.
c. Some odd numbers are divisible by 2.
EXERCISE SET 5.1

STATEMENTS
Determine whether each sentence is a statement. Assume that a and b are real numbers.
1. How much is a ticket to London?
2. 91 is a prime number.
3. a > b
4. a2 ≥ 0
5. Lock the car.
6. Clark Kent is Superman.

COMPOUND STATEMENTS & TRUTH VALUES

Write each sentence in symbolic form. Represent each simple statement of the sentence with
the letter indicated in parenthesis. Also state whether the sentence is a conjunction, a
disjunction, a negation, a conditional, or a biconditional.
1. Today is Monday (m) and it is my birthday (b).
2. If x is divisible by 2 (d), then x is an even number (e).
3. I am going to the dance (g) if and only if I have a date (d).
4. All triangles (t) have exactly three sides (s).

THE NEGATION OF A QUANTIFIED STATEMENT

Write the negation of each quantified of each quantified statement. Start each negation with
“Some,” “No,” or “All.”
1. Some dogs bite.
2. Every dessert at the cove restaurant is good.
3. All winners receive a prize.
4. Some cameras do not use film.
5. No student finished the assignment.
6. At least one person enjoyed the story.
5.2 Truth Tables, Equivalent Statements, and Tautologies
Example:
Construct a truth table for p ∨ [ ~(p ∧ ~q)].

Solution
Construction of Truth Tables
1. If the given statement has n Step 1: The given statement p ∨ [ ~(p ∧ ~q)] has
simple statements, then start with the two simple statements p and q. Thus we
a standard form that has 2n rows. start with a standard form that have 2 2 = 4 rows.
Enter the truth values for each In each column, enter the truth values for the
simple statement and their statements p and ~q, as shown in the column
negations. numbered 1, 2, and 3 of the following table.
2. Use the truth values for each p q p ∨ [~ (p ∧ ~q)]
simple statement and their T T T T F
negations to enter the truth values T F T T T
under each connective within a F T F F F
pair of grouping symbols are F F F F T
nested inside other grouping 1 2 3
symbols, then work from the
inside out. In any situation in Step 2: Use the truth values in columns 2 and 3
which grouping symbols have not to determine the truth values to enter under the
been used, then we use the “and” connective. See column 4 in the following
following order of precedence truth table. Now negate the truth values in
agreement. column 4 to produce the truth values in column
5.
First assign truth values to p q p ∨ [~ (p ∧ ~q)]
negations from left to right, T T T T T F F
followed by conjunctions from left T F T F T T T
to right, followed by disjunctions F T F T F F F
from left to right, followed by F F F T F F T
conditionals from left to right, and 1 5 2 4 3
finally by biconditionals from left
to right. Step 3: Use the truth values in the columns 1
and 5 to determine the truth values to enter
3. The truth value that are entered under the “or” connective. See column 6 in the
into the column under the following table. Shaded column 6 is the truth
connective for which truth values table for p ∨ [ ~(p ∧ ~q)].
are assigned last form the truth p q p ∨ [~ (p ∧ ~q)]
table for the given statement. T T T T T T F F
T F T T F T T T
F T F T T F F F
F F F T T F F T
1 5 2 4 3
Equivalent Statements. Two statements Example:
are equivalent if they both have the same Show that ~(p ∨ ~q) and ~p ∧ q are equivalent
 statements.

Solution
Construct two truth tables and compare the
results. The truth tables below show that ~(p ∨
~q) and ~p ∧ q have the same truth values for all
possible truth values of their simple statements.
Thus, the statements are equivalent.
p q ~ (p ∨ ~q)
T T F T T F
truth value for all possible truth values of T F F T T T
their simple statements. The notation p ≡
F T T F F F
q is used to indicate that the statements p
F F F F T T
and q are equivalent.
p q ~p ∧ ~q
T T F F T
T F F F F
F T T T T
F F F F F

Identical truth values (shaded part)

Thus, ~(p ∨ ~q) = ~p ∧ q.

Example:
Use one of De Morgan’s Law to restate the
following sentence in an equivalent form.

It is not true that, I graduated or I got a job.

De Morgan’s Laws for Statements.
For any statements p and q, Solution
Let p represent the statement “I graduated.” Let
~(p ∨ q) ≡ ~p ∧ ~q and ~(p ∧ q) ≡ ~p ∨ ~q) q represent the statement “I got a job.” In
symbolic form, the original sentence is ~(p ∨ q).
One of De Morgan’s Law states that this is
equivalent to ~p ∧ ~q. Thus a sentence that is
equivalent by the original sentence is “I did not
graduate and I did not get a job.”
Tautologies and Self-Contradictions. Example:
Tautology is a statement that is always Show that p ∨ (~p ∨ q) is a tautology.
true. A self-contradiction is a statement
that is always false. Solution
Enter the truth values for each simple statement
and its negation as shown in the columns
numbered 1, 2, and 3. Use the truth values in
columns 2 and 3 to determine the truth values
 to enter in column 4 under the “or” connective.
Use the truth values in columns 1 and 4 to
determine the truth values to enter in columns
5, under the “or” connective.

p q p ∨ (~p ∨ q)
T T T T F T T
T F T T F F F
F T F T T T T
F F F T T T F

Column 5 of the table shows that p ∨ (~p ∨ q) is

always true. Thus, p ∨ (~p ∨ q) a tautology.

EXERCISE SET 5.2

CONSTRUCTION OF TRUTH TABLES
1. ( ~p → q ) ∨ ( ~q ∧ p )
2. ~p ↔ ( q ∨ p )
3. ~( p ∨ ~q ) ( q →p )
4. ( p ↔ q ) ∨ ( ~q ∧ p)

EQUIVALENT STATEMENTS & DE MORGAN’S LAWS FOR STATEMENTS

Make use of De Morgan’s Law to write the given statement in an equivalent form.
1. It is not true that, Bob failed the English proficiency test and he registered for a speech
course.
2. Ellen did not go to work this morning and she did not take her medication.
3. Wendy will go to the store this afternoon or she will not be able to prepare her fettuccine al
presto recipe.
4. Gina enjoyed the movie, but she did not enjoy the party.

TAUTOLOGIES AND SELF-CONTRADICTIONS.

Use a truth table to determine whether the given statement is a tautology or a self-contradiction.
1. p ∧ ( q ∧ ~p)
2. ( p ∧ q ) ∨ ( p → ~q)
3. [~(p→q) ↔ (p ∧ ~q)
4. p ∨ (p → q)

5.3 The Conditional and the Biconditional

 Example:
Identify the antecedent and consequent in the
following statements.
a. If our school was this nice, I would go
there more than once a week.
- The basketball Diaries
b. If you don’t get in that plane, you’ll
regret it.
- Casablanca
c. If you strike me down, I shall become
Antecedent and Consequent of a
more powerful than you can possibly
Conditional. In a conditional statement
imagine.
represented by “if p, then q” or by “if p,
- Ohi Wan Kenobi, Star Wars, Episode
q,” the p statement is called the
IV, A New Hope
antecedent and the q statement is called
the consequent.
Solution
a. Antecedent: our school was this nice
Consequent: I would go there more than
once a week.
b. Antecedent: you don’t get in that plane
Consequent: you’ll regret it
c. Antecedent: you strike me down
Consequent: I shall become more
powerful than you can possibly imagine.

Example:
Determine the truth value of each of the
following conditional statements.
a. If 2 is an integer, then 2 is a rational
number.
b. If 3 is a negative number, then 5 > 7.
Equivalent Disjunctive Form of p → q.
c. If 5 > 3, then 2 + 7 = 4
p→q≡~p∨q
The conditional p → q is false when p is
Solution
true, and q is false. It is true in all other
a. Because the consequent is true, this is
cases
true statement.
b. Because the antecedent is false, this is a
true statement.
c. Because the antecedent is true and the
consequent is false, this is a false
statement.
 Example:
Let p, q, and r represent the following:
p: She will go on vacation
q: She cannot take the train
r: She cannot get a loan

Write the following symbolic statements in

The Negation of p → q. words.
~(p → q) ≡ p ∧ ~q a. p ↔ ~q
b. ~r ↔ ~p

Solution
a. She will go on vacation if and only if she
can take the train
b. She can get a loan if and only if she does
not go on vacation.
EXERCISE SET 5.3

ANTECEDENT AND CONSEQUENT OF A CONDITIONAL

Identify the antecedent and the consequent of each conditional statement.
1. If he has talent, he will succeed.
2. If I had a credential, I could get the job.
3. I will follow the exercise program provided I join the fitness club.
4. I will attend only if it is free.

EQUIVALENT DISJUNCTIVE FORM

Write each conditional statement in its equivalent disjunctive form.
1. If she were tall, she would be on the volleyball team.
2. If he can stay awake, he can finish the report.
3. Rob will start, provided he is not ill.
4. Sharon will be promoted only if she closes the deal.

THE NEGATION
Write the negation of each conditional statement in its equivalent conjunctive form.
1. If I get my paycheck, I will purchase a ticket.
2. The tomatoes will get big only if you only provide them with plenty of water.
3. If you entered Cleggmore University, then you had a high score on the SAT exam.
4. If Ryan enrolls at a university, then he will enroll at Yale.
5.4 The Conditional and Related Statements
Example:
Write each of the following in “If p, then q”
form.
a. The number is an even number provided
that it is divisible by 2.
b. Today is Friday, only if yesterday was
Thursday.

Solution
a. The statement, “The number is an even
Equivalent Forms of the Conditional number provided that it is divided by 2,”
The conditional “if p, then q” can be is in “q provided that p” form. The
stated, in English, in several equivalent antecedent is “it is divisible by 2,” and
forms. For example, p only if q; p implies the consequent is “the number is an
that q; and q provided that p are all even number.” Thus its “If p, then q”
equivalent forms of if p, then q. form is
If it is divisible by 2, then the number is
an even number.
b. The statement, “Today is Friday, only if
yesterday was Thursday,” is in “p only if
q” form. The antecedent is “today is
Friday.” The consequent is “yesterday
was Thursday.” Its “If p, then q” form is
If today is Friday, then yesterday was
Thursday.

Example:
Write the converse, inverse, and contrapositive
of

If I get the job, then I will rent the apartment.

Statements Related to the Conditional
Statement
Solution
 The converse of p → q is q → p.
Converse: If I rent the apartment, then I get the
 The inverse of p → q is ~p → ~q.
job.
 The contrapositive of p → q is ~q → ~p.
Inverse: If I do not get the job, then I will not
rent the apartment.
Contrapositive: If I do not rent the apartment,
then I did not get the job.

A Conditional Statement and Its Example:

Contrapositive. A conditional and its Determine whether the given statements are
contrapositive are equivalent statements. equivalent.
Therefore, if the contrapositive of a a. If a number ends with a 5, then the
 number is divisible by 5.
If a number is divisible by 5, then the
number ends with a 5.
b. If two lines in a plane do not intersect,
then the lines are parallel.
If two lines in a plane are not parallel,
then the lines intersect.
conditional statement is a true statement,
then the conditional statement must also
Solution
be a true statement.
a. The second statement is the converse of
the first. The statements are not
equivalent.
b. The second statement is the
contrapositive of the first. The
statements are equivalent.

EXERCISE SET 5.4

EQUIVALENT FORMS OF THE CONDITIONAL

Determine whether the given statement is true or false. Assume that x and y are real
numbers.
1. x = y if and only if |x| = |y|.
2. x > y if and only if x - y > 0.
3. If x2 > 0, then x > 0.
4. If x2 = y2, then x = y.

Write each statement in “If p, then q” form.

1. Every nonrepeating, nonterminating decimal is an irrational number.
2. Being well known is a necessary condition for a politician.
3. I could buy the house provided that I could sell my condominium.
4. Being divisible by 9 is a sufficient condition for being divisible by 3.

STATEMENTS RELATED TO THE CONDITIONAL STATEMENT

Write the converse, inverse, contrapositive of the given statement.
1. If x + 4 >7, then x > 3.
2. All recipes in this book can be prepared in less than 20 minutes.
3. If a and b are both divisible by 3, then (a+b) is divisible by 3.
4. If you build it, they will come.
 5. Every trapezoid has exactly two parallel sides.
6. If they like it, they will return.
7.
A CONDITIONAL STATEMENT AND ITS CONTRAPOSITIVE
Use the contrapositive of the following statement to determeine whether the statement is true or
false.

If today is not Monday, then yester was not Sunday.

5.5 Symbolic Arguments

Example:
Determine whether the following argument is
valid or invalid.

If its rains, then the game will not be played. It is

Valid Argument. An argument consists of
not raining. Therefore, the game will be played.
a set of statements called premises and
another statement called the conclusion.
Solution
An argument is valid if the conclusion is
If we let r represent “it rains” and g represent
true whenever all the premises are
“the game will be played,” then the symbolic
assumed to be true. An argument is invalid
form is
if it is not a valid argument.
r → ~g
~r__________
∴g

Symbolic Forms of Arguments Example:

Use a standard form for Four Valid Arguments
Standard Forms of Four Valid Arguments to determine a valid conclusion for each
 argument.

a. If Kim is a lawyer (p), then she will be

able to help us (q).
Kim is not able to help us (~q).______
∴?
Standard Forms of Two Invalid b. If they had a good time (g), they will
Arguments return (r).
If they return (r), we will make more
money (m).____________________
∴?
Solution
a. The symbolic form of the premises is:
p→q
~q
This matches the standard form known
as contrapositive reasoning. Thus a valid
conclusion is ~p: “Kim is not a lawyer”
b. The symbolic form of the premises is:
g→r
r→m
This matches the standard form known
as transitive reasoning. Thus a valid
conclusion is g → m: “If they had a good
time, then we will make more money.”

EXERCISE SET 5.5

VALID ARGUMENT
Use a truth table to determine whether the argument is valid or invalid.
1. p ∧ ~q ∧ (~p → q)
p______________
∴~q
2. r
p → ~r
~p → q_________
∴p∧q
3. p → ~q
q______________
∴~p

SYMBOLIC FORMS OF ARGUMENTS

Determine whether the argument is valid or invalid by comparing its symbolic form.
1. We will serve either fish or chicken for lunch. We did not serve fish for lunch.
Therefore, we served chicken for lunch.
 2. If mike is a CEO, then he will be able to afford to make a donation. If Mike can afford
to make a donation, then he loves to ski. Therefore, if Mike does not love to ski, he is
not a CEO.
3. If we wish to win the lottery, we must buy a lottery ticket. We did not win lottery.
Therefore, we did not buy a lottery ticket.

5.6 Arguments and Euler Diagrams

Euler Diagrams Example:
Use an Euler diagram to determine whether the
following argument is valid or invalid.

All college courses are fun.

This course is a college course.
∴ This course is fun.

Euler diagrams can be used to determine
whether arguments that involve quantifies
are valid or invalid.
Draw an Euler diagram that illustrates the
conditions required by the premises of an
argument.
If the conclusion of the argument must
Solution
The first premise indicates that the set of
college course is a subset of the set of fun
courses. The second premise tells us that “this
course” is an element of the set of college
courses. If we use c to represent “this course”,
then c must be placed inside the set of college
courses.
necessarily follow from all the conditions
shown by the premises, then the
arguments is valid.
If the conclusion of the argument does not
necessarily follow form the conditions
shown by all the premises, then the
argument is invalid.

EXERCISE SET 5.5

EULER DIAGRAMS
Use an Euler diagram to determine whether the argument is valid or invalid.
1. No wizard can yodel
All lizards can yodel
∴ No wizard is a lizard
2. Some dogs have tails.
Some dogs are big.
∴ Some big dogs have tails.
3. All Italians villas are wonderful. Some wonderful villas are expensive. Therefore, some
Italian villas are expensive.
4. All logicians like to sing “It’s a small world after all.” Some logicians have been
presidential candidates. Therefore, some presidential candidates like to sing “It’s a
small world after all.”