Chapter 3: Logical Reasoning

Overview

Welcome to Chapter 3 of Form 4 Mathematics! This chapter introduces you to the fascinating world of logic and reasoning. You'll learn how to analyze statements, construct valid arguments, and understand the relationships between different logical concepts. These skills are fundamental not only in mathematics but in all areas of critical thinking.

What You'll Learn:

• Identify and explain different types of statements
• Determine the truth values of statements
• Form negations of statements
• Understand compound statements using "and" or "or"
• Work with implications and their variations
• Construct and evaluate logical arguments

Learning Objectives

After completing this chapter, you will be able to:

• Explain the meaning of statements and determine their truth values
• Negate statements
• Determine the truth values of compound statements built from two statements using "and" or "or"
• Explain the meaning of implications and identify antecedents and consequents
• Form converses, inverses, and contrapositives of implications
• Explain the meaning of arguments and distinguish between deductive and inductive reasoning
• Construct and evaluate deductive and inductive arguments to solve problems

Key Concepts

Statements

A statement is a sentence that can be determined as either true or false, but not both. Sentences that are exclamations, commands, or questions are not statements.

Examples of Statements:

• "$2 + 2 = 4$" (True)
• "The capital of Malaysia is Kuala Lumpur" (True)
• "Water boils at $100°C$ at sea level" (True)
• "All prime numbers are odd" (False - 2 is prime and even)

Non-examples (Not Statements):

• "Hello!" (Exclamation)
• "Study hard!" (Command)
• "Is it raining?" (Question)

Statement Types Visualization

Statement Classification

Negation

Negation is the process of denying a statement using the word "not" or "no". The negation (~p) has a truth value opposite to the original statement (p).

Truth Table for Negation:

Example:

• Statement p: "The number 5 is prime" (True)
• Negation ~p: "The number 5 is not prime" (False)

Compound Statements

Compound statements are combinations of two or more statements using logical connectors "and" (conjunction) or "or" (disjunction).

Conjunction ("and")

The statement "p and q" is true only if both p and q are true.

Truth Table for Conjunction:

Disjunction ("or")

The statement "p or q" is true if at least one of p or q is true (or both).

Truth Table for Disjunction:

Compound Statement Logic

Quantifiers

Quantifiers are words like "all" and "some" that describe the quantity of objects in a statement.

• Universal Quantifier (All): "All birds can fly"
• Existential Quantifier (Some): "Some birds can fly"

Implications and Related Statements

Implication

An implication is a statement in the form "If p, then q", where p is called the antecedent and q is called the consequent.

Truth Table for Implication:

Example:

• If it rains (p), then the ground will be wet (q)
• p → q: If it rains, then the ground will be wet

Related Statements

Converse

The converse of "If p, then q" is "If q, then p".

Example:

• Original: If it is a square, then it has four sides
• Converse: If it has four sides, then it is a square

Inverse

The inverse of "If p, then q" is "If not p, then not q" (If ~p, then ~q).

Example:

• Original: If it is a square, then it has four sides
• Inverse: If it is not a square, then it does not have four sides

Contrapositive

The contrapositive of "If p, then q" is "If not q, then not p" (If ~q, then ~p).

Example:

• Original: If it is a square, then it has four sides
• Contrapositive: If it does not have four sides, then it is not a square

Note: The contrapositive is logically equivalent to the original implication.

Implication Relationships

Arguments

An argument is a set of statements consisting of premises and one conclusion.

Types of Reasoning

Deductive Reasoning

Deductive reasoning is the process of drawing specific conclusions from general premises. Deductive arguments are evaluated as valid (correct reasoning) or invalid (incorrect reasoning).

Valid Argument Forms:

Form I (Categorical Syllogism):

• Premise 1: All A are B
• Premise 2: C is A
• Conclusion: C is B

Form II (Modus Ponens):

• Premise 1: If p, then q
• Premise 2: p is true
• Conclusion: q is true

Form III (Modus Tollens):

• Premise 1: If p, then q
• Premise 2: q is not true
• Conclusion: p is not true

Inductive Reasoning

Inductive reasoning is the process of drawing general conclusions from specific cases. Inductive arguments are evaluated as strong or weak.

Example:

• Observation 1: The first swan I saw was white
• Observation 2: The second swan I saw was white
• Observation 3: The third swan I saw was white
• Conclusion: All swans are white (This is a generalization)

Reasoning Types Visualization

Valid Argument Forms

Important Formulas and Methods

Truth Tables

Truth tables are systematic ways to list all possible combinations of truth values for statements and their compound forms.

Example: Truth table for "p and q"

Logical Equivalences

Several important logical equivalences:

1. De Morgan's Laws:

   • ~(p ∧ q) ≡ ~p ∨ ~q
   • ~(p ∨ q) ≡ ~p ∧ ~q

2. Double Negation:

   • ~~p ≡ p

3. Contrapositive Equivalence:

   • (p → q) ≡ (~q → ~p)

Valid Argument Identification

To determine if an argument is valid:

1. Construct a truth table for the premises and conclusion
2. Check if there's any case where all premises are true but the conclusion is false
3. If no such case exists, the argument is valid

Step-by-Step Solved Examples

Example 1: Statement Analysis

Problem: Determine the truth value of each statement: a) "2 + 3 = 6" b) "The Earth is round" c) "All even numbers are divisible by 4"

Solution: a) "2 + 3 = 6" is False (2 + 3 = 5) b) "The Earth is round" is True c) "All even numbers are divisible by 4" is False (2 is even but not divisible by 4)

