Logic

Proposition
 Lesson Outline:
1. Define proposition.
➢ Give examples and non-examples
2. Define simple and compound
propositions.
➢ Distinguish simple and compound
propositions
Definition:
A proposition is a declarative
sentence that is either true or false,
but not both. If a proposition is
true, then its truth value is true,
which is denoted by 𝑻; otherwise,
its truth value is false, which is
denoted by 𝑭.
 Propositions are usually denoted by
small letters. For example, the proposition
p: Everyone should study logic
may be read as
p is the proposition “Everyone should
study logic.”
If a sequence of propositions is considered,
we denote the propositions by 𝑃1, 𝑃2,…
 Example 1.
Determine whether each of the
following statements is a proposition or
not. If it is a proposition, give its truth
value.

6
A: The sum of 5 and 6 is 10

A is proposition, it is false that

5+6 is 10

7
B: Mark can you give me money?

B is not a proposition because

we cannot be identified if it is
true or false
8
C: Yahoo!!!

C is not a proposition because

we cannot be identified if it is
true or false
9
D: All squares are rectangles

D is a proposition, it is true.

10
E: Medical specialists are the
modern heroes

E is a proposition, it is true.

11
Definition.
A compound proposition is a
proposition formed from simpler
proposition using logical connectors or
some combination of logical
connectors. Some logical connectors
involving propositions p and/or q may
be expressed as follows:
 not p p or q
p and q If p,then q

where ∧ , ∨ stands for some

proposition. A proposition is simple if it
cannot be broken down any further
into other component propositions.
 Example 2.
Determine whether it is a simple or a
compound proposition. If it is a
compound proposition, identify the
simple components.

14
𝑝: Mindanao is an island in the Philippines.
𝑟: My seatmate will get a perfect score in
the logic exam.
𝑃1, : It is not the case that 2 is a rational
number.
𝑃2, : Either logic is fun and interesting, or it
is boring.
𝑃3, : If you are a Grade 11 student, then
you are a Filipino 15
Solution.
The propositions 𝑝, and 𝑟 are all
simple propositions. On the
other hand, the following are
compound propositions
16
 Logical
Operators
Lesson Outline:
1. Introduce how to construct a truth
table.
2. Define the logical operators:
negation, conjunction, disjunction,
conditional and biconditional.
 Example 1.
Since a proposition has two possible
truth values, a proposition would have
the following truth table.
𝑝
𝑇
𝐹
19
Truth tables can also be used to
display various combinations of the
truth values of two propositions 𝑝
and 𝑞 . The rows of the table will
correspond to each truth value
combination of 𝑝 and 𝑞, so there will
be rows. The truth table for
propositions and are as follows.
20
𝑝 𝑞
𝑇 𝑇
𝑇 𝐹
𝐹 𝑇
𝐹 𝐹
21
Similarly, suppose 𝑝 , 𝑞 , and 𝑟 are
propositions. Then the truth table
involving the given propositions has

23 = 8 rows,

22
𝑝 𝑞 𝑟
𝑇 𝑇 𝑇
𝑇 𝑇 𝐹
𝑇 𝐹 𝑇
𝑇 𝐹 𝐹
𝐹 𝑇 𝑇
𝐹 𝑇 𝐹
𝐹 𝐹 𝑇
𝐹 𝐹 𝐹 23
In general, a truth table
involving 𝑛 propositions has
𝑛
2 rows.

24
Example 2.
State the negation of the ropositions. 𝑝
𝑛1 : 𝑝 𝑥 = (𝑥 + 1)/(𝑥 − 2) is a
polynomial function.

~𝑛1 : “It is not true that

𝑝 𝑥 = (𝑥 + 1)/(𝑥 − 2)
is a polynomial function
25
Example 2.
State the negation of the propositions. 𝑝

𝑛2 : 2 is an odd number.

~𝑛2 : “It is not true that 2 is an odd

number”, or “2 is an even number.”

26
Example 2.
State the negation of the propositions. 𝑝

𝑛3 :The tinikling is the most

difficult dance.

~𝑛3 : “The tinikling is not the most

difficult dance.”
27
Example 2.
State the negation of the propositions. 𝑝

𝑛4 : Everyone in Visayas speaks

Cebuano.

~𝑛4 : “Not everyone in Visayas

speaks Cebuano.”
28
Definition.
The conjunction of the 𝑝 𝑞 𝑝∧𝑞
propositions 𝑝 and 𝑞 is 𝑇 𝑇 𝑇
denoted by 𝑇 𝐹 𝐹
𝑝 ∧ 𝑞 :( 𝑝 and 𝑞 ) F 𝑇 𝐹
and is defined through
𝐹 𝐹 𝐹
its truth table
 The propositions 𝑝 and 𝑞 are
called conjuncts.
The conjunction 𝑝 ∧ 𝑞 is true only
when both conjuncts and are true, as
shown in its truth table.
Example 3.
Let 𝑝 and 𝑞 be the propositions
𝑝: Angels exist.
𝑞: 𝜋 > 3
Express the following conjunctions in
English sentences or in symbols, as the
case may be.
1. 𝑝 ∧ 𝑞
2. 𝑝 ∧ (~𝑞)
3. “Angels do not exist and 𝜋 > 3.” 31
Solution:
1. “Angels exist and 𝜋 > 3 .”
2. “Angels exist and not 𝜋 > 3 .” or
“Angels exist, yet 𝜋 > 3 .”
3. (~𝑝) ∧ (~𝑞)

32
 Definition.
The disjunction of 𝑝 𝑞 𝑝∧𝑞
two propositions 𝑝 𝑇 𝑇 𝑇
and 𝑞 is denoted by 𝑇 𝐹 𝑇
𝑝 ∨ 𝑞 :( 𝑝 or 𝑞 ) F 𝑇 𝑇
and is defined 𝐹 𝐹 𝐹
through its truth table
The propositions 𝑝 and 𝑞 are called
disjuncts.
The above truth table shows us that
the disjunction 𝑝 ∨ 𝑞 is false only when
both disjuncts and are false.
Example 4.
Let 𝑝, 𝑞, and 𝑟 be the
following propositions:
𝑝: Victor has a date with Liza.
𝑞: Janree is sleeping.
𝑟: Eumir is eating.

35
Express the following propositions in English
sentences or in symbols, as the case may be.

𝑝∨𝑞

“Victor has a date with Liza or

Janree is sleeping.”
36
 Express the following propositions in English
sentences or in symbols, as the case may be.

𝑞 ∨ (∼ 𝑟)

“Either Janree is sleeping or Eumir is

not eating.”
37
 Express the following propositions in English
sentences or in symbols, as the case may be.

𝑝 ∨ (𝑞 ∨ 𝑟)

“Either Victor has a date with Liza, or

Janree is sleeping, or Eumir is
eating.”
38
 Express the following propositions in English
sentences or in symbols, as the case may be.

“Either Victor has a date with Liza, or

Janree is sleeping, and Eumir is eating.”

𝑝 ∨ (𝑞 ∧ 𝑟)
39
 Express the following propositions in English
sentences or in symbols, as the case may be.

“Either Victor has a date with Liza and

Janree is sleeping, or Victor has a date
with Liza and Eumir is eating.”

(𝑝 ∧ 𝑞) ∨ (𝑝 ∧ 𝑟)
40
 Definition.
The conditional of 𝑝 𝑞 𝑝→𝑞
the propositions 𝑝 and 𝑇 𝑇 𝑇
𝑞 is denoted by 𝑇 𝐹 F
𝑝 → 𝑞 ∶ (𝐼𝑓 𝑝 , 𝑡ℎ𝑒𝑛 𝑞) F 𝑇 𝑇
and is defined 𝐹 𝐹 𝑇
through its truth table
The conditional 𝑝 → 𝑞 may also be
read as “ p implies q ”. The proposition
𝑝 is called the hypothesis, while the
proposition 𝑞 is called the conclusion.
 Example 5.
One day, Richard tweeted:
“If I get promoted, then I will stop posting
selfies on Facebook.”
Let be the statement
“Richard gets promoted”, and let be the
statement, “Richard stops posting selfies on
Facebook.”
43
 Determine whether the conditional is true
given the following scenarios.
Scenario A:
Richard got the promotion and promptly
stopped posting selfies on Facebook.

Both the hypothesis and conclusion

