Binalonan, Pangasinan
College of Information Technology
2nd Semester A.Y 2025-2026
MODULE 4
FUNDAMENTALS OF LOGIC
Course Title: Mathematics in the Modern World
Course Code: GE 4
Name: _____________________________________ Course and Year: ___________
I. Module Objectives
At the end of the course, the student should be able to:
• Identify logic and proofs.
• Construct truth tables to evaluate the validity of logical statements.
• Value the importance of logical reasoning in everyday decision-making.
II. Lecture and Discussions
SOME FUNDAMENTALS OF LOGIC
Proposition is a statement with a complete declarative sentence which is either true (T) or false (F) but cannot be both.
THE TRUTH TABLE
A truth table is a table that shows the truth value of a compound statement for all possible truth values of its simple statements.
NEGATION
A statement is a negation of another if the word is not introduced in the negative statement. Let P be the proposition. The
negation of P is “not P” or ¬P.
The following is its truth table:
P ¬P
T F
F T
Examples:
1. Three is a prime number.
Negation: Three is not a prime number.
2. Today is Thursday.
Negation: Today is not Thursday.
LOGICAL CONNECTIVES
Let P and Q be propositions. A logical connective is the mathematical equivalent of a conjunction in English. The most
common conjunctions in mathematics are “and” and “or”, which are denoted by ˄ and ˅, respectively.
If two statements are joined like P and Q, denoted by P ˄ Q, then P ˄ Q is a statement that is true if and only if both P and Q are
true. Another logical connective is the word “or”. The statement P ˅ Q is true if and only if P is true or Q is true, which is taken to
include the case when they are both true.
Prepared by:
ANGELINE M. GAMOSO,LPT
Instructor
Binalonan, Pangasinan
The following is the truth table.
P Q P˄Q P˅Q
F F F F
F T F T
T F F T
T T T T
IMPLICATIONS
Suppose P and Q are propositions. The proposition P ⟹Q (read as “if P, then Q”) is called an implication. P is called the premise
and Q is called the conclusion. In ordinary language like “If it rains, then I bring my umbrella” is an implication. “If it rains” is P or
the premise while “I bring my umbrella” is Q or the conclusion.
Other ways of reading P ⟹Q are:
➢ P implies Q
➢ Q if P
➢ Q is implied by P
➢ Q only if P
A more complicated form of implications is the bi implication or the biconditional denoted by the symbol ⇔. The statement
P ⇔ Q is true if and only if both P and Q are either both true or both false. The sentence P ⇔ Q is equivalent to the statement
P ⇔ Q = ( P ⟹Q ) ˄ ( Q ⟹P )
Construct the truth table for the logical operator ⇔ and check that indeed it is equivalent to ( P ⟹Q ) ˄ ( Q ⟹ P ). A
biconditional is often stated as,
➢ P if and only if Q
➢ P is necessary and sufficient for Q
Converse, Inverse, Contrapositive
Suppose P and Q are propositions. Given the implication P ⟹Q. Its converse is Q ⟹P, its inverse is ¬P ⟹¬Q and its contrapositive is ¬Q ⟹¬P.
That is,
Given: If P then Q.
Inverse: If not P then not Q.
Converse: If Q then P.
Contrapositive: If not Q then not P.
Example: If I get the job, then I will rent the apartment.
INVERSE: If Ido not get the job, then I will not rent the apartment.
CONVERSE: If I will rent the apartment, then I get the job.
CONTRAPOSITIVE: If I do rent the apartment, then I did not get the job.
Prepared by:
ANGELINE M. GAMOSO,LPT
Instructor
Binalonan, Pangasinan
To determine whether the conditional statement is true or false, we come up with the following truth table. Referring to
the truth table of the implications statement P ⟹Q below, we then create the truth table for the inverse, converse, and
contrapositive statements.
P Q P⟹Q
F F T
F T T
T F F
T T T
Truth table of the inverse, converse, and contrapositive of P ⟹Q.
Inverse Converse Contrapositive
¬P ⟹¬Q Q ⟹P ¬Q ⟹¬P
T T T
F F T
T T F
T T T
Then using the mathematical symbols, the statement is equivalent to P ⇔ (Q ˄ R). The statement can also be written as
[P ⟹ (Q ˄R)] ˄[(Q ˄R) ⟹P].
Quantifiers
Quantifiers are used to describe the variable(s) in a statement.
Types
1. The universal quantifier is usually written in the English language as “for all” or “for every.” It is
denoted by the symbol Ɐ.
2. The existential quantifies is expressed in words as “there exists” or “for some.” This quantifier is denoted
by Ǝ.
NAME SYMBOL FORM CONNECTIVE STATEMENT
1. Conjunction P˄Q and P and Q
2. Disjunction P˅Q or P or Q
3. Implication/
P⟹Q If…the If P, then Q
Conditional
4. Biconditional P⇔Q if and only if Pif and only if Q
5. Negation ¬P not Not P
Prepared by:
ANGELINE M. GAMOSO,LPT
Instructor
Binalonan, Pangasinan
III. Student Activity
Objective: Students will create their own propositional logic statements and apply various logical connectives (AND, OR,
NOT, IMPLIES, IF AND ONLY IF) to express complex logical relations.
Instructions
1. Create Basic Propositional Statements
Choose 5 simple propositional statements about any subject (e.g., school, hobbies, or daily life). These will be the base
of your logical expressions.
Example:
1. P: “I study for my exams.”
2. Q: “I pass the exam.”
3. R: “I get a good grade.”
2. Apply Logical Connectives
1. AND (∧): Both statements must be true.
Example: P ∧ Q ("I study for my exams and I pass the exam.")
2. OR (∨): At least one of the statements must be true.
Example: P ∨ R ("I study for my exams or I get a good grade.")
3. NOT (¬): The negation of the statement.
Example: ¬P ("I do not study for my exams.")
4. IMPLIES (→): If the first statement is true, then the second must be true.
Example: P → Q ("If I study for my exams, then I pass the exam.")
5. IF AND ONLY IF (↔): Both statements must either be true or false together.
Example: P ↔ Q ("I study for my exams if and only if I pass the exam.")
3. Construct Compound Logical Statements
Combine at least 3 different connectives to create more complex logical statements.
Example: (P ∧ Q) → R ("If I study for my exams and I pass the exam, then I get a good grade.")
4. Interpret Your Statement
For each compound logical statement, explain the real-world meaning of the statement. For example, describe what the
relationship between "study for my exams" and "getting a good grade" implies logically.
IV. Assessment / Evaluation of Learning Comprehension and Understanding
A. Assignments and Homework
Students will be assessed based on their outputs, reflections, and participation in discussions. (YELLOW PAD
PAPER)
Assignment 1: Reflective Essay
After completing the activity, write a brief reflection on how the logical connectives help structure thoughts
and create more nuanced logical relationships. Discuss how propositional logic can be applied to real- life
situations, such as problem-solving and decision-making.
Prepared by:
ANGELINE M. GAMOSO,LPT
Instructor
Binalonan, Pangasinan
Example Answers:
1. P: "I go to the gym."
2. Q: "I stay healthy."
3. R: "I have energy throughout the day."
• P ∧ Q: "I go to the gym and I stay healthy."
• ¬P: "I do not go to the gym."
• P → Q: "If I go to the gym, then I stay healthy."
• P ↔ R: "I go to the gym if and only if I have energy throughout the day."
Assessment Criteria:
• Correct usage of logical connectives.
• Clear explanation of compound statements.
• Thoughtful interpretation of propositional relationships in real-world contexts.
Prepared by:
ANGELINE M. GAMOSO, LPT
Faculty, College of Information Technology
Noted by:
FREDERICK J. SORIANO, MIT
Dean, College of Information Technology
Approved by:
RAYMOND N. CLARO, PHD
OIC- Office of the Vice-President for Academic Affairs and Intertionalization
Prepared by:
ANGELINE M. GAMOSO,LPT
Instructor