Solved Exercises on Logical Reasoning Strategies in Grade 9

Master logical reasoning strategies: conditional statements, biconditionals, contrapositive, truth tables, and deductive reasoning through these 5 detailed exercises.

Solution: Exercises 1 to 3
1 Conditional Statements
Exercise 1
Write the converse, inverse, and contrapositive of the following conditional statement: "If a triangle has three congruent angles, then it is equilateral."
Definitions:

Conditional Statement: "If p, then q" (p → q)

Converse: "If q, then p" (q → p)

Inverse: "If not p, then not q" (~p → ~q)

Contrapositive: "If not q, then not p" (~q → ~p)

Solution method:
  1. Identify the hypothesis (p) and conclusion (q)
  2. Form the converse by switching p and q
  3. Form the inverse by negating both p and q
  4. Form the contrapositive by switching and negating p and q
Original
p → q
Converse
q → p
Inverse
~p → ~q
Contrapositive
~q → ~p
Step 1: Identify hypothesis and conclusion

Hypothesis (p): A triangle has three congruent angles

Conclusion (q): It is equilateral

Step 2: Write the original conditional

If a triangle has three congruent angles, then it is equilateral.

Step 3: Write the converse

If a triangle is equilateral, then it has three congruent angles.

Step 4: Write the inverse

If a triangle does not have three congruent angles, then it is not equilateral.

Step 5: Write the contrapositive

If a triangle is not equilateral, then it does not have three congruent angles.

Step 6: Analyze truth values

Original: TRUE (by definition of equilateral triangle)

Converse: TRUE (equilateral triangles have 60° angles)

Inverse: TRUE (contrapositive of the converse)

Contrapositive: TRUE (logically equivalent to original)

Converse: If equilateral, then 3 congruent angles
Inverse: If not 3 congruent angles, then not equilateral
Contrapositive: If not equilateral, then not 3 congruent angles
Final answer:

Converse: If a triangle is equilateral, then it has three congruent angles.

Inverse: If a triangle does not have three congruent angles, then it is not equilateral.

Contrapositive: If a triangle is not equilateral, then it does not have three congruent angles.

Applied rules:

• Logical equivalence: A conditional and its contrapositive are logically equivalent

• Converse/inverse relationship: Converse and inverse are logically equivalent

• Truth preservation: Original and contrapositive have same truth value

TIP: Remember "Switch and negate" for contrapositive: switch p and q, then negate both.
p (3 congruent angles) q (equilateral) p → q q → p ~p → ~q ~q → ~p
T T T T T T
T F F T F T
F T T F T F
F F T T T T
2 Biconditional Statements
Exercise 2
Determine if the biconditional statement is true: "A polygon is a square if and only if it has four right angles and four congruent sides." Justify your answer.
Definition:

Biconditional Statement: "p if and only if q" (p ↔ q) means both p → q and q → p are true

Statement
p ↔ q
Truth
True
Justification
Both directions true
Step 1: Identify p and q

p: A polygon is a square

q: It has four right angles and four congruent sides

Step 2: Check p → q (Forward direction)

If a polygon is a square, then it has four right angles and four congruent sides.

This is TRUE by definition of a square.

Step 3: Check q → p (Reverse direction)

If a polygon has four right angles and four congruent sides, then it is a square.

This is TRUE because having four right angles makes it a rectangle, and having four congruent sides makes it a rhombus. A rectangle that is also a rhombus is a square.

Step 4: Determine biconditional truth

Since both p → q and q → p are true, p ↔ q is true.

Step 5: Conclusion

The biconditional statement is true because both conditions are met.

The biconditional is TRUE
Final answer:

The statement is true. A polygon is a square if and only if it has four right angles and four congruent sides.

Applied rules:

• Biconditional equivalence: p ↔ q is true when both p → q and q → p are true

• Definition verification: Check both directions of logical implication

• Geometric properties: Understand relationships between shapes and their defining characteristics

TIP: For biconditionals, always verify both directions: if p then q AND if q then p.
3 Truth Tables
Exercise 3
Construct a truth table for the compound statement: (p ∧ q) → r. Then determine under what conditions this statement is false.
Definition:

Logical operators: ∧ (and), ∨ (or), → (implies), ¬ (not)

Truth table: Shows all possible truth values for a logical expression

Expression
(p ∧ q) → r
False condition
p=T, q=T, r=F
Step 1: Identify the variables

We have three variables: p, q, and r

Number of rows needed: 2³ = 8

Step 2: List all possible combinations

Create columns for p, q, r, (p ∧ q), and (p ∧ q) → r

Step 3: Fill in the truth table
p q r p ∧ q (p ∧ q) → r
T T T T T
T T F T F
T F T F T
T F F F T
F T T F T
F T F F T
F F T F T
F F F F T
Step 4: Analyze when the statement is false

