2 Timothy 3:16-17

“All Scripture is God-breathed and is useful for teaching,

rebuking, correcting and training in righteousness, so that
the servant of God may be thoroughly equipped for every
good work.”
 MMW Module 2
FUNDAMENTALS OF LOGIC
Objectives

At the end of the session, the students should be able to review logical
statements and logical connectives, construct compound propositions and
truth tables
1. Identify propositions;
2. Apply negations, conjunctions, disjunctions, conditional, and
biconditional statements of propositions
3. Write the converse, inverse, and contrapositive
4. Determine and construct truth tables.
 Gottfried Wilhelm Leibniz (1646–1716) - One of the first
mathematicians to make a serious study of symbolic logic.
Augustus De Morgan (1806 – 1871) and George Boole
(1815 – 1864), contributed to the advancement of symbolic
logic as a mathematical discipline.

Boole published The Mathematical Analysis of Logic in

1848 and An Investigation of the Laws of Thought.
Statements
Every language contains different types of sentences,
such as statements, questions, and commands.
For instance:
“Is the test today?” is a question.
“Go get the newspaper” is a command.
“This is a nice car” is an opinion.
“Manila is the capital city of the Philippines.” is a
statement of fact.
PROPOSITIONS OR STATEMENTS
- A statement is a declarative sentence that is either true or
false, but not both true and false.
EXAMPLE: Determine whether each sentence is a statement.
1. 9 is a prime number.
2. x+4=0
3. 10 < – 3
4. How are you?
Simple Statements and Compound Statements
A simple statement is a statement that conveys a
single idea.

A compound statement is a statement that

conveys two or more ideas.
 Connecting simple statements with words and
phrases such as and, or, if ... then, and if and only if
creates a compound statement .
For instance:
1. “I will attend the meeting or I will go to school.”
2. “I will attend the meeting and I will go to school.”
 Negation
A statement is a negation of another if the word
is not introduced in the negation statement.

Example:
“Today is Friday.” is the statement.
“Today is not Friday.” is the negation.
Write the negation of each statement.
1. I am enrolled to distance education.
2. I am going to attend the synchronous discussion.
Conjunction
If two statements are joined using the word “and”.

Example:
Today is Monday and the internet connection is
stable.
Disjunction
If two statements are joined using the word
“or”.
Example:
Today is Monday or the internet connection is
stable.
Conditional Statements
It is represented by “if p, then q” or by “if p, q,” the
p statement is called the antecedent and the q statement
is called the consequent.
Example:
If n is a prime number greater than 2, then n is an odd
number.
Antecedent: n is a prime number greater than 2
Consequent: n is an odd number
 Conditional statements can be written in if p, then q form
or in if p, q form.
Other forms of conditional statements:
Biconditional Statements
It is represented by “P if and only if q” or “P is
necessary and sufficient for q”

Example:
x > 7 if and only if x > 6
Connectives and Symbols

George Boole used symbols such as p, q, r, and s to

represent simple statements
The symbols ∨ for “or”, ∧ for “and”, → for
if.., then… and ↔ for if and only if.
Logical Connectives and Symbols
Type of Statement Connective Symbolic
Statement Form
Negation not p not ¬p
Conjunction p and q and p∧q
Disjunction p or q or p, ∨ q
Conditional If p, then q. If …, then… p→q
Biconditional p if and only if q if and only if p↔q
 Example:
Consider the following simple statements.
p: I will observe proper dress code.
q: I will be tactful by being mindful of my language.
r: I will take full responsibility for my actions in any engagement.
Write the compound statements in symbolic form.
1. I will be tactful by being mindful of my language and take full responsibility for
my actions in any engagement.
2. I will observe proper dress code or be tactful by being mindful of my language.
3. I will take full responsibility for my actions in any engagement if and only if I will
observe proper dress code.
4. If I will not be tactful by being mindful of my language, then I will not take full
responsibility for my actions in any engagement.
Consider the following simple statements.
p: I will observe proper dress code.
q: I will be tactful by being mindful of my language.
r: I will take full responsibility for my actions in any engagement.
Write the compound statements in statement form.
1. (p ∧ q) ∨ r
2. p → q
3. p’ ↔ q’
4. (p ∨ q) → r
Statement Related to the Conditional Statement.

1. The converse of p → q is q → p.

2. The inverse of p → q is p’ → q’.

3. The contrapositive of p → q is q’ → p’.

 Write the converse, inverse and contrapositive of:

If we have a quiz today, then we will not have a quiz tomorrow.

