Propositions

and
Symbols
At the end of the lesson, the students must be
able to:
 illustrate proposition;
 distinguish between simple and compound
proposition ;
 symbolize propositions; and
 perform the different types of operations on
propositions.
 “logos” = word, reason or principle
 Logic – science of correct reasoning.
! Systematized
! Evokes ORDER
 What does Logic put into order?
 What logic puts in order is the
way we reason out.

makes explicit the rules of

 Logic
reasoning.
is a declarative sentence that can be classified
as true or false, but not both.

There are other types of sentences where true

or false values cannot be assigned. The
sentence “This article is false” is one example. If
we assume that it is true, then it is false; if we
assume that it is false, then it is true. Thus, the
sentence cannot be classified as either true or
false, so it is not a proposition. A self-
contradictory proposition like this is called a
paradox.
Decide whether each of the following is a
proposition or is not a proposition.

a. Kalibo is the capital of Aklan.

b. Open your eyes.
c. The number 4 is even and less than 12.
d. Did SHS dominate this year’s U-Day?
a. proposition
b. not a proposition (a command)
c. proposition
d. Not a proposition ( a question)

Note: proposition 5 is a combination of two

components, “5 + 3 = 8” and “12 – 7 = 5.”
Proposition like this is called compound
proposition.
 Simple proposition – a proposition that
conveys one thought with no connecting
words.
 Compound proposition – contains two or
more simple propositions that are put
together using connective words.
 Conjunction
Two simple propositions connected using the
word and.
 Disjunction
Two simple propositions that are connected
using the word or.
 Conditional
Two simple propositions that are connected
using the words if ... then.
 Biconditional
Conjunction of two conditional statements
where the antecedent and consequent of the
first statement have been switched in the
second statement.
 Negation
The negation of a given statement is a
statement that is false whenever the given
statement is true, and true whenever the
given statement is false.
Classify each proposition as simple or
compound. Classify each compound
proposition as a negation, conjunction,
disjunction, conditional, or biconditional.
a. If it is an acute angle, then it is measures
less than 90°.
b. You are not entitled to a 30% discount.
c. Roel was on time, but Tom was late.
d. Mae is hungry or she wears red.
e. Eight is an even number.
a. compound; conditional
b. compound; negation
c. compound; conjunction
d. Compound; disjuction
e. simple
Symbols are used to simplify work in logic. The
table below shows the several symbols for
connectives, together with the respective types
of compound proposition.
  Let p represent the proposition “He has green
thumb” and
 q represent the proposition “He is a senior
citizen.”
 Convert each compound proposition into
symbols.

a. He does not have green thumb or he is not a

senior citizen.
b. It is not the case that he has green thumb or
is a senior citizen.
a.

b.
Thus, another solution to part (c) of Example 5
is "Robin cannot swim and Tom cannot play
the guitar."

Negation of the Conjunction p and q

~(p ∧ q) means ~p ∨ ~q
Thus, another solution to part (d) of Example
5 is "Robin cannot swim or Tom cannot
play the guitar."
Write the following in symbolic form:

a. “Arnold is a working student (w) or under 25

years old (u), and lives in Manila (l).”

b. “Arnold is a working student (w), or under

25 years old (u) and lives in Manila (l).”
The use of commas indicates which simple
statements are grouped together.

a. (w ∨ u) ∧ l

b. w ∨ (u ∧ l)
 Write the negation of each statement.

a. Some participants are more active than the

organizers.

b. All candidates will get the second chance.

a. No participants are more active than the
organizers.

b. Some candidates will not be given the

second chance; or Not all candidates will be
given the second chance.
Match each proposition in Column A to its
respective symbol in Column B.
A
B
 1. Conjunction a. ~
 2. Disjunction b. ↔
 3. Negation c. →
 4. Conditional d. ∧
 5. Biconditional e. ∨
 Classify each proposition as simple, compound,
or neither.
a. Stand straight when reciting the "Panatang
Makabayan."
b. It is false that February 14 is a holiday.
c. J. Honesto is not going to enroll next
semester.
d. If 2, and 4 are even numbers, then 2x4 is also
even.
At the end of the lesson, the students must be
able to determine the truth values of
proposition.
 CONNECTIVE SYMBOL TYPE OF STATEMENT