are true, so the conditional is true.
44
 Determine whether the conditional is true
given the following scenarios.
Scenario B:
Richard got promoted, but then he
realized that posting selfies has become a
habit he cannot break easily.
In this scenario, the hypothesis is
true and conclusion is false. By
definition, the conditional is false. 45
Scenario C:
Richard stopped posting selfies, but he
did not get the promotion .

The hypothesis is false, hence

regardless of the truth value of the conclusion,
the conditional is false. In this case, he did not
break his promise since he was not promoted
in the first place
46
 Definition.
The biconditional of 𝑝 𝑞 𝑝⟷𝑞
propositions 𝑝 and 𝑞 is 𝑇 𝑇 𝑇
denoted by 𝑇 𝐹 F
𝑝 ⟷ 𝑞 ∶ (𝑝 𝑖𝑓 𝑎𝑛𝑑 𝑜𝑛𝑙𝑦 𝑖𝑓 𝑞) F 𝑇 𝐹
and is defined through 𝐹 𝐹 T
its truth table:
The proposition may also be written
as “ 𝑝 iff 𝑞 ”. The propositions 𝑝 and
𝑞 are the components of the
biconditional
 Example 5.
Suppose that Geebee is a Grade 11
student.
Let us now consider the following
biconditionals.

49
𝑃1 : Geebee is in Grade 11 if and only if
she is a senior high school student.

𝑃1 : Again, both simple components of

are true. Therefore, the biconditional
statement is true.
50
𝑃2 : Geebee is in Grade 11 if and only if
she is working as a lawyer.

𝑃2 : It is true that Geebee is in Grade 11,

but it is not true that Geebee is working
as a lawyer. Therefore, the biconditional
is not true, referring to the second row of
its truth table. 51
𝑃3 : Geebee has a degree in Computer
Science if and only if she believes in true love

𝑃3 : The first simple proposition, that Geebee has a

degree in Computer Science, is false. The truth
value of the entire biconditional depends on the truth
value of the second simple component, that she
believes in true love. If this is true, then the
biconditional is false (referring to the third row of the
52
truth table); otherwise, the biconditional is true
Truth Tables
Lesson Outline:
1. Constructing truth tables.
2. Define a tautology and
contradiction.
Example 1.
Let 𝑝 and 𝑞 be propositions.
Construct the truth table for the
compound proposition
(𝑝 ⟶ 𝑞) ∧ (𝑞 → 𝑝).

55
 (𝑝 ⟶ 𝑞) ∧ (𝑞 → 𝑝).

𝑝 𝑞 𝑝⟶𝑞 𝑞⟶𝑝 (𝑝 ⟶ 𝑞) ∧ (𝑞 → 𝑝)

𝑇 𝑇 𝑇 𝑇 𝑇
𝑇 𝐹 𝐹 𝑇 𝐹
𝐹 𝑇 𝑇 𝐹 𝐹
𝐹 𝐹 𝑇 𝑇 𝑇
56
Example 2.
Consider the compound proposition
[(𝑝 ⟶ 𝑟) ∧ (𝑞 → 𝑟)] → [(𝑝 ∨ 𝑞) → 𝑟]
Construct its truth table.

57
 [(𝑝 ⟶ 𝑟) ∧ (𝑞 → 𝑟)] → [(𝑝 ∨ 𝑞) → 𝑟]
𝑝 𝑞 𝑟 𝑝⟶𝑟 𝑞→𝑟 (𝑝 ⟶ 𝑟) ∧ (𝑞 → 𝑟)
𝑇 𝑇 𝑇 𝑇 𝑇 𝑇
𝑇 𝑇 𝐹 𝐹 𝐹 𝐹
𝑇 𝐹 𝑇 𝑇 𝑇 𝑇
𝑇 𝐹 𝐹 𝐹 𝑇 𝐹
𝐹 𝑇 𝑇 𝑇 𝑇 𝑇
𝐹 𝑇 𝐹 𝑇 𝐹 𝐹
𝐹 𝐹 𝑇 𝑇 𝑇 𝑇
𝐹 𝐹 𝐹 𝑇 𝑇 𝑇 58
[(𝑝 ⟶ 𝑟) ∧ (𝑞 → 𝑟)] → [(𝑝 ∨ 𝑞) → 𝑟]
𝑝 𝑞 𝑟 𝑝∨𝑞 (𝑝 ∨ 𝑞) → 𝑟
𝑇 𝑇 𝑇 𝑇 𝑇
𝑇 𝑇 𝐹 𝑇 𝐹
𝑇 𝐹 𝑇 𝑇 𝑇
𝑇 𝐹 𝐹 𝑇 𝐹
𝐹 𝑇 𝑇 𝑇 𝑇
𝐹 𝑇 𝐹 𝑇 𝐹
𝐹 𝐹 𝑇 𝐹 𝑇
𝐹 𝐹 𝐹 𝐹 𝑇 59
 [(𝑝 ⟶ 𝑟) ∧ (𝑞 → 𝑟)] → [(𝑝 ∨ 𝑞) → 𝑟]