Looking at the truth table, (p ∧ q) → r is false only when:

p = T, q = T, and r = F

This makes sense: if both p and q are true, then for the implication to be true, r must also be true.

Step 5: Verification

Remember: An implication p → q is false only when p is true and q is false.

So (p ∧ q) → r is false only when (p ∧ q) is true and r is false.

(p ∧ q) is true only when both p and q are true.

Statement is false when p=T, q=T, r=F
Final answer:

The statement (p ∧ q) → r is false only when p is true, q is true, and r is false.

Applied rules:

• Implication rule: p → q is false only when p is true and q is false

• Conjunction rule: p ∧ q is true only when both p and q are true

• Truth table method: Systematically evaluate all possibilities

TIP: When building truth tables, list variables in alphabetical order and use binary counting for truth values.
Logical Reasoning Fundamentals
\(p \rightarrow q \equiv \neg q \rightarrow \neg p\)
Contrapositive Equivalence
Conditional
\(p \rightarrow q\)
If p then q
Biconditional
\(p \leftrightarrow q\)
p if and only if q
De Morgan's Law
\(\neg(p \land q) \equiv \neg p \lor \neg q\)
Negation of conjunction
Key definitions:

Logical reasoning: The process of using rational thinking to arrive at valid conclusions

Proposition: A statement that is either true or false

Conditional statement: An "if-then" statement of the form "if p then q"

Logical equivalence: Two statements that have the same truth values in all possible scenarios

Logical Reasoning Process:
  1. Identify propositions: Recognize the basic statements in the argument
  2. Determine logical structure: Identify the connectives and relationships
  3. Apply logical rules: Use established rules of inference
  4. Construct arguments: Build valid logical sequences
  5. Verify conclusions: Check the validity of the reasoning
  6. Identify fallacies: Detect common errors in reasoning
Tip 1: Remember that a conditional statement is only false when the hypothesis is true and the conclusion is false.
Tip 2: The contrapositive of a conditional is always logically equivalent to the original statement.
Tip 3: For biconditionals, both directions of implication must be true.
Tip 4: Use truth tables to systematically analyze compound logical statements.
Common errors: Confusing converse with contrapositive, assuming converse is equivalent to original, misapplying logical rules.
Exam preparation: Practice identifying logical forms, memorize equivalences, work with truth tables.
Essential Logical Laws:

• Law of Contrapositive: p → q ≡ ¬q → ¬p

• De Morgan's Laws: ¬(p ∧ q) ≡ ¬p ∨ ¬q and ¬(p ∨ q) ≡ ¬p ∧ ¬q

• Commutative Laws: p ∧ q ≡ q ∧ p and p ∨ q ≡ q ∨ p

• Associative Laws: (p ∧ q) ∧ r ≡ p ∧ (q ∧ r) and (p ∨ q) ∨ r ≡ p ∨ (q ∨ r)

• Distributive Laws: p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r) and p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r)

Logical Connectives:

Conjunction (∧): "and" - true only when both statements are true

Disjunction (∨): "or" - true when at least one statement is true

Negation (¬): "not" - reverses the truth value

Conditional (→): "if...then" - false only when antecedent is true and consequent is false

Biconditional (↔): "if and only if" - true when both statements have the same truth value

Solution: Exercises 4 to 5
4 Deductive Reasoning
Exercise 4
Given the following premises: 1) If a triangle is equilateral, then it is isosceles. 2) If a triangle is isosceles, then it has at least two congruent angles. 3) Triangle ABC is equilateral. Use deductive reasoning to prove that Triangle ABC has at least two congruent angles.
Definition:

Deductive reasoning: Drawing specific conclusions from general principles or premises

Premises
p→q, q→r, p
Conclusion
r
Method
Law of Syllogism
Step 1: Identify the premises

Premise 1: If a triangle is equilateral, then it is isosceles. (p → q)

Premise 2: If a triangle is isosceles, then it has at least two congruent angles. (q → r)

Premise 3: Triangle ABC is equilateral. (p)

Step 2: Apply the law of detachment to premises 1 and 3

From p → q and p, we can conclude q.

Therefore: Triangle ABC is isosceles.

Step 3: Apply the law of detachment to premises 2 and the conclusion from step 2

From q → r and q, we can conclude r.

Therefore: Triangle ABC has at least two congruent angles.

Step 4: Alternative approach using the law of syllogism

From p → q and q → r, we can conclude p → r (law of syllogism).

From p → r and p, we can conclude r (law of detachment).

Step 5: Verify the logical chain

Equilateral → Isosceles → At least two congruent angles

