Reasoning and

Sense Making
Module 3
 Learning Outcomes
At the end of the lesson, you should be able to:
q Discuss the vocabulary, syntax and semantics of
propositional logic
q Interpret formulas and sentences of symbolic logic in
Mathematical structures
q Manipulate Mathematical statements to produce logically
valid, correct and clear arguments
q Gain an understanding of the basic concepts of categorical
propositions, its types and categorical syllogisms
 Learning Outcomes (continued)

q Interpret formulas and sentences of predicate logic in

Mathematical structures
q Assess arguments for validity
q Apply the concept of truth tables, rules of inference and
logical equivalence
q Show the ability to use the correct reasoning and accurate
use of Mathematical language
 Basic
Topic Outline
01 Concepts and
Definitions

Logical
Connectives 02

03 Truth Tables

Logical
Equivalence and
Inference
04
Negation
● Represented by ~
● The word “no” or “not” is usually present to indicate
negation

p ~p
T F
F T
 Conjunction
● Represented by ˄
Words used to represent conjunction:
p˄q
●
p q
Ø p and q Ø p still q
T T T
Ø p moreover q Ø p however q
T F F
Ø p although q Ø p also q
Ø p yet q F T F
Ø p but q
F F F
n
Combinations in the table: 2
 Disjunction

● Represented by ˅ p q p˅q
● Words used to represent disjunction: T T T
Ø p or q T F T
Ø p unless q F T T
F F F
 Conditional Statement
● Represented by →
● Also known as implication
● Parts of the conditional statement p q p→q
Ø p – hypothesis – antecedent – usually follows T T T
‘if’
T F F
Ø q – conclusion – consequent – usually follows
then F T T
● Words used to represent conditional statement: F F T
Ø If p then q
Ø p implies q
 Biconditional Statement

● Represented by ↔ p q p q
Formed by combining two conditional ↔
●
T T T
statements p → q and q → p under a
T F F
conjunction
F T F
● Word used to represent biconditional
F F T
statement:
Ø p if and only if q
Logical Connectives Summary
Negation ~
Conjunction ˄ T - True
Disjunction v
Conditional → F - False
Biconditional ↔
~p p^q pvq p→q p↔q
p q
Negation Conjunction Disjunction Conditional Biconditional
T T F T T T T
T F F T F F
F T F T T F
F F T F F T T
Logical Connectives Summary
Negation ~
Conjunction ˄ T - True
Disjunction v
Conditional → F - False
Biconditional ↔
~p p^q pvq p→q p↔q
p q
Negation Conjunction Disjunction Conditional Biconditional
T T F T T T T
T F F T F F
F T F T T F
F F T F F T T
 Truth Tables and Truth Value
Number of
Example ~(p˄q)→(~p ˅~q) combinations in the
truth table: 2 n = 2 2 = 4 / 2 = 2
1. p˄q 4. ~q Where n is the number of sentences
2. ~(p˄q) 5.~p ˅ ~q 2 / 2 = 1
3. ~p 6. ~(p˄q)→(~p ˅~q)

p q

T T
T F
F T
F F
 Truth Tables and Truth Value
Number of
Example ~(p˄q)→(~p ˅~q) combinations in the
truth table: 2 n = 2 2 = 4 / 2 = 2
1. p˄q 4. ~q
2. ~(p˄q) 5.~p ˅ ~q 2 / 2 = 1
3. ~p 6. ~(p˄q)→(~p ˅~q)

p q p˄q

T T T
T F F
F T F
F F F
 Truth Tables and Truth Value
Number of
Example ~(p˄q)→(~p ˅~q) combinations in the
truth table: 2 n = 2 2 = 4 / 2 = 2
1. p˄q 4. ~q
2. ~(p˄q) 5.~p ˅ ~q 2 / 2 = 1
3. ~p 6. ~(p˄q)→(~p ˅~q)

p q p˄q ~(p ˄ q)

