Logic – SS3 Mathematics Lesson Note (First Term)
Lesson note at a glance
- Class
- SS3
- Subject
- Mathematics
- Term
- First Term
- Reading time
- 5 min
Logic is the study of how statements are built and how they relate, so that we can decide whether they are true or false.
Behavioural objectives
By the end of the lesson, students should be able to:
- identify simple and compound statements;
- name the five logical connectives and write their symbols;
- give an example of a statement for each connective;
- complete truth tables for negation, conjunction, disjunction, implication and equivalence;
- explain what equivalent statements are and recognise a pair of them.
What is logic reasoning?
Logic reasoning is the study of the structure of statements and the relationships between them.
- Purpose: it helps us test arguments and reach sound decisions.
- Tools: statements, logical connectives, symbols and truth tables.
- Use in Mathematics: proofs and reasoning in every topic rest on correct logic.
What is a statement?
A statement is a sentence that is either true or false, but not both.
- Statement: “Abuja is the capital of Nigeria.” (true)
- Statement: “5 is an even number.” (false)
- Not a statement: “Close the door.” (a command has no truth value)
- Not a statement: “Where do you live?” (a question has no truth value)
What is a simple statement?
A simple statement is a basic assertion that is either true or false.
- Symbols: simple statements are represented by letters such as p, q and r.
- Example: p: “The sun rises in the east.”
- Example: q: “Lagos is a state in Nigeria.”
- Truth value: each simple statement has one truth value, T (true) or F (false).
What is a compound statement?
A compound statement is formed by joining simple statements with logical connectives.
- Example: “It is sunny AND it is warm” joins two simple statements.
- Truth value: it depends on the truth values of the parts and the connective used.
What are the logical connectives?
There are five logical connectives: conjunction, disjunction, negation, implication and equivalence.
Logical connectives and their symbols
| Connective | Symbol | Example |
|---|---|---|
| Conjunction (AND) | ∧ (p ∧ q) | “It is sunny AND it is warm.” |
| Disjunction (OR) | ∨ (p ∨ q) | “I will have tea OR I will have coffee.” |
| Negation (NOT) | ¬ (¬p) | “It is NOT raining.” |
| Implication (IF-THEN) | → (p → q) | “If it rains, then I will bring an umbrella.” |
| Equivalence (IF AND ONLY IF) | ↔ (p ↔ q) | “I will go IF AND ONLY IF you come along.” |
Meaning of each connective
- Negation (¬p): reverses the truth value of p.
- Conjunction (p ∧ q): true only when both p and q are true.
- Disjunction (p ∨ q): true when at least one of p and q is true.
- Implication (p → q): false only when p is true and q is false.
- Equivalence (p ↔ q): true when p and q have the same truth value.
How do we write a statement in symbols?
To write a statement in symbols, give each simple statement a letter and join the letters with connectives.
Let p: “Ade is tall” and q: “Ade is fast”.
- “Ade is tall and fast” is written p ∧ q.
- “Ade is tall or fast” is written p ∨ q.
- “Ade is not tall” is written ¬p.
- “Ade is tall but not fast” is written p ∧ ¬q.
- “If Ade is tall, then Ade is fast” is written p → q.
What is a truth table?
A truth table is a table that lists every possible combination of truth values and the resulting value of a compound statement.
- Rows for two statements: p and q give 4 rows (2 × 2).
- Rows for three statements: p, q and r give 8 rows (2 × 2 × 2).
- Symbols: T means true and F means false.
Truth table for the five connectives
| 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 |
Steps for building a truth table
- List all combinations of T and F for the simple statements.
- Add a column for each part of the compound statement, such as ¬p or ¬q.
- Work out the connective column from the columns before it.
- Read the final column to see when the statement is true.
What are equivalent statements?
Equivalent statements are statements that have the same truth value under all circumstances.
- Test: their final truth-table columns are exactly the same.
- Symbol: equivalence is written p ≡ q, and it holds when p ↔ q is always true.
- Example: “It is sunny AND warm” is equivalent to “It is warm AND sunny” (p ∧ q ≡ q ∧ p).
Worked example: is ¬(p ∧ q) equivalent to ¬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 |
- Result: the columns for ¬(p ∧ q) and ¬p ∨ ¬q are both F, T, T, T.
- Conclusion: the two statements are equivalent.
What are tautologies and contradictions?
A tautology is a compound statement that is always true, and a contradiction is one that is always false.
- Tautology: p ∨ ¬p, such as “It is raining or it is not raining.”
- Contradiction: p ∧ ¬p, such as “It is raining and it is not raining.”
What are the converse and contrapositive of an implication?
The converse and contrapositive are two statements formed by rearranging p → q.
Let p: “It rains” and q: “The ground is wet”.
| Form | Symbol | Example | Equivalent to p → q? |
|---|---|---|---|
| Implication | p → q | If it rains, then the ground is wet. | Itself |
| Converse | q → p | If the ground is wet, then it rains. | No |
| Contrapositive | ¬q → ¬p | If the ground is not wet, then it does not rain. | Yes |
Classroom activities
- Identify statements: Have students identify simple and compound statements from given examples.
- Truth tables: Create truth tables to demonstrate the truth values of compound statements.
- Practice equivalence: Provide exercises to determine equivalent statements.
Evaluation
- What is a simple statement? Give one example.
- Write the symbol for conjunction, disjunction, negation, implication and equivalence.
- Is “I will have tea OR I will have coffee” a simple or a compound statement? Name the connective used.
- What does it mean to say that two statements are equivalent?
- When is p → q false? Use a truth table to support your answer.
Assignment
Write one compound statement of your own for each of the five logical connectives and show how each is written with p and q, then write a pair of equivalent statements joined by AND, different from the example in this lesson.
This term's Mathematics topics
SS3 First Term · 9 topics
- Logic
- Application of Surds to Trigonometry Ratio and Trigonometry Graph
- Matrices and Determinant
- Calculating Distances Using Longitude, Latitude & Great Circles
- Surface Area and Volume of Sphere and Hemispherical Sphere Volume
- Longitude and Latitude
- Binary Operations Properties
- Arithmetic of Finance
- Simple Equations and Variations

