TAGBILARAN CITY COLLEGE

College of Business and Industry

Tagbilaran City, Bohol

Course Code GE4 Instructors Abegail P. Galigao, MAT-Math

Course Title Math in the Modern Email

World

Course Credits 3 Contact Numbers

Course General Education Consultation

Classification Course Hours

Pre-Requisite(s) Consultation Online (MS Teams)/ Faculty

Venue Room

Logic
3 Learning Module

Duration of Delivery : February 16 – 22, 2024

Due Date of Deliverables : February 22, 2024

Intended Learning Outcomes:

 Write compound propositions using logical connectives;
 Construct a truth table for a given compound statement; and
 Use truth table for logical equivalence.

Introduction

In everyday life, reasoning proves different points. For instance, to prove a service
provider that you had paid your bills on time, you can show the official receipt of the payment. To
prove an airline that you have booked for a flight, you can show your online reservation or your
ticket. Similarly, mathematics use logic to prove results. In particular, mathematical logic is used
in mathematics to prove a theorem or a statement.

Concept Notes
Logic – the science of reasoning
o Proposition– statement which can be regarded as true or false (truth value), and are
denoted by small letters (most use letters p,q,r,s, and t but other letters will also do)
o Simple proposition – single statement which does not contain other statements as parts
o Compound proposition – contains two or more statements
- can be a tautology, a contradiction or an absurdity, or a
contingency
a) Tautology – propositional form which is always true for all possible values of its
propositional variables
b) Contradiction/ absurdity – propositional form which is always false for all possible
values of its propositional variables
c) Contingency – propositional form which is neither a tautology nor a contradiction
o Argument – consists of a sequence of statements called premises, followed by a final
statement called the conclusion
o Valid Arguments – when the conclusions are all true

Look at the table to understand more about propositions.

Sentence Truth Proposition Not a

Value proposition
Dynamite is dangerous. True 
Elephants have wings False 
How are you? ? 
Study your lessons well. ? 
Five is less than 10. True 

o Logical connective – combines simple statements into compound statements.

The following table shows some basic propositional logic with their symbols.
Propositional Logical Symbols Example How to Read
Logic Connectives (implication)
Negation Not ~ ~𝑝 Not p (p is false)
Conjunction And/but ˄ 𝑝˄𝑞 p and q (both p and q are true)
Disjunction Or ˅ 𝑝˅q p or q (either p is true or q is
true or both are true)
Exclusive-or ⊕ 𝑝 ⊕q (when exactly one of p and q
is true and is false otherwise)
NAND ⃓ p⃓ q (either p or q, or both are false
and false when both p and q
is true)
NOR ↓ 𝑝 ↓ 𝑞 (both p and q are false)
Conditional Implies → 𝑝→𝑞 If p then q
or
p implies q
Biconditional If and only if ↔ 𝑝↔𝑞 p implies q and q implies p
or
p if and only if q
The following tables serve as guide in determining the truth value of statements:

 Table 1. NEGATION
p ~𝑝
T F
F T

 Table 2. CONJUNCTION
p q 𝑝˄𝑞
T T T
T F F
F T F
F F F

 Table 3. DISJUNCTION
p q 𝑝˅𝑞
T T T
T F T
F T T
F F F

 Table 4. EXCLUSIVE-OR
p q 𝑝 ⊕q
T T F
T F T
F T T
F F F

 Table 5. NAND
p q p⃓ q
T T F
T F T
F T T
F F T

 Table 6. NOR
p q 𝑝 ↓ 𝑞
T T F
T F F
F T F
F F T
  Table 7. CONDITIONAL
p q 𝑝→𝑞
T T T
T F F
F T T
F F T

 Table 8. BICONDITIONAL
p q 𝑝↔𝑞
T T T
T F F
F T F
F F T

EXAMPLES
1. Consider the following statements.
p: 5 is an integer. q: √3 is an integer.
r: 2 divides 4.

Construct the following statements and determine the truth values.

a. (2 divides 4 or 5 is an integer) and 2 divides 4.
b. (5 is not an integer and √3 is an integer) and 2 divides 4.

Solution:
First, determine the truth value of each statement. We have,
p – true q – false r – true

Then, convert the statement into its propositional form and make the truth table.
(Note: In making the columns for your table, start within the parenthesis, or follow the concept
of PEMDAS. Use the given tables in this module to determine the truth values. The symbols
shall serve as your guide on which table should be used.)

a. (r ˅ p) ˄ r
p q r (r ˅ p) (r ˅ p) ˄ r
T F T T T

b. (~𝑝 ˄ q) ˄ r
p q r ~𝑝 (~𝑝 ˄ q) (~𝑝 ˄ q) ˄ r
T F T F F F

2. Construct the truth table of the following propositions. Determine whether it is a tautology,
contradiction, or contingency.
a. p ˄ (~𝑞) b. [~(𝑝 ˄ 𝑞)] ˅ 𝑟
 Solution:
a. (p ˄ q) → (p → q)
p q p˄q p→q (p ˄ q) → (p → q)
T T T T T
T F F F T
F T F T T
F F F T T
All values in the last column is T, thus it is a TAUTOLOGY.

b. [~(𝑝 ˄ 𝑞)] ˅ 𝑟
p q r (𝑝 ˄ 𝑞) [~(𝑝 ˄ 𝑞)] [~(𝑝 ˄ 𝑞)] ˅ 𝑟
T T T T F T
T T F T F F
T F T F T T
T F F F T T
F T T F T T
F T F F T T
F F T F T T
F F F F T T
Since the the last column contains both T and F, the proposition is a CONTINGENCY.

3. Show that ~(𝑝 ˄ 𝑞) ≡ ~𝑝 ˅ ~𝑞

Solution:
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

∴ ~(𝒑 ˄ 𝒒) ≡ ~𝒑 ˅ ~𝒒.

DERIVED FORMS OF CONDITIONAL STATEMENTS

- Converse Form: q → 𝑝
- Inverse Form: ~𝑝 → ~𝑞
- Contrapositive: ~𝑞 → ~𝑝

Example:
Conditional Statement: If he finds you special, then he likes you.
Converse: If he likes you, then he finds you special.
Inverse: If he does not find you special, then he does not like you.
Contrapositive: If he does not like you, then he does not find you special.