T T T F
T F F T
F T F T
F F F T
 Truth Tables and Truth Value
Number of
Example ~(p˄q)→(~p ˅~q) combinations in the
truth table: 2 n = 2 2 = 4 / 2 = 2
1. p˄q 4. ~q
2. ~(p˄q) 5.~p ˅ ~q 2 / 2 = 1
3. ~p 6. ~(p˄q)→(~p ˅~q)

p q p˄q ~(p ˄ q) ~p

T T T F F
T F F T F
F T F T T
F F F T T
 Truth Tables and Truth Value
Number of
Example ~(p˄q)→(~p ˅~q) combinations in the
truth table: 2 n = 2 2 = 4 / 2 = 2
1. p˄q 4. ~q
2. ~(p˄q) 5.~p ˅ ~q 2 / 2 = 1
3. ~p 6. ~(p˄q)→(~p ˅~q)

p q p˄q ~(p ˄ q) ~p ~q

T T T F F F
T F F T F T
F T F T T F
F F F T T T
 Truth Tables and Truth Value
Number of
Example ~(p˄q)→(~p ˅~q) combinations in the
truth table: 2 n = 2 2 = 4 / 2 = 2
1. p˄q 4. ~q
2. ~(p˄q) 5.~p ˅ ~q 2 / 2 = 1
3. ~p 6. ~(p˄q)→(~p ˅~q)

p q p˄q ~(p ˄ q) ~p ~q ~p ˅~q

T T T F F F F
T F F T F T T
F T F T T F T
F F F T T T T
 Truth Tables and Truth Value
Number of
Example ~(p˄q)→(~p ˅~q) combinations in the
truth table: 2 n = 2 2 = 4 / 2 = 2
1. p˄q 4. ~q
2. ~(p˄q) 5.~p ˅ ~q 2 / 2 = 1
3. ~p 6. ~(p˄q)→(~p ˅~q)

p q p˄q ~(p ˄ q) ~p ~q ~p ˅~q ~(p˄q)→(~p ˅~q)

T T T F F F F T
T F F T F T T T
F T F T T F T T
F F F T T T T T
 Truth Tables and Truth Value
Number of
Example ~(p˄q)→(~p ˅~q) combinations in the
truth table: 2 n = 2 2 = 4 / 2 = 2
1. p˄q 4. ~q
2. ~(p˄q) 5.~p ˅ ~q 2 / 2 = 1
3. ~p 6. ~(p˄q)→(~p ˅~q)

p q p˄q ~(p ˄ q) ~p ~q ~p ˅~q ~(p˄q)→(~p ˅~q)

T T T F F F F T
T F F T F T T T
F T F T T F T T
F F F T T T T T
 Truth Tables and Truth Value
Example (p˄q) ˅(~q ˄ r) p q r
1. p˄q
2. ~q T T T
3. ~q ˄ r T T F
4. (p˄q) ˅(~q ˄ r) T F T
Number of T F F
combinations in the
n F T T
truth table: 2 = 2 3 = 8 / 2 = 4
Where n is the number of sentences 4 / 2 = 2 F T F
2 / 2 = 1 F F T
F F F
 Truth Tables and Truth Value
Example (p˄q) ˅(~q ˄ r) p q r p˄q
1. p˄q
2. ~q T T T T
3. ~q ˄ r T T F T
4. (p˄q) ˅(~q ˄ r) T F T F
Number of T F F F
combinations in the
n F T T F
truth table: 2 = 2 3 = 8 / 2 = 4
4 / 2 = 2 F T F F
2 / 2 = 1 F F T F
F F F F
 Truth Tables and Truth Value
Example (p˄q) ˅(~q ˄ r) p q r p˄q ~q
1. p˄q
2. ~q T T T T F
3. ~q ˄ r T T F T F
4. (p˄q) ˅(~q ˄ r) T F T F T
Number of T F F F T
combinations in the
n F T T F F
truth table: 2 = 2 3 = 8 / 2 = 4
4 / 2 = 2 F T F F F
2 / 2 = 1 F F T F T
F F F F T
 Truth Tables and Truth Value
