Propositional

Logic
Algorithms:
 Propositional variables

 Consider the statement: ''John's age is

13.'' This is a proposition as it could be
either true or false but not both. Let us
denote this sentence by ''P''. Consider
another statement: ''3+2=5.'' This as we
know by general rules of arithmetic, is
always true. Let us denote this by ''Q‘’.

P: John's age is 13 years.

Q: 3+2=5.

P and Q are known as propositional

variables.
 “
Did you know that there are
four different types of
sentences and that these
sentences help us to define
propositional logic?

3 Presentation title
”
20XX
1.Declarative 2.Exclamatory 3.Interrogative 4.Imperative sentences
sentences or declare sentences are sentences ask give commands, such as
something, like emotional expressions, questions, like “what “turn right at the traffic
such as “watch out!” time is it?” light.”
“Richmond is the
capital of Virginia.”

DECLARATIVE EXCLAMATORY INTERROGATIVE IMPERATIVE

4 Presentation title 20XX

 Propositions
Because propositions, also called
statements, are declarative
sentences that are either true or
false, but not both. This means that
every proposition is either true (T) or
false (F).

5 Presentation title 20XX

Examples Let’s look at a few
examples of how we determine the type of
sentence illustrated, and if it is a proposition,
we will identify its truth value.

6 Presentation title 20XX

 PROPOSITION

Simple Proposition Compound Proposition

a proposition is simple if it cannot is a proposition form form simplier
be broken down any further into propositions using logical
other component propositions. connectors (not, and, or, if, & then)

7 Presentation title 20XX

8 Presentation title 20XX
 SIMPLE PROPOSITION

1. p: Visayas is an island in the Philippines.

Answer: p is a TRUE proposition.
2. q: Find a number which divides your age.
Answer: q is NOT a proposition. (It is an imperative sentence)
5. t: 3 + 2 = 5
Answer: t is a TRUE proposition. (The sum of 3 and 2 is really 5)

9 Presentation title 20XX

 COMPOUND PROPOSITION

8.w: Either logic is fun and interesting or it is boring.

Answer: w is a TRUE proposition.

9.x: If you are a Grade 11 student, then you are a Filipino.

Answer: x is a FALSE proposition. (Not all Grade 11 students are Filipino)

10 Presentation title 20XX

Thank you
 Logical Connectives
• A connector by its general definition means anything that can connect two entities. When we are talking of
connectors with respect to propositional logic, it can be thought of as something which connects two logic.
• Logical Connectives connect two or more propositions. There are six basic logical connectives. Consider two
propositions as P and Q. We define these six logical connectives as:

12 Presentation title 20XX

 Negation Of A Statement
What is extremely important to emphasize and point out is that the negation of a statement
will always have the opposite truth value compared with the original statement.
For example, let’s suppose we have the statement, “Rome is the capital of Italy.” This is a
true propositional statement. Therefore, the negation of this statement, “Rome is not the
capital of Italy,” must be false.
Discrete Math Truth Tables
With compound statements, the ability to determine its truth value can be a little more
complicated.
Thankfully, a truth table is a fantastic way to determine the truth or falsehood of a
compound statement based on its components’ truth values.

13 Presentation title 20XX

er is 8.

14 Presentation title 20XX

 Now the lexicographic ordering is a pattern that helps us to put values in order to make it
easier to compare. To help us understand the importance of order, let’s start with an
example. Assume you have a fair coin, and you flip it twice. This means that you can get the
following results:
Heads-Heads
Heads-Tails
Tails-Heads
Tails-Tails
This gives us four possibilities.
Therefore, we must account for all possible scenarios when we construct our tables to help
keep our options straight and organized (so we never forget anything) — we follow this
simple pattern.

15 Presentation title 20XX

 Example
Now let’s see a truth table in action.
Suppose we let:
p represent the statement, “make supper”
q represent “make dessert”
What is the truth value of “I will make you supper, and I will make your
dessert.”
Now the fact of the matter is that people are notorious for making a
promise that they don’t always keep. Yes, it’s sad but true. Therefore, our
truth table must account for all possible scenarios.

16 Presentation title 20XX

 Truth Tables Conjunction

Notice that for an “and” statement, we will only have a “true” value when
both p and q are both true

17 Presentation title 20XX

Now, using the same propositional statements, let’s now suppose we want to find the truth
value for “I will make you supper, or I will make your dessert.”
This means that for an “or” statement, we will only get a “false” value when p and q are both
false.

Logical Disjunction

18 Presentation title 20XX

 How To Construct Truth Tables?
We follow the 2 to the n rule and the lexicographic ordering.
The 2-n rule says that if we have n number of unique
variables, then the number of rows in the table will be 2 to
the nth power. For example, if we have two individual
variables, then there will be four rows because 2 to the
second power is 4, and if there are three unique variables,
then there will be eight rows because 2 to the 3rd power is 8.

19 Presentation title 20XX