Lesson 2.5 Logic
Lesson 2.5 Logic
Lesson 2.5 Logic
5
ELEMENTARY LOGIC
Objectives
At the end of the lesson, students are expected to be able to
1. Define a proposition in their own words;
2. Differentiate a proposition from not a proposition;
3. Enumerate, define, and describe the logical operators;
4. Symbolize compound statements;
5. Construct the truth table of a compound proposition;
Logic
Etymology. Logic comes from the classical Greek “logos,” meaning “word, thought,
idea, argument, account, reason or principle.” It is the study of the principles and criteria
of valid inference and demonstration.
Definition. It is the study of the methods and principles used to distinguish valid
from invalid reasoning. It is a science that aims to develop the reasoning power of man.
It is also the science of correct thinking.
Division of Logic
Traditional Logic. This is another name for Aristotelian logic. This may be
described as syllogistic logic, logic of classes, or logic of terms. It’s the logic of statements
that can be represented in terms of classes of things, and relationships between
those classes.
Propositional Logic. This is another name for Liebnizian logic. This is may be
described as modern logic, logic of statements, logic of proposition, or logic of sentences.
Specifically, propositional logic studies the ways of joining and/or modifying the entire
propositions to form more complex propositions.
Propositional Logic
Proposition. A declarative statement which is either true or false but not both.
Example 2.5.1
The first two sentences are propositions because they may either be true or false.
On the other hand, the rest of the sentences are not propositions because their truth
values cannot be determined. Further, the last statement is called an open sentence since
it involves a variable. An open sentence may only become a proposition when an element
of a set under consideration is substituted to the variable.
Practice Exercise
Identify the sentences that are considered propositions. Then tell if they are true
or false.
1. Today is Monday.
2. This book is expensive.
3. If a number is smaller than 0 then it is positive.
4. Fire your gun Man, fire!
5. La Trinidad is one of the 13 Municipalities of Benguet.
6. The earth is spherical in shape.
7. 2 -7 = -5.
8. 9+ 3 > 7 + 3.
9. He is the president of Benguet State University
10. Rosal is the national Philippine flower.
11. 15 – 3 = 10.
12. 8 > 6 + 2.
13. x + 6 = 10.
14. Blow your horns!
15. What makes you busy?
16. You should relax and move forward.
17. Tomorrow is a holiday.
Propositional Variable
Connectives/Logical Operators
Conjunction. The proposition P Q , read as " P and Q " is called the conjunction
of the simple propositions P and Q . This statement is true when both P and Q are true,
otherwise false. Moreover, P and Q are called conjuncts.
Aside from “and,” the following words indicate a conjunction of propositions: but,
however, moreover, nevertheless, whereas, while, despite, yet, furthermore, more so,
although, nonetheless.
Aside from “or,” the following words indicate a disjunction of propositions: either-
or, neither-nor, unless, or else.
Quality of a Proposition
Example 2.5.2
Symbolic
Compound Sentence
Representation
Today is Tuesday and my class ends at 12. T C
Today is Tuesday or Wednesday. T W
If today is Tuesday, then my class ends at 12. T →C
My class ends today if and only if today is Tuesday. C T
It is not the case that if today is Wednesday, my class ends at 12. (W → C )
If today is Wednesday, then my class does not end at 12. W → C
It is not the case that today is not Tuesday. ( T )
Generate the truth table of each compound proposition and determine its nature.
A. N → ( S S ) → N
N S N S S S N → ( S S ) N → ( S S ) → N
1 1 0 0 0 0 1
1 0 0 1 0 0 1
0 1 1 0 0 1 1
0 0 1 1 0 1 1
Hence N → ( S S ) → N is a tautology.
B. ( K J ) → J
K J (K J ) (K J ) → J
1 1 1 1
1 0 1 1
0 1 1 0
0 0 0 1
Hence (𝐾 ∨ 𝐽) → 𝐽 is a contingency.
C. R ( → R )
R →R ( → R) R ( → R)
1 1 1 0 0
1 0 0 1 0
0 1 1 0 0
0 0 1 0 0
Therefore, R ( → R ) is a contradiction.
Practice Exercise
Two propositions are logically equivalent if their truth tables have the same truth
values.
Example 2.5.4
1 1 1 0 1 1 1 1
1 1 0 0 0 1 1 1
1 0 1 0 1 1 1 1
1 0 0 0 1 1 1 1
0 1 1 1 1 1 1 1
0 1 0 1 0 0 1 0
0 0 1 1 1 1 0 1
0 0 0 1 1 1 0 1
Practice Exercises