Converse: If we are not going to have a quiz tomorrow, then we will

have a quiz today.
Inverse: If we don’t have a quiz today, then we will have a quiz
tomorrow.
Contrapositive: If we have a quiz tomorrow, then we will not have a
quiz today.
■ Write the a. converse, b. inverse, and c. contrapositive
Conditional Statement: If we had an internet connection,
then we would be able to take the quiz.
Truth Value and Truth Tables
Truth value of a simple statement is either true
(T) or false (F).
Truth value of a compound statement depends on
the truth values of its simple statements and its
connectives.
Truth table is a table that shows the truth value of
a compound statement for all possible truth values of
its simple statements.
Construction of Truth Tables
1. If the given statement has n simple statements, then start
n
with a standard form that has 2 rows. Enter the truth values for
each simple statement and their negations.
2. Use the truth values for each simple statement and their
negations to enter the truth values under each connective within
a pair of grouping symbols—parentheses ( ), brackets [ ],
braces { }. If some grouping symbols are nested inside other
grouping symbols, then work from the inside out.
 Construction of Truth Tables
3. First assign truth values to negations from left to right,
followed by conjunctions from left to right, followed by
disjunctions from left to right, followed by conditionals
from left to right, and finally by biconditionals from left to
right.
4. The truth values that are entered into the column under the
connective for which truth values are assigned last form
the truth table for the given statement.
 Truth table for ~p

•If the statement p is true, p ~p

the negation of p, ~p is
T F
false.
•If the statement p is false, F T
then ~p is true.
 Truth table for p ∧ q

•For p ∧ q to be true, then p q p∧q

both statements p, q, must
be true. T T T
•If either statement or if T F F
both statements are false,
then the conjunction is F T F
false. F F F
 Truth table for p v q
p q pvq
•For a disjunction to be
true, at least one of the T T T
statements must be true. T F T
•A disjunction is only
F T T
false, if both statements
are false. F F F
 Determine whether each statement is true or false.
1. 7 > 5.

1. 5 is a whole number and 5 is an even number.

1. 2 is a prime number and 2 is an even number.

Determine the truth 1. (p ∧ q) ∨ (p’ ∨ q’)
value of the
compound statement
given that p is a false
statement, q is a true 2. [(p ∧ q’)’ ∨ r] ∧ (p ∨ r’)
statement, and r is a
true statement.
a. Construct a table for (p’∧ q)’ ∨ q.
b. Use the truth table to determine the truth value of
(p’∧ q)’ ∨ q, given that p is true and q is false.
•Conditional statement of the form Truth table for p → q
“if p then q”.
•If I don’t keep my promise, in other p q p→q
words q is false, then the conditional is
false if the premise is true.
T T T
•If I keep my promise, that is q is true,
and the premise is true, then the
conditional is true. T F F
•When the premise is false (i.e. p is
false), then there was no promise. F T T
Hence by default the conditional is
true. F F T
 Determine the truth value of each of the following.
1. If 2 is an integer, then 2 is a rational number.
2. If 3 is a negative number, then 5 > 7.
3. If 5 > 3, then 2 + 7 = 4.
•Biconditional statement of the Truth table for p ↔ q
form “p if and only if q”.
p q p↔q
- Biconditional statement is true if
both statements p and q have the T T T
same truth value.
T F F
F T F
F F T
State whether each biconditional is true or false.
a. x + 4 = 7 if and only if x = 3.
2
b. x = 36 if and only if x = 6.
Truth Table

p q ~p p∧q p∨q p→q p↔q

T T F T T T T
T F F F T F F
F T T F T T F
F F T F F T T
 Determine the truth value of the statement given that p is
true, q is false, and r is false.

1. (p ∧ q) → (p’ ↔ q)

2. (p ∨ q’) ↔ (r’∧ q)’

Construct the truth table of the compound proposition (p ∨ ¬q) → (p ∧
q).
The Truth Table of (p∨¬q) → (p∧q).
p q ¬q p ∨ ¬q p∧q (p ∨ ¬q) → (p ∧ q)
T T F T T T
T F T T F F
F T F F F T
F F T T F F
Construct a truth
table for each p q q’ p → q (p → q) ∨ q’
statement.

T T F T T
1. (p → q) ∨
q’ T F T F T
2. p ↔ (r’∧ q) F T F T T
F F T T T
p ↔ (r’∧ q)
p q r r’ r’∧ q p ↔(r’∧ q)
T T T F
T T F T
T F T F
T F F T
F T T F
F T F T
F F T F
F F F T
Thank you.