(𝑝 ⟶ 𝑟) ∧ (𝑞 → 𝑟) (𝑝 ∨ 𝑞) → 𝑟 𝑝⟶𝑟 ∧ 𝑞→𝑟 → [(𝑝 ∨ 𝑞) → 𝑟]

𝑇 𝑇 𝑇
𝐹 𝐹 𝑇
𝑇 𝑇 𝑇
𝐹 𝐹 𝑇
𝑇 𝑇 𝑇
𝐹 𝐹 𝑇
𝑇 𝑇 𝑇
𝑇 𝑇 𝑇 60
Note that regardless of the truth
values of p, q, and 𝑟
𝑝⟶𝑟 ∧ 𝑞→𝑟 → 𝑝∨𝑞 →𝑟
is always true. Such propositions are
called 𝑡𝑎𝑢𝑡𝑜𝑙𝑜𝑔𝑖𝑒𝑠.
61
 Definition.
A proposition that is always true is
called a 𝑡𝑎𝑢𝑡𝑜𝑙𝑜𝑔𝑦, while a proposition
that is always false is called a
𝑐𝑜𝑛𝑡𝑟𝑎𝑑𝑖𝑐𝑡𝑖𝑜𝑛 . We denote tautologies
by 𝜏 and contradictions by 𝜙
Example 3.
Let 𝑝 and 𝑞 be propositions. Using
truth tables, show the following:

63
 a. 𝑝 ∨ 𝜏 is a tautology.
Solution:
a.Note that 𝝉 is always true. Hence in the
disjunction 𝑝 ∨ 𝜏 , there is at least one
true disjunct. Therefore, is a tautology
since regardless of the truth value of 𝑝 ,
𝑝 ∨ 𝜏 is true.
64
Truth Table:

𝑝 𝝉 𝑝∨𝜏

𝑇 𝑇 𝑇

𝐹 𝑇 𝑇

65
 b. 𝑝 ∧ 𝜙 is a contradiction
Solution:
Since 𝜙 is always false, then the
second column of the truth table we
will be constructing will contain 𝐹 𝑠 .
We have the following truth table.

66
Truth Table:

𝑝 𝜙 𝑝∧𝜙

𝑇 𝐹 𝐹

𝐹 𝐹 𝐹

Regardless of the truth value of 𝑝, 𝑝 ∧ 𝜙 is

always false. Hence, it is a contradiction. 67
 c. 𝑝 → (𝑝 ∨ 𝑞) is a tautology.
Solution: Truth Table
𝑝 𝑞 𝑝∨𝑞 𝑝 → (𝑝 ∨ 𝑞)

𝑇 𝑇 𝑇 𝑇
𝑇 𝐹 𝑇 𝑇
𝐹 𝑇 𝑇 𝑇
𝐹 𝐹 𝐹 𝑇 68
 d. [𝑝 ∧ ~𝑞 ] ∧ (𝑝 ∧ 𝑞) is a contradiction.
Solution:
𝑝 𝑞 ~𝑞 𝑝 ∧ ~𝑞 𝑝∧𝑞 [𝑝 ∧ ~𝑞 ] ∧ (𝑝 ∧ 𝑞)
𝑇 𝑇 𝐹 𝐹 𝑇 𝐹
𝑇 𝐹 𝑇 𝑇 𝐹 𝐹

𝐹 𝑇 𝐹 𝐹 𝐹 𝐹
𝐹 𝐹 𝑇 𝐹 𝐹 𝐹 69
 Logical
Equivalence and
Conditional
Propositions
Lesson Outline:
1. Define a logical equivalence.
2. Define different forms of
conditional proposition.
 Definition.
Two propositions 𝑝 and 𝑞 are logically
equivalent, denoted by 𝑝 ⇔ 𝑞 , if they have
the same truth values for all possible truth
values of their simple components.
Logical equivalence can also be
expressed in terms of a biconditional
statement. Two propositions 𝑝 and 𝑞 are
logically equivalent if the proposition 𝑝 ↔ 𝑞 is
always true (or is a tautology).
Example 1.
Show that
𝑝 → 𝑞 ⇔ (~𝑝 ∨ 𝑞).

We shall call this logical

equivalence the Switcheroo law.
73
Solution. We need to show that 𝑝 → 𝑞 and ~𝑝 ∨ 𝑞 have the
same truth values using a truth
Truth Table:
𝑝 𝑞 𝑝→𝑞 ~𝑝 ~𝑝 ∨ 𝑞

𝑇 𝑇 𝑇 𝐹 𝑇

𝑇 𝐹 𝐹 𝐹 𝐹

𝐹 𝑇 𝑇 𝑇 𝑇

𝐹 𝐹 𝑇 𝑇 𝐹 74
Notice that the third and fifth
columns of the truth table above
contains the same truth values in the
same sequence. Thus,
(𝒑 → 𝒒) ⇔ (~𝒑 ∨ 𝒒).
75
 The table below shows the different logical
equivalences that are used when manipulating
compound propositions.
Theorem (Table of Logical Equivalences). Let
𝑝, 𝑞, and 𝑟 , and be propositions. We have the
following logical equivalences

76
77
78
79
80
Example 2.
Show that
∼ (𝑝 → 𝑞) ⇔ [𝑝 ∧ (∼ 𝑞)]
using logical equivalences.

81
 Solution.
One way to do this is to construct a
truth table for each logical expression
then show that they have the same
truth values. Another method is to use
the logical equivalences to transform
∼ 𝑝 ∨ 𝑞 into 𝑝 ∧ ∼ 𝑞 .
82
Solution. ∼ (𝑝 → 𝑞) ⇔ [𝑝 ∧ (∼ 𝑞)]
∼ 𝑝⟶𝑞 𝑔𝑖𝑣𝑒𝑛
⇔ ∼ (~𝑝 ∨ 𝑞) Switcheroo Law

⇔ ∼ (~𝑝) ∧ ~(𝑞) De Morgan’s Law

⇔ 𝑝 ∧ (~𝑞) Double Negation

83
Example 3.
Let 𝑝 and 𝑞 be propositions.
Construct the truth tables for each of
the following conditionals:
𝑝 → 𝑞, 𝑞 → 𝑝, ∼ 𝑝 → ∼ 𝑞 , and
∼𝑞 → ∼𝑝 .

84
Solution.

85
Note that the fifth and eighth columns are
the same, so we have shown that𝑝 →
𝑞 ⇔ ∼ 𝑞 → ∼ 𝑝 . Likewise, since the
sixth and seventh columns are identical, it
follows that 𝑞 → 𝑝 ⇔ ∼ 𝑝 → ∼ 𝑞 .
The conditionals that we considered in the
previous example are the different forms
of conditional propositions.
86
Definition.
Suppose 𝑝 and 𝑞 are propositions. From
the conditional proposition 𝑝 → 𝑞 , we
derive three other conditional statements,
namely its
a. Converse: 𝒒→𝒑
b. Contrapositive: ∼𝒒 → ∼𝒑
c. Inverse: ∼𝒑 → ∼𝒒
 Forms of Conditional Proposition
Converse Proposition happens when you
reverse the “if then” proposition
Conditional Proposition
𝑝→𝑞
If you are cute then you are smart
Converse Proposition
𝑞→𝑝
If you are smart then you are cute
 Forms of Conditional Proposition