Example 2: Compound Statements

Problem: Let p: "It is sunny" (True), q: "I will go to the beach" (False) Find the truth values of: a) p ∧ q b) p ∨ q c) ~p

Solution: Given: p = True, q = False

a) p ∧ q = "It is sunny and I will go to the beach" = False b) p ∨ q = "It is sunny or I will go to the beach" = True c) ~p = "It is not sunny" = False

Example 3: Implications and Related Statements

Problem: For the implication "If a number is divisible by 10, then it is divisible by 5", write: a) The converse b) The inverse c) The contrapositive

Solution: Let p: "A number is divisible by 10" Let q: "A number is divisible by 5"

a) Converse: "If a number is divisible by 5, then it is divisible by 10" b) Inverse: "If a number is not divisible by 10, then it is not divisible by 5" c) Contrapositive: "If a number is not divisible by 5, then it is not divisible by 10"

Example 4: Argument Evaluation

Problem: Determine if the following argument is valid: Premise 1: If I study, then I will pass Premise 2: I studied Conclusion: I will pass

Solution: This is Modus Ponens, which is a valid argument form.

In all cases where premises are true (first row), the conclusion is also true. Therefore, the argument is valid.

Example 5: Logical Puzzle

Problem: Three friends - Alice, Bob, and Carol - made statements about who broke the vase. Only one is telling the truth.

• Alice: "Bob did it"
• Bob: "Carol did it"
• Carol: "I didn't do it"

Who broke the vase?

Solution: Let's test each possibility:

Case 1: Alice is telling the truth (Bob did it)

• Alice: True ✓
• Bob: False (Carol didn't do it) ✓
• Carol: False (she says "I didn't do it" but she did) ✓ This works - only Alice is truthful.

Case 2: Bob is telling the truth (Carol did it)

• Alice: False (Bob didn't do it) ✓
• Bob: True ✓
• Carol: False (she says "I didn't do it" but she did) ✓ This would mean two people are truthful, which contradicts the condition.

Case 3: Carol is telling the truth (she didn't do it)

• Alice: False (Bob didn't do it) ✓
• Bob: False (Carol didn't do it) ✓
• Carol: True ✓ This would mean only Carol is truthful, but then who did it? If neither Bob nor Carol did it, Alice must have done it, but she lied.

The only consistent solution is that Bob broke the vase and only Alice is telling the truth.

Logical Equivalences Visualization

Truth Table Construction Guide

Real-world Applications

Computer Science Applications

Mathematical Applications

Real-world Applications

1. Computer Science

• Programming: Conditional statements (if-then-else)
• Database Queries: SQL WHERE clauses use logical operators
• Artificial Intelligence: Rule-based systems and expert systems

2. Mathematics

• Proofs: All mathematical proofs rely on logical reasoning
• Theorems: Mathematical theorems are implications
• Set Theory: Logic forms the foundation of set operations

3. Everyday Life

• Decision Making: "If I leave now, then I'll arrive on time"
• Problem Solving: Systematic elimination of possibilities
• Critical Thinking: Evaluating arguments and claims

4. Law and Justice

• Legal Arguments: Constructing logical arguments in court
• Evidence Analysis: Evaluating the validity of claims
• Reasoning: Drawing conclusions from evidence

5. Scientific Research

• Hypothesis Testing: If hypothesis, then experimental result
• Deductive Reasoning: From theory to predictions
• Inductive Reasoning: From observations to theories

Important Terms

Summary Points

• Statement: Can be true or false, but not both
• Negation: Opposite truth value of the original statement
• Conjunction (and): True only if both statements are true
• Disjunction (or): True if at least one statement is true
• Implication (if-then): False only when antecedent is true and consequent is false
• Converse: Swaps antecedent and consequent
• Inverse: Negates both antecedent and consequent
• Contrapositive: Negates and swaps antecedent and consequent (logically equivalent to original)
• Valid Argument: Correct reasoning structure (conclusion follows from premises)
• Strong Argument: Reasonable generalization from specific evidence

Practice Tips for SPM Students

1. Master Truth Tables

• Practice constructing truth tables for compound statements
• Learn to identify logical equivalences
• Understand the patterns in truth table results

2. Understand Implications

• Memorize the truth table for implications
• Practice forming converses, inverses, and contrapositives
• Learn to identify valid argument forms

3. Critical Thinking Exercises

• Analyze everyday statements logically
• Evaluate arguments in news, advertisements, and discussions
• Practice identifying logical fallacies

4. Common Mistakes to Avoid

• Confusing "and" with "or" in compound statements
• Misunderstanding when implications are false
• Assuming converses or inverses are equivalent to the original
• Drawing conclusions that don't logically follow from premises

SPM Exam Tips

Paper 1 (Multiple Choice)

• Look for key logical words (if, then, and, or, not)
• Use elimination method for complex questions
• Remember the truth table patterns
• Practice with logical puzzles

Paper 2 (Structured)

• Show all truth table constructions clearly
• Label your premises and conclusions in arguments
• Use proper logical notation where appropriate
• Explain your reasoning for argument validity

---

Did You Know? The study of logic dates back to ancient Greece with Aristotle, who developed the first formal system of logic. His work laid the foundation for all modern logical reasoning and is still used today in mathematics, computer science, and philosophy!

Next Chapter: In Chapter 4, you'll explore set operations and learn how to work with Venn diagrams and perform various set operations, which is essential for understanding relationships between groups.

---

• Chapter 2: Number Bases
• Chapter 4: Operations on Sets