and ^ conjunction
or v disjunction
not ~ negation
If…then → conditional
If and only if (iff) ↔ biconditional
 The connective and implies the idea of “both.”
For the conjunction p ∧ q to be true, both p
and q must be true.
p q pq
T T T
T F F
F T F
F F F
Sample for Conjunctions
Let p: “7 > 5” and
q: “12 < 0.”
Find the truth value of p and q

The statement 7 > 5 is true. Hence, p is true.

The statement 12 < 0 is false. Hence, q is
false.
The second row of the conjunction truth
table shows that p ∧ q is false
If Rowan says that he has been reading or
writing, then he is telling the truth if he has
been reading and not writing. Likewise, he is
telling the truth when he has been writing and
not reading. Also, he is telling the truth when
he
has been reading and also writing. Table 2
shows
the truth table for disjunction. The use of or in
this case is called the inclusive or (inclusive
disjunction
p q pq
T T T
T F T
F T T
F F F
Let p be “I will clean the kitchen.” Let q be “I
will
clean the bathroom.” Form the inclusive
disjunction of p and q and discuss its truth
values.

Solution
The statement, “I will clean the kitchen or I
will clean the bathroom” is the required
disjunction. It will be false only if both
components are false and will be true
otherwise.
If P is a simple proposition, then P is either true
or false but not both. That is, if P is a true
statement, then its truth value is true and if P
is
false, then its truth value is false
p ~p
T F

F T
Construct a truth table of
a. ~(P ∧ Q) b. ~(P ∨ Q) c. ~(P ∧ ~Q)

Solution
a. ~(P ∧ Q)
P Q P∧Q ~(P ∧ Q)
T T T F
T F F T
F T F T
F F F T
b. ~(P ∨ Q)

P Q P∨Q ~(P ∨ Q)
T T T F
T F T F
F T T F
F F F T
c. ~(P ∧ ~Q)

P Q ~Q P∧ ~Q (P ∧ ~Q)
T T F F T
T F T T F
F T F F T
F F T F T
1 2 3 4 5
 Ifp, then q
 Symbols: p → q
 p is the antecedent, q is
the consequent
p q p→q
T T T
T F F
F T T
F F T
 Direct
statement p→q If p, then q

Converse q→p If q, then p

Inverse ~p → ~q If not p, then not q

Contrapositive ~q → ~p If not q, then not p

Direct statement and contrapositive are
equivalent:
p → q ≡ ~q → ~p

Converse and Inverse are equivalent:

q → p ≡ ~p → ~q
If p, then q p is sufficient for q

If p, q q is necessary for p

p implies q All p’s are q’s

p only if q q if p
 Find the truth value of each statement.
a. If 3 + 3 = 9, then 33 = 6.
b. If 3 + 3 = 6, then 12 = 7.
c. If 5 is a whole number, then 7 is a real
number.
a. Let P represent “3 + 3 = 9,” and Q represent
“33 = 6.” Since 3 + 3 = 9 is false and 33 = 6
is false, then P → Q is true.
b. Let P represent “3 + 3 = 6,” and Q represent
“12 = 7.” Since 3 + 3 = 6 is true and 12 = 7
is false, then P→Q is false.
c. Let P represent “5 is a whole number,” and Q
represent “7 is a real number.” Since
“5 is a whole number” is true and “7 is a real
number” is true, then P→Q is true
 True or False.
1. A conditional (→) is true in all cases except
when the antecedent is true and the
consequent is false.
2. A conjunction (∨) is only true when both
components are false.
3. A disjunction (∧) is true unless both
components are true.
4. A biconditional (↔) is true when both
components have the same truth value.
5. A negation (~) changes the value of the
statement to its opposite.
Construct a truth table for each statement.
1. ~(P ∨ Q) 6. P ∨ Q ~Q
2. ~(~P ∧ ~Q) 7. ~P ∧ ~Q ~(P ∧ Q)
3. P ∧ ~Q 8. P Q ∧ R
4. ~P ∨ ~Q 9. (P ∨ ~Q) (P Q)
5. Q ∨ (~P ∧ Q) 10. (P ~Q) ∨ (~P ∨ Q)