Inverse proposition is when each proposition is
being negated
Conditional Proposition
𝑝→𝑞
If you are cute then you are smart
Inverse Proposition
~𝑝 → ~ 𝑞
If you are not cute then you are not smart
Contrapositive Proposition is the combination of
Converse and Inverse proposition by reversing
and negating both propositions.
Conditional Proposition
𝑝→𝑞
If you are cute then you are smart
Contrapositive Proposition
~𝑞 → ~ 𝑝
If you are not smart then you are not cute
 Example 4.
Verify the following logical equivalences
using (a) the known logical equivalences, and
(b) truth tables.
a. 𝑝 ∧ 𝑞 ⇔ ~( ∼ 𝑝 ∨ ∼ 𝑞 )
b. ∼ 𝑝 → (𝑞 → 𝑟) ⇔ 𝑞 → (𝑝 ∨ 𝑟)
c. 𝑝 ↔ 𝑞 ⇔ ∼ 𝑝 ↔ ∼ 𝑞
d. (~(𝑝 ∨ 𝑞)) ∨ ((~𝑝) ∧ 𝑞) ⇔∼ 𝑝
91
 a. 𝑝 ∧ 𝑞 ⇔ ~( ∼ 𝑝 ∨ ∼ 𝑞 )
𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧:
~( ∼ 𝑝 ∨ ∼ 𝑞 ) 𝑔𝑖𝑣𝑒𝑛

⇔ ∼ ~𝑝 ∧ ∼ ∼ 𝑞 De Morgan’s Law

⇔ 𝑝∧𝑞 Double Negation

92
 b. ∼ 𝑝 → (𝑞 → 𝑟) ⇔ 𝑞 → (𝑝 ∨ 𝑟)
𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧:
∼ 𝑝 → (𝑞 → 𝑟) 𝑔𝑖𝑣𝑒𝑛
⇔ ∼ ~𝑝 ∨ (𝑞 → 𝑟) Switcheroo Law
⇔ 𝑝 ∨ (𝑞 → 𝑟) Double Negation
⇔ 𝑝 ∨ (∼ (𝑞) ∨ 𝑟) Switcheroo Law
⇔ ∼ (𝑞) ∨ (𝑝 ∨ 𝑟) Associative Law
⇔ 𝑞 → (𝑝 ∨ 𝑟) Switcheroo Law
93
 c. 𝑝 ↔ 𝑞 ⇔ ∼ 𝑝 ↔ ∼ 𝑞
𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧:
𝑝↔𝑞 𝑔𝑖𝑣𝑒𝑛
Biconditional Material
⇔ (𝑝 → 𝑞) ∧ (𝑞 → 𝑝) Equivalence
⇔ [ ∼𝑞 → ∼𝑝 ] ∧ [ ∼𝑝 → ∼𝑞 ] Conditionals are logivally equivalent
to their contrapositives

⇔ [ ∼ 𝑝) → (∼ 𝑞 ] ∧ [ ∼ 𝑞 → ∼ 𝑝 ] Commutative Law
Biconditional Material
⇔ ∼ 𝑝 ↔ (∼ 𝑞) Equivalence
94
 d. ~ 𝑝∨𝑞 ∨ [(~𝑝) ∧ 𝑞] ⇔∼ 𝑝
𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧:
[~ 𝑝 ∨ 𝑞 ] ∨ [(~𝑝) ∧ 𝑞] 𝑔𝑖𝑣𝑒𝑛
⇔ ~𝑝 ∧ (~𝑞) ∨ [(~𝑝) ∧ 𝑞] De Morgan’s Law
⇔ {[ ~𝑝) ∧ (~𝑞 ] ∨ ~𝑝 } ∧ {[ ~𝑝 ∧ ~𝑞 ] ∧ 𝑞)} Distributive law
⇔ ~𝑝) ∨ ~𝑝 ] ∧ [(~𝑞 ∨ ~𝑝 ∧ { ~𝑝 ∧ 𝑞 ∧ ~𝑞 ∧ 𝑞 } Distributive law
Idempotent Law and
⇔ {(~𝑝) ∧ [(~𝑞) ∨ (~𝑝)]} ∧ {[(~𝑝) ∨ 𝑞] ∧ 𝜏} Inverse Law

⇔ {(~𝑝) ∧ [(~𝑞) ∨ (~𝑝)]} ∧ [(~𝑝) ∨ 𝑞] Identity Law

⇔ (~𝑝) ∧ [(~𝑝) ∨ 𝑞] Absorption Law
95
⇔ 𝑝 Absorption Law
 Practice
and
Application
 Answer the following Problem
1. . Let 𝑝, 𝑞, and 𝑟 be the propositions
𝑝: “Rena eats at the Spanish restaurant.”,
𝑞 : “Rena orders the restaurant’s special paella.”,
𝑟: “Rena has dessert.”
Express the following statements in English sentences or in symbols, as the case
may be.
a. “Rena orders the restaurant’s special paella, but she does not have dessert.”
b. “Whenever Rena eats at the Spanish restaurant, either she orders the
restaurant’s special paella or she has dessert.”
c. “If Rena eats at the Spanish restaurant, she orders the restaurant’s special
paella if and only if she does not order dessert.”
d. 𝑝 ⟶ ((𝑞 ∧ ∼ 𝑟 ) ∨ 𝑟)
e. ( ∼ 𝑞 ∧ ~𝑟 ) ⟶ (~𝑝) 97
1. Consider the propositions 𝒖: “Pam works as a sales associate.” 𝒗: “Bryan has
a temporary position in the office.” and 𝒘: “Pam and Bryan are co-workers.”
Express the following propositions in English sentences or in symbols as
the case may be.
a. “Pam and Bryan are co-workers, but Pam works as a sales associate
and Bryan does not have a temporary position in the office.”
b. “Pam and Bryan are co-workers, but if Bryan has a temporary
position in the office, then Pam does not work as a sales associate.”
c. “Pam and Bryan are co-workers if and only if either Pam works as a
sales associate or Bryan has a temporary position in the office.”
d. 𝑤 ⟶ (𝑢 ⟷ 𝑣)
e. [ ∼ 𝑢 ∨ ~𝑣 ] ⟶ (~𝑤)
98
 Answer the following Problem
1. Construct the truth table for the following compound
propositions. Assume all variables denote propositions.
a. 𝑝 ∨ 𝑞 ∧ [~ 𝑝 ∧ 𝑞 ]
b. 𝑝 ↔ 𝑞 ∨ [(~𝑝) → 𝑞]
c. [𝑝 → 𝑞 → 𝑟 ] → [(𝑝 ∧ 𝑞) → 𝑟]
2. Show that the following statements are tautologies by
constructing the truth table for each.
a. (~𝑝) ∨ 𝑞 → (𝑝 → 𝑞)
b. [~ 𝑝 ↔ 𝑞 ] ↔ [(𝑝 ∨ 𝑞) ∧ (~ 𝑝 ∧ 𝑞 )]
99
Answer the following Problem
1. Determine the converse, contrapositive, and inverse of the
following conditional propositions. a. “If the clothes are neatly
stacked and pressed, then the house help arrived today.”
b. “If it did not flood yesterday, then the streets are dry
today.”
2. Verify the following logical equivalences using (a) the known
logical equivalences and
(b) truth tables.
a. (𝑝 → 𝑞) ⇔ ~[𝑝 ∧ ∼ 𝑞 ]
b. 𝑝∨𝑞 ⇔ [ ∼𝑝 ∧ ∼𝑞 ] 100
Quiz no. 8
A. Show that the following statements are
tautologies by constructing the truth table for
each.
1. [(~𝑞) → (~𝑝)] → (𝑝 → 𝑞)
(10 points)
2. [𝑝 ∧ 𝑞 ∨ 𝑟 ] → [(𝑝 ∧ 𝑞) ∨ (𝑝 ∧ 𝑟)]
(10 points)
3. [𝑝 ∨ 𝑞 ∧ 𝑟 ] → [(𝑝 ∨ 𝑞) ∧ (𝑝 ∨ 𝑟)]
(10 points) 102
B. Verify the following logical equivalences using
(a) the known logical equivalences and (b) truth
tables.
4. 𝑝 ↔ 𝑞 ⇔ ~{ 𝑝 ∧ 𝑞 ∨ ∼ 𝑝 ∧ ∼ 𝑞 }
(10 points)
5. 𝑝 ↔ (𝑞 ↔ 𝑞) ⇔ 𝑝
(10 points)
103
Thank you…
Very Much…
Godbless..