Example (p˄q) ˅(~q ˄ r) p q r p˄q ~q ~q ˄ r
1. p˄q
2. ~q T T T T F F
3. ~q ˄ r T T F T F F
4. (p˄q) ˅(~q ˄ r) T F T F T T
Number of T F F F T F
combinations in the
n F T T F F F
truth table: 2 = 2 3 = 8 / 2 = 4
4 / 2 = 2 F T F F F F
2 / 2 = 1 F F T F T T
F F F F T F
 Truth Tables and Truth Value
Example (p˄q) ˅(~q ˄ r) p q r p˄q ~q ~q ˄ r (p˄q) ˅(~q ˄ r)
1. p˄q
2. ~q T T T T F F T
3. ~q ˄ r T T F T F F T
4. (p˄q) ˅(~q ˄ r) T F T F T T T
Number of T F F F T F F
combinations in the
n F T T F F F F
truth table: 2 = 2 3 = 8 / 2 = 4
4 / 2 = 2 F T F F F F F
2 / 2 = 1 F F T F T T T
F F F F T F F
 Truth Tables and Truth Value
Example (p˄q) ˅(~q ˄ r) p q r p˄q ~q ~q ˄ r (p˄q) ˅(~q ˄ r)
1. p˄q
2. ~q T T T T F F T
3. ~q ˄ r T T F T F F T
4. (p˄q) ˅(~q ˄ r) T F T F T T T
Number of T F F F T F F
combinations in the
n F T T F F F F
truth table: 2 = 2 3 = 8 / 2 = 4
4 / 2 = 2 F T F F F F F
2 / 2 = 1 F F T F T T T
F F F F T F F
 Tautology, Contradiction, Contingency
Given the truth value of the main operation (main logical connective) in
the truth table, the following are some notable concepts:
Ø Tautology: A compound proposition is a tautology if it is true for all truth value
assignments of the involved simple propositions
All the values under the main operation column is TRUE
Ø Contradiction: A compound proposition is a contradiction if it is false for all
truth value assignments of the involved simple propositions
All the values under the main operation column is FALSE
Ø Contingency: It is neither a tautology nor a contradiction
The values under the main operation column is a mixture of TRUE
and FALSE
 Tautology, Contradiction, Contingency – Example
Example 1 ~(p˄q)→(~p ˅~q)

p q p˄q ~(p ˄ q) ~p ~q ~p ˅~q ~(p˄q)→(~p ˅~q)

T T T F F F F T
T F F T F T T T
F T F T T F T T
F F F T T T T T

TAUTOLOGY
ALL TRUE
 Truth Tables and Truth Value
Example (p˄q) ˅(~q ˄ r) p q r p˄q ~q ~q ˄ r (p˄q) ˅(~q ˄ r)
1. p˄q
2. ~q T T T T F F T
3. ~q ˄ r T T F T F F T
4. (p˄q) ˅(~q ˄ r) T F T F T T T
T F F F T F F
F T T F F F F
F T F F F F F
CONTINGENCY
MIXTURE OF TRUE AND FALSE
F F T F T T T
F F F F T F F
 Tautology, Contradiction, Contingency – Example
Given the truth value of the main operation (main logical connective) in
the truth table, the following are some notable concepts:
Ø Tautology: A compound proposition is a tautology if it is true for all truth value
assignments of the involved simple propositions
All the values under the main operation column is TRUE
Ø Contradiction: A compound proposition is a contradiction if it is false for all
truth value assignments of the involved simple propositions
All the values under the main operation column is FALSE
Ø Contingency: It is neither a tautology nor a contradiction
The values under the main operation column is a mixture of
TRUE and FALSE
 Basic
Topic Outline
01 Concepts and
Definitions

Logical
Connectives 02

03 Truth Tables

Logical
Equivalence and
Inference
04
THANKS!