Lesson Note
INTRODUCTION
Logical reasoning is the backbone of mathematics and everyday problem‑solving. It teaches us to think clearly, to deduce conclusions from given facts, and to construct sound arguments. In secondary school, logical reasoning moves beyond simple arithmetic to the study of statements, truth values, and the relationships between them. Mastering this skill allows students to analyse complex problems, recognise patterns, and communicate ideas precisely. Logical reasoning also forms the foundation for higher mathematics, computer science, and critical thinking in any field.
In this lesson we focus on Logical Reasoning II, which deepens our understanding of compound statements, logical operators, and the construction of truth tables. We will explore how to combine simple statements using conjunction, disjunction, implication, and biconditional operators, and how to verify equivalences using De Morgan’s laws and truth tables. By the end of the lesson, students will be able to translate natural language statements into symbolic form, evaluate their truth values, and prove logical equivalences.
MAIN CONTENT
Compound Statements and Logical Operators
A compound statement is formed by joining two or more simple statements with logical operators. The main operators are conjunction ($\land$), disjunction ($\lor$), negation ($\neg$), implication ($\rightarrow$), and biconditional ($\leftrightarrow$). Each operator has a specific truth table that determines the truth value of the compound statement based on the truth values of its components.
Worked Example
Let $P$ be the statement “It rains today” and $Q$ be the statement “I carry an umbrella.” Suppose $P$ is true and $Q$ is false. Evaluate the compound statement $P \land \neg Q$.
Step 1: Determine truth values: $P = \text{true}$, $Q = \text{false}$, so $\neg Q = \text{true}$.
Step 2: Apply conjunction: $$P \land \neg Q = \text{true} \land \text{true} = \text{true}$$.
Answer: The compound statement is true.
Practice Questions
1. If $R$ is true and $S$ is true, what is the truth value of $R \lor \neg S$?
Answer: False.
2. If $T$ is false and $U$ is true, evaluate $T \rightarrow U$.
Answer: True.
3. Let $V$ be false and $W$ be false. What is $V \leftrightarrow W$?
Answer: True.
Conjunction and Disjunction
Conjunction ($\land$) represents “and”; a conjunction is true only when both components are true. Disjunction ($\lor$) represents “or”; a disjunction is true if at least one component is true. These operators are fundamental in constructing complex conditions.
Worked Example
Let $A$ be “I finish my homework” and $B$ be “I watch television.” Suppose $A$ is true and $B$ is false. Determine the truth value of $A \lor B$.
Step 1: Identify truth values: $A = \text{true}$, $B = \text{false}$.
Step 2: Apply disjunction: $$A \lor B = \text{true} \lor \text{false} = \text{true}$$.
Answer: The statement is true.
Practice Questions
1. If $C$ is false and $D$ is true, what is $C \land D$?
Answer: False.
2. If $E$ is true and $F$ is true, evaluate $E \lor F$.
Answer: True.
3. Let $G$ be false and $H$ be false. What is $G \lor H$?
Answer: False.
Conditional Statements and Implication
An implication $P \rightarrow Q$ reads “if $P$ then $Q$.” It is false only when $P$ is true and $Q$ is false; otherwise it is true. The converse, inverse, and contrapositive of an implication are useful for logical reasoning and proofs.
Worked Example
Let $X$ be “The machine is on” and $Y$ be “The light turns on.” Suppose $X$ is true and $Y$ is false. Evaluate $X \rightarrow Y$ and its contrapositive $\neg Y \rightarrow \neg X$.
Step 1: Truth values: $X = \text{true}$, $Y = \text{false}$, so $\neg Y = \text{true}$, $\neg X = \text{false}$.
Step 2: Implication: $$X \rightarrow Y = \text{true} \rightarrow \text{false} = \text{false}$$.
Step 3: Contrapositive: $$\neg Y \rightarrow \neg X = \text{true} \rightarrow \text{false} = \text{false}$$.
Answer: Both the implication and its contrapositive are false.
Practice Questions
1. If $M$ is true and $N$ is true, what is $M \rightarrow N$?
Answer: True.
2. If $O$ is false and $P$ is true, evaluate $O \rightarrow P$.
Answer: True.
3. Let $Q$ be true and $R$ be false. What is the contrapositive of $Q \rightarrow R$?
Answer: $\neg R \rightarrow \neg Q$ (true).
Biconditional Statements
A biconditional $P \leftrightarrow Q$ reads “$P$ if and only if $Q$.” It is true when both statements share the same truth value (both true or both false). Biconditionals are essential for defining equivalence and establishing necessary and sufficient conditions.
Worked Example
Let $S$ be “It is raining” and $T$ be “The ground is wet.” Suppose $S$ is true and $T$ is true. Determine the truth value of $S \leftrightarrow T$.
Step 1: Truth values: $S = \text{true}$, $T = \text{true}$.
Step 2: Biconditional: $$S \leftrightarrow T = \text{true} \leftrightarrow \text{true} = \text{true}$$.
Answer: The biconditional statement is true.
Practice Questions
1. If $U$ is false and $V$ is false, what is $U \leftrightarrow V$?
Answer: True.
2. If $W$ is true and $X$ is false, evaluate $W \leftrightarrow X$.
Answer: False.
3. Let $Y$ be true and $Z$ be false. What is the truth value of $Y \leftrightarrow Z$?
Answer: False.
Truth Tables for Compound Statements
Truth tables list all possible truth values of component statements and the resulting truth value of the compound statement. They provide a systematic way to verify logical equivalences and to analyze complex conditions.
Worked Example
Construct the truth table for the compound statement $(P \land Q) \lor (\neg P \land R)$ where $P$, $Q$, and $R$ are simple statements.
Step 1: List all combinations of truth values for $P$, $Q$, $R$ (8 rows).
Step 2: Compute $\neg P$, $P \land Q$, $\neg P \land R$, and finally $(P \land Q) \lor (\neg P \land R)$ for each row.
Answer: The completed truth table is:
Practice Questions
1. Write the truth table for $P \rightarrow Q$.
Answer: (Provide table).
2. Evaluate $(P \lor Q) \land \neg R$ for $P = \text{true}$, $Q = \text{false}$, $R = \text{false}$.
Answer: True.
3. Construct the truth table for $\neg(P \lor Q)$.
Answer: (Provide table).
De Morgan's Laws and Logical Equivalence
De Morgan’s laws provide rules for distributing negation over conjunction and disjunction:
These laws are essential for simplifying logical expressions and proving equivalences.
Worked Example
Simplify $\neg(A \lor B)$ using De Morgan’s laws.
Step 1: Apply the second law: $$\neg(A \lor B) \equiv \neg A \land \neg B$$.
Answer: The simplified form is $\neg A \land \neg B$.
Practice Questions
1. Simplify $\neg(C \land D)$ using De Morgan’s laws.
Answer: $\neg C \lor \neg D$.
2. Verify that $P \lor \neg P$ is a tautology.
Answer: True.
3. Show that $(P \rightarrow Q)$ is equivalent to $(\neg P \lor Q)$.
Answer: True.
Proof of Logical Equivalence Using Truth Tables
Logical equivalence means two statements always have the same truth value for every possible assignment of truth values to their components. Truth tables are a reliable method to confirm equivalence.
Worked Example
Prove that $P \leftrightarrow Q$ is equivalent to $(P \land Q) \lor (\neg P \land \neg Q)$.
Step 1: Create truth tables for both expressions.
Step 2: Compare the final column of each table. The columns match for all combinations of $P$ and $Q$.
Answer: The two expressions are logically equivalent.
Practice Questions
1. Verify equivalence of $P \rightarrow Q$ and $\neg P \lor Q$ using a truth table.
Answer: Equivalent.
2. Show that $P \lor (Q \land R)$ is equivalent to $(P \lor Q) \land (P \lor R)$.
Answer: Equivalent.
3. Prove that $\neg(P \lor Q)$ is equivalent to $\neg P \land \neg Q$.
Answer: Equivalent.
SUMMARY
Logical reasoning equips students with a systematic way to analyse statements, combine them, and deduce conclusions. By mastering compound statements, truth tables, and logical equivalences, students can tackle complex problems in mathematics and beyond. Logical operators such as conjunction, disjunction, implication, and biconditional form the language of logic, while De Morgan’s laws and truth tables provide tools for simplifying and verifying expressions. These skills are foundational for advanced studies in mathematics, computer science, and critical thinking.
EVALUATION
1. Evaluate the truth value of $P \land (Q \lor \neg R)$ when $P$ is true, $Q$ is false, and $R$ is true.
2. Determine whether the statement $$\neg(P \land Q) \leftrightarrow (\neg P \lor \neg Q)$$ is a tautology.
3. Simplify $\neg(A \lor \neg B)$ using De Morgan’s laws.
4. Prove that $(P \rightarrow Q)$ is equivalent to $(\neg P \lor Q)$ using a truth table.
5. Verify that $P \lor \neg P$ is always true (a tautology).