Triangle ABC is equilateral → Triangle ABC is isosceles → Triangle ABC has at least two congruent angles

Triangle ABC has at least two congruent angles
Final answer:

By deductive reasoning, Triangle ABC has at least two congruent angles.

Applied rules:

• Law of Detachment: If p → q and p are true, then q is true

• Law of Syllogism: If p → q and q → r are true, then p → r is true

• Logical chain: Build conclusions step by step from given premises

TIP: In deductive reasoning, work from general to specific. Always follow the logical flow from premises to conclusion.
5 Identifying Logical Fallacies
Exercise 5
Analyze the following argument and identify the logical fallacy: "If a quadrilateral is a square, then it has four right angles. This quadrilateral has four right angles. Therefore, this quadrilateral is a square."
Definition:

Logical fallacy: An error in reasoning that renders an argument invalid

Affirming the consequent: The fallacy of assuming (p → q) and q together imply p

Structure
p→q, q ⊢ p
Fallacy
Affirming Consequent
Valid Form
p→q, ¬q ⊢ ¬p
Step 1: Identify the logical structure

Major premise: If a quadrilateral is a square, then it has four right angles. (p → q)

Minor premise: This quadrilateral has four right angles. (q)

Conclusion: Therefore, this quadrilateral is a square. (p)

Step 2: Compare to valid logical forms

Valid form: p → q, p ⊢ q (Modus Ponens)

Valid form: p → q, ¬q ⊢ ¬p (Modus Tollens)

Invalid form: p → q, q ⊢ p (Affirming the Consequent)

Step 3: Identify the fallacy

The argument follows the pattern: p → q, q ⊢ p

This is the fallacy of affirming the consequent.

Step 4: Provide counterexample

A rectangle that is not a square also has four right angles.

So having four right angles does not necessarily mean the quadrilateral is a square.

Step 5: Correct the reasoning

Valid conclusion: We cannot determine if the quadrilateral is a square just from knowing it has four right angles.

To conclude it's a square, we would need additional information about side lengths.

Fallacy: Affirming the Consequent
Final answer:

The argument commits the fallacy of affirming the consequent. Having four right angles does not guarantee that a quadrilateral is a square.

Applied rules:

• Affirming the Consequent: Invalid form: p → q, q ⊢ p

• Counterexample: Show that the conclusion doesn't always follow

• Logical validity: Only certain forms of inference preserve truth

TIP: Watch out for arguments that reverse the direction of a conditional statement. If p then q does not mean if q then p.
Detailed Summary: Logical Reasoning Strategies
\(p \leftrightarrow q \equiv (p \rightarrow q) \land (q \rightarrow p)\)
Biconditional Definition
Comprehensive Definitions:

Proposition: A declarative sentence that is either true or false, but not both. Example: "2 + 2 = 4" is a proposition (true).

Logical Connective: Words or symbols that combine propositions to form compound propositions. Examples: ∧ (and), ∨ (or), ¬ (not), → (implies), ↔ (if and only if).

Argument: A sequence of statements where the final statement (conclusion) follows from the preceding statements (premises).

Validity: An argument is valid if the conclusion follows logically from the premises, regardless of the truth of the premises.

Logical Reasoning Strategies:
  1. Translation: Convert verbal statements into symbolic form using logical operators
  2. Analysis: Examine the structure of arguments and identify logical patterns
  3. Evaluation: Determine the validity of arguments using truth tables or rules
  4. Construction: Build valid arguments using proper logical forms
  5. Verification: Check reasoning for common fallacies and errors
  6. Application: Use logical reasoning to solve mathematical and real-world problems
Tip 1: Always distinguish between the truth of individual statements and the validity of the logical connection between them.
Tip 2: Remember that in geometry, many theorems are stated as conditional statements. Understanding logical structure helps in proofs.
Tip 3: Practice constructing converses, inverses, and contrapositives for various geometric statements.
Tip 4: Use counterexamples to disprove statements. One counterexample is sufficient to show that a general statement is false.
Tip 5: In geometric proofs, each step should follow logically from previous steps or given information.
Common errors: Confusing logical equivalence with causal relationship, reversing conditional statements incorrectly, failing to recognize logical implications.
Memorization aids: "MTFF" for conditional (Only False when True→False), "Switch and negate" for contrapositive, "Both or neither" for biconditional.
Important Logical Equivalences:

• Double Negation: ¬(¬p) ≡ p

• Contrapositive: p → q ≡ ¬q → ¬p

• De Morgan's Laws: ¬(p ∧ q) ≡ ¬p ∨ ¬q and ¬(p ∨ q) ≡ ¬p ∧ ¬q

• Implication: p → q ≡ ¬p ∨ q

• Biconditional: p ↔ q ≡ (p → q) ∧ (q → p)

