Scribd
Upload
16 views3 pages

WEEK8DAY1

Uploaded by

Aliki Mae Guardiano
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views3 pages

WEEK8DAY1

Uploaded by

Aliki Mae Guardiano
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

GENERAL MATHEMATICS

WEEK 8: LESSON 1
Truth Values of Propositions

MELC: The learner determines the truth values of propositions.

OBJECTIVES:
1. construct truth tables of propositions;
2. determine the truth values of propositions; and
3. distinguish the proposition as tautology or contradiction.

Directions: Complete the following truth tables of logical operators.

A. TRUTH VALUES OF PROPOSITIONS


Every proposition has two possible truth values. That is, the truth value of a proposition, be it
simple or compound, is either true or false. The TRUTH VALUE, therefore, refers to the
truthfulness of a proposition that may either be true or false. These can be represented in tabular
form. The table that shows the complete possible truth values of a proposition is called TRUTH
TABLE.
A proposition p has the Suppose we are given two It follows therefore that if there
following truth table: propositions p and q. Since are three propositions p, q and
there are four possible r for example, their truth table
combinations of truth values is:
(TT, TF, FT, FF), then their
truth table.
Example1: Let p and q be propositions. Construct the truth table for the compound proposition
(p→q) ⋀ (q→p).

p q 𝑝→𝑞 𝑞→𝑝 (𝑝 → 𝑞) ⋀ (𝑞 → 𝑝)
T T T T T
T F F T F
F T T F F
F F T T T

Example 2: Consider the compound proposition [(𝑝 → 𝑟) ⋀ (𝑞 → 𝑟)] → [(𝑝 ⋁ 𝑞) → 𝑟]. Construct its
truth table.
p q r 𝑝→𝑟 𝑞 → 𝑟 (𝑝 → 𝑟) ⋀ (𝑞 → 𝑟) 𝑝 ⋁ 𝑞 (𝑝 ∨ 𝑞) → 𝑟 S
T T T T T T T T T
T T F F F F T F T
T F T T T T T T T
T F F F T F T F T
F T T T T T T T T
F T F T F F T F T
F F T T T T F T T
F F F T T T F T T

Note that regardless of the truth values of p, q, and r, propositions are always true. Such
propositions are called tautologies.
Definition. A proposition that is always true is called tautology, while a proposition that is always
false is called contradiction. We denote tautologies by τ and contradiction by ϕ.

EXAMPLE 3: Let p and q be propositions. Using truth tables, show the following:
a. 𝑝 ∨ 𝜏 is a tautology.
b. 𝑝 ∧ 𝜙 is a contradiction.
c. 𝑝 → ((𝑝 ∨ 𝑞) is a tautology.
d. (𝑝 ⋀ (~𝑞))⋀ (𝑝 ∧ 𝑞) is a contradiction

Solution:

a. 𝒑 ∨ 𝝉 is a tautology.
Note that τ is always true. Hence in the disjunction p∨τ, there is at least one true disjunct.
Therefore, p∨τ is a tautology since regardless of the truth value of p, p∨τ is true.
𝑝 𝜏 𝑝∨𝜏
T T T
F T T

b. 𝒑 ∧ 𝝓 is a contradiction.
Since 𝜙 is always false, then the second column of the truth table we will be constructing will
contain Fs. We have the following truth table. Regardless of the truth of p, p∧ϕ is always false.
Hence, it is a contradiction.
𝑝 𝜙 𝑝∧𝜙
T F F
F F F

c. 𝒑 → ((𝒑 ∨ 𝒒) is a tautology.
We have the following truth table. Regardless of the truth values of p and q p→((p ∨q) is always
true, so it is a tautology.
p q 𝑝 ∨𝑞 𝑝 → ((𝑝 ∨ 𝑞)
T T T T
T F T T
F T T T
F F F T

d. (𝒑 ⋀ (~𝒒))⋀ (𝒑 ∧ 𝒒) is a contradiction
We have the following truth tables. We note that (p∧(∼q) )⋀ (p∧q) is false for any combination of
truth values of p and q. Therefore, (p∧(∼q) )⋀ (p∧q) is a contradiction.

p q ∼𝑞 𝑝 ∧ (∼ 𝑞) 𝑝∧𝑞 (𝑝 ∧ (∼ 𝑞) )⋀ (𝑝 ∧ 𝑞)
T T F F T F
T F T T F F
F T F F F F
F F T F F F

Seatwork:

Directions: Answer the following.

A. Construct the truth table for the following compound propositions. Assume all variables
denote propositions.
1. ~𝑝 ∧ (𝑞 ∧ ~𝑟)
2. 𝑝 ∧ [(𝑞 ∨ ~𝑝) ∧ ~𝑞]

B. Show that the following statements are tautologies by constructing the truth table for
each.
1. (𝑝 → 𝑞) → (~𝑝 ∨ 𝑞)
2. 𝑝 → [𝑞 ↔ (𝑝 ∧ 𝑞)]

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy