GENERAL MATHEMATICS

QUARTER 2 – Week 7

PROPOSITIONS AND
LOGICAL OPERATORS
Lesson 1: PROPOSITIONS

1. Declarative Sentence
- makes a statement of fact and gives information that generally ends with a full-
stop/period.

2. Imperative Sentence
- gives a command telling someone to do something or states a direction or request.

3. Interrogative Sentence
- asks a question of something or some information and always ends with a question
mark.

4. Exclamatory Sentence
- expresses strong emotions and ends with an exclamation point.
Lesson 1: PROPOSITIONS

Definition
 A proposition is a declarative sentence that is immediately
decidable whether it is true or false, but not both.

 A proposition
is usually denoted by variables or small letters. The
most common variables used are p, q, and r.
 Ifa proposition is true, then its truth value is true, which is denoted
by T; otherwise, if its truth value is false, denoted by F.
Lesson 1: PROPOSITIONS

Examples:
p: How is your online class?
q: 5 is a prime number.
r: Go and accomplish your module activities.
s: 3x + 2 = 8.
Lesson 1: PROPOSITIONS

Two types of propositions:

1. Simple proposition
- a proposition that conveys one thought with no connecting words.

2. Compound proposition
- contains two or more simple propositions that are put together using
connective words.
Logical Connectives: and, or, nor, if-then and if and only if
Lesson 1: PROPOSITIONS
Examples:
Simple Propositions
m: 8 is a perfect cube.
n: A square is a rectangle.
Propositions
p
q
Compound Propositions
p: 64 is both a perfect square and a
perfect cube.
q: Either logic is fun and
interesting, or it is boring.
Primitive Components
.
Lesson 2: LOGICAL OPERATORS

Definition:
- A truth table shows all possible truth values of a given proposition.

Truth Table of p

p - The truth table is used to define logical operators.

- the truth table is used to exhibit the relationship between its
T simple components' truth values and the given compound
propositions' truth values

F A truth table involving n propositions has rows.

 Lesson 2: LOGICAL OPERATORS

Examples:
1. Suppose p and q are propositions 2. Suppose p, q and r, are propositions
number of rows: = number of rows: =
p q p q r
T T T
T T T T F
T F T
T F T F F

F T F
F
T
T
T
F
F F F F T
F F F
Lesson 2: LOGICAL OPERATORS

A. Negation
B. Conjunction
C. Disjunction
D. Conditional
E. Bi-conditional
Lesson 2: LOGICAL OPERATORS

A. Negation - is the simplest logical operator.

The negation of the proposition p is denoted by ~p (read as “not p”) and is defined
through its truth table
Truth Table
p ~p
- The truth table tells us that when p is true, its negation, ~𝑝, is false. On
the other hand, when p is false, the negation, ~𝑝 is true.
T F
F T
 Lesson 2: LOGICAL OPERATORS

B. Conjunction - allows us to state an expression for two propositions to be true.

The conjunction of the propositions p and q, called conjuncts, is denoted by p ˄ q (read
as “p and q”) and is defined through its truth table
Truth Table
p q p^q

T T T The conjunction p ˄ q is true only when both

conjuncts p and q are true.
T F F
F T F
F F F
 Lesson 2: LOGICAL OPERATORS

C. Disjunction - allows us to express alternatives.

The disjunction of the propositions p and q, called disjuncts, is denoted by p ˅ q (read
as “p or q”) and is defined through its truth table
Truth Table
p q pvq

T T T the disjunction p ˅ q is false only when both disjuncts

p and q are false.
T F T
F T T
F F F
 Lesson 2: LOGICAL OPERATORS

D. Conditional
The conditional of the propositions p and q is denoted by p → q (read as “If p, then q”)
and is defined through its truth table
Truth Table
p q p→q

T T T The conditional p → q may also be read as “p implies

q.” The proposition p is the hypothesis, while the
T F F proposition q is the conclusion.
F T T
F F T
 Lesson 2: LOGICAL OPERATORS

E. Bi-conditional - it is derived from two conditional propositions.

The bi-conditional of the propositions p and q is denoted by p ↔ q (read as “p if and
only if q”) and is defined through its truth table
Truth Table
p q p↔q

T T T The proposition may also be written as “p iff q.” The bi-

conditional's truth table tells us that its truth value is true when
T F F the truth values of p and q are the same.
F T F
F F T