• Exportation: (p ∧ q) → r ≡ p → (q → r)

Valid Argument Forms:

Modus Ponens: p → q, p ⊢ q

Modus Tollens: p → q, ¬q ⊢ ¬p

Law of Syllogism: p → q, q → r ⊢ p → r

Disjunctive Syllogism: p ∨ q, ¬p ⊢ q

Conjunction: p, q ⊢ p ∧ q

Common Logical Fallacies:

• Affirming the Consequent: p → q, q ⊢ p

• Denying the Antecedent: p → q, ¬p ⊢ ¬q

• Circular Reasoning: Assuming the conclusion in the premises

• Hasty Generalization: Drawing broad conclusions from insufficient evidence

• False Dilemma: Presenting only two options when more exist

Questions & Answers

Question: I'm struggling to distinguish between the converse and contrapositive of a conditional statement. Can you explain the difference more clearly?

Answer: Great question! Let me break down the differences using the conditional "If p, then q" (p → q):

  • Original: p → q ("If p, then q")
  • Converse: q → p ("If q, then p") - Only switch p and q
  • Inverse: ¬p → ¬q ("If not p, then not q") - Only negate both p and q
  • Contrapositive: ¬q → ¬p ("If not q, then not p") - Switch AND negate p and q

Memory trick: "Contrapositive = Contradict the positive" - you switch the positions and negate both parts.

Key insight: The original and contrapositive are logically equivalent (same truth value), but the converse and inverse are equivalent to each other, not to the original.

Example: "If it's raining, then the ground is wet."

  • Converse: "If the ground is wet, then it's raining" (not necessarily true)
  • Contrapositive: "If the ground is not wet, then it's not raining" (logically equivalent to original)

Question: How do I know when a biconditional statement is true? Is it enough for just one direction to be true?

Answer: No, a biconditional statement "p if and only if q" (p ↔ q) requires BOTH directions to be true:

  • p → q (if p then q) must be true
  • q → p (if q then p) must be true

Think of a biconditional as "both ways": if p is true, then q must be true, AND if q is true, then p must be true.

Example: "A triangle is equilateral if and only if all its angles are 60°"

  • Forward: If equilateral → all angles 60° (TRUE)
  • Backward: If all angles 60° → equilateral (TRUE)

Since both directions are true, the biconditional is true.

If either direction were false, the entire biconditional would be false.

Question: I often get confused about when to use truth tables versus other methods for analyzing logical statements. When should I use truth tables?

Answer: Truth tables are especially useful in these situations:

  1. Complex compound statements: When you have multiple logical operators, truth tables provide a systematic way to evaluate all possibilities
  2. Checking logical equivalence: To verify if two statements are equivalent, construct truth tables for both and compare columns
  3. Identifying tautologies/contradictions: Truth tables clearly show if a statement is always true (tautology) or always false (contradiction)
  4. Verifying argument validity: You can check if the conclusion is true whenever all premises are true

However, for simple statements or when you need to prove something generally, other methods might be more efficient. Truth tables become unwieldy with many variables (2^n rows for n variables).

As a rule of thumb: Use truth tables for verification and small problems, but develop logical intuition for more complex reasoning.

Question: What's the difference between deductive and inductive reasoning, and which one is more reliable?

Answer: Here are the key differences:

  • Deductive reasoning: Goes from general principles to specific conclusions. If premises are true and logic is valid, the conclusion must be true.
  • Inductive reasoning: Goes from specific observations to general conclusions. Conclusions are probable but not certain.

Example of deduction: "All squares have four right angles. This shape is a square. Therefore, it has four right angles."

Example of induction: "Every swan I've seen is white. Therefore, all swans are white."

Deductive reasoning is more reliable because it preserves truth (valid + sound = true conclusion). Inductive reasoning is probabilistic and can lead to false conclusions even from true premises.

In mathematics and geometry, we primarily use deductive reasoning because we need certainty in our proofs.

Question: How can I get better at spotting logical fallacies in arguments?

Answer: Here are strategies to identify logical fallacies:

  1. Know the common fallacies: Study fallacies like affirming the consequent, circular reasoning, false dilemma, etc.
  2. Trace the logical chain: Follow the argument from premises to conclusion step by step
  3. Look for gaps: Does the conclusion really follow from the premises?
  4. Test with examples: Try specific cases to see if the reasoning holds
  5. Question assumptions: Are any unstated assumptions required for the argument to work?
  6. Consider alternatives: Could the premises be true while the conclusion is false?

Practice with many examples. Over time, you'll develop an instinct for when arguments don't quite add up.

Remember: A true conclusion doesn't mean the argument is valid. Focus on the logical connection, not just the outcome.