Solved Exercises on Logical Reasoning in Grade 8

Master logical reasoning: conditional statements, logical connectives, truth tables, and systematic reasoning through these 5 detailed exercises.

Solution: Exercises 1 to 3
1 Conditional Statements
Exercise 1
Consider the statement: "If it rains, then the ground gets wet." Identify the hypothesis, conclusion, and determine if the statement is true or false in each scenario: (a) It rains and the ground is wet, (b) It rains and the ground is dry, (c) It doesn't rain and the ground is wet, (d) It doesn't rain and the ground is dry.
Definition:

Conditional statement: A statement of the form "If P, then Q" where P is the hypothesis and Q is the conclusion

Hypothesis: The "if" part of the conditional statement

Conclusion: The "then" part of the conditional statement

Truth evaluation method:
  1. Identify P (hypothesis) and Q (conclusion)
  2. Apply the logical rule: A conditional is false only when P is true and Q is false
  3. Truth table: If P is true and Q is true → conditional is true
  4. Truth table: If P is true and Q is false → conditional is false
  5. Truth table: If P is false → conditional is true regardless of Q
Statement
If P then Q
P = "It rains"
Q = "Ground is wet"
Truth table
See below
Step 1: Identify components

Hypothesis (P): "It rains"

Conclusion (Q): "The ground gets wet"

Step 2: Analyze scenario (a)

P is true (it rains), Q is true (ground is wet)

If P is true and Q is true → conditional is TRUE

Step 3: Analyze scenario (b)

P is true (it rains), Q is false (ground is dry)

If P is true and Q is false → conditional is FALSE

Step 4: Analyze scenarios (c) and (d)

Both have P false (no rain), regardless of Q

When P is false → conditional is ALWAYS TRUE

ScenarioP (Rain)Q (Wet)If P then Q
(a) Rain & WetTrueTrueTrue
(b) Rain & DryTrueFalseFalse
(c) No Rain & WetFalseTrueTrue
(d) No Rain & DryFalseFalseTrue
Final answer:

(a) True, (b) False, (c) True, (d) True

Applied rules:

Conditional logic: A conditional is false only when hypothesis is true and conclusion is false

Truth preservation: When hypothesis is false, the conditional is automatically true

Logical analysis: Separate hypothesis from conclusion for evaluation

2 Logical Connectives ("AND")
Exercise 2
Determine the truth value of the compound statement: "Today is Monday AND it is raining" in each scenario: (a) Today is Monday and it's raining, (b) Today is Monday and it's not raining, (c) Today is not Monday and it's raining, (d) Today is not Monday and it's not raining.
Definition:

Logical conjunction (AND): A compound statement is true only when both parts are true

Truth table for AND: P ∧ Q is true only when both P and Q are true

Statement
P ∧ Q
P = "Monday"
Q = "Raining"
Result
See below
Step 1: Identify components

P: "Today is Monday"

Q: "It is raining"

Step 2: Apply AND logic

P ∧ Q is true only when both P and Q are true

If either P or Q (or both) is false, then P ∧ Q is false

Step 3: Evaluate each scenario

(a) P = True, Q = True → P ∧ Q = True

(b) P = True, Q = False → P ∧ Q = False

(c) P = False, Q = True → P ∧ Q = False

(d) P = False, Q = False → P ∧ Q = False

ScenarioP (Monday)Q (Raining)P ∧ Q
(a) Mon & RainTrueTrueTrue
(b) Mon & No RainTrueFalseFalse
(c) Not Mon & RainFalseTrueFalse
(d) Not Mon & No RainFalseFalseFalse
Final answer:

(a) True, (b) False, (c) False, (d) False

Applied rules:

AND logic: Both statements must be true for the compound to be true

Truth requirement: Only one false makes the entire compound false

Conjunction principle: More restrictive than disjunction

3 Logical Connectives ("OR")
Exercise 3
Determine the truth value of the compound statement: "I will study OR I will watch TV" in each scenario: (a) I study and watch TV, (b) I study and don't watch TV, (c) I don't study and watch TV, (d) I don't study and don't watch TV.
Definition:

Logical disjunction (OR): A compound statement is true when at least one part is true

Truth table for OR: P ∨ Q is false only when both P and Q are false

Statement
P ∨ Q
P = "Study"
Q = "Watch TV"
Result
See below
Step 1: Identify components

P: "I will study"

Q: "I will watch TV"

Step 2: Apply OR logic

P ∨ Q is true when at least one of P or Q is true

P ∨ Q is false only when both P and Q are false

Step 3: Evaluate each scenario

(a) P = True, Q = True → P ∨ Q = True

(b) P = True, Q = False → P ∨ Q = True

(c) P = False, Q = True → P ∨ Q = True

(d) P = False, Q = False → P ∨ Q = False

Step 4: Verify the pattern

Only scenario (d) results in False because both components are false

ScenarioP (Study)Q (TV)P ∨ Q
(a) Study & TVTrueTrueTrue
(b) Study & No TVTrueFalseTrue
(c) No Study & TVFalseTrueTrue
(d) No Study & No TVFalseFalseFalse
Final answer:

(a) True, (b) True, (c) True, (d) False

Applied rules:

OR logic: At least one statement must be true for the compound to be true

Truth flexibility: Only requires one true component

Disjunction principle: Less restrictive than conjunction

Logical Reasoning Fundamentals
\(\text{If P then Q: } P \rightarrow Q\)
Conditional Statement
Conjunction (AND)
\(\text{P} \land \text{Q}\)
True only when both P and Q are true
Disjunction (OR)
\(\text{P} \lor \text{Q}\)
True when at least one of P or Q is true
Negation (NOT)
\(\neg \text{P}\)
True when P is false, false when P is true
Key definitions:

Logical reasoning: Using valid arguments to reach conclusions based on given premises

Proposition: A statement that is either true or false

Truth value: Whether a proposition is true or false

Complete methodology:
  1. Identify propositions: Break complex statements into simple parts
  2. Recognize connectives: AND, OR, NOT, IF-THEN
  3. Apply logical rules: Use established truth tables
  4. Construct truth tables: For systematic analysis
  5. Verify conclusions: Check logical consistency
Tip 1: In conditionals, focus on when the hypothesis is true.
Tip 2: Remember that "OR" means at least one, not exclusively one.
Tip 3: When negating, switch true to false and vice versa.
Tip 4: Draw truth tables for complex logical expressions.
Common errors: Confusing AND/OR, misinterpreting conditionals, neglecting negations.
Exam preparation: Master truth tables, practice with various connectives, understand conditional logic.
Solution: Exercises 4 to 5
4 Logical Negation
Exercise 4
Find the negation of each statement and determine its truth value: (a) "All birds can fly", (b) "Some cats are black", (c) "No fish live on land", (d) "Every student passed the exam".
Definition:

Negation: The opposite of a statement that has the opposite truth value

Universal quantifier negation: ¬(∀x, P(x)) ≡ ∃x, ¬P(x)

Existential quantifier negation: ¬(∃x, P(x)) ≡ ∀x, ¬P(x)

Original
¬(Original)
"All" → "Not all"
"Some are not"
"Some" → "Not some"
"None are"
Step 1: Negate statement (a)

Original: "All birds can fly"

Negation: "Not all birds can fly" or "Some birds cannot fly"

Step 2: Negate statement (b)

Original: "Some cats are black"

Negation: "Not some cats are black" or "No cats are black"

Step 3: Negate statement (c)

Original: "No fish live on land"

Negation: "Some fish live on land"

Step 4: Negate statement (d)

Original: "Every student passed the exam"

Negation: "Not every student passed the exam" or "Some students did not pass"

Step 5: Truth value analysis

Original (a) is false → Negation is true

Original (b) is true → Negation is false

Original (c) is true → Negation is false

Original (d) depends on context → Negation has opposite truth value

StatementNegationTruth Value
All birds can flySome birds cannot flyTrue
Some cats are blackNo cats are blackFalse
No fish live on landSome fish live on landFalse
Every student passedSome didn't passContext-dependent
Final answer:

(a) Some birds cannot fly, (b) No cats are black, (c) Some fish live on land, (d) Some students did not pass

Applied rules:

Negation principle: Switch true to false and vice versa

Quantifier rules: "All" becomes "not all" (some aren't)

Contrapositive logic: Maintain logical equivalence

5 Logical Reasoning Puzzle
Exercise 5
Three friends - Alex, Ben, and Carol - are sitting in a row. We know: (1) Alex is not sitting in the middle, (2) Carol is not sitting on the right, (3) Ben is not sitting on the left. Who is sitting where?
Definition:

Logical deduction: Using given premises to eliminate possibilities systematically

Process of elimination: Removing impossible options until only valid ones remain

Positions
Left, Middle, Right
People
Alex, Ben, Carol
Constraints
See below
Step 1: List all constraints

(1) Alex is not in the middle

(2) Carol is not on the right

(3) Ben is not on the left

Step 2: Analyze constraint (1)

Alex can be on the left or right, but not in the middle

Step 3: Analyze constraint (2)

Carol can be on the left or middle, but not on the right

Step 4: Analyze constraint (3)

Ben can be in the middle or right, but not on the left

Step 5: Combine constraints

Carol cannot be on the right, so Carol is on the left or middle

Ben cannot be on the left, so Ben is in the middle or right

Since Carol could be on the left, let's try that first

Step 6: Test Carol on the left

If Carol is on the left, Ben must be in the middle or right

Alex cannot be in the middle, so if Ben is in the middle, Alex must be on the right

This satisfies all constraints: Carol(left), Ben(middle), Alex(right)

Carol is on the left, Ben is in the middle, Alex is on the right
Final answer:

From left to right: Carol, Ben, Alex

Applied rules:

Constraint satisfaction: All conditions must be met simultaneously

Systematic elimination: Remove impossible combinations

Logical inference: Draw conclusions from multiple premises

Logical Reasoning Summary and Key Concepts
\(\text{P} \rightarrow \text{Q} \equiv \neg\text{P} \lor \text{Q}\)
Conditional Equivalence
Key definitions:

Proposition: A statement that is either true or false, but not both

Logical connective: Words like AND, OR, NOT that combine propositions

Truth table: A table showing all possible truth values of a logical expression

Valid argument: An argument where true premises guarantee a true conclusion

Sound argument: A valid argument with all true premises

Complete methodology:
  1. Proposition identification: Recognize statements that have truth values
  2. Connective recognition: Identify logical operators (AND, OR, NOT, IF-THEN)
  3. Structure analysis: Determine how propositions are connected
  4. Truth evaluation: Apply logical rules to determine truth values
  5. Reasoning validation: Check if conclusions follow logically from premises
Tip 1: Always distinguish between "if P then Q" and "if Q then P" (converse).
Tip 2: In conditionals, when the hypothesis is false, the statement is always true.
Tip 3: "OR" in logic includes the possibility of both being true.
Tip 4: Draw Venn diagrams to visualize logical relationships.
Tip 5: Practice constructing truth tables for complex expressions.
Common errors: Confusing conditional with biconditional, misapplying negation rules, overlooking edge cases.
Logical equivalences: P→Q ≡ ¬P∨Q, P↔Q ≡ (P→Q)∧(Q→P), De Morgan's laws.
Reasoning types: Deductive (general to specific), inductive (specific to general), abductive (best explanation).
Essential logical laws:

Law of non-contradiction: A statement cannot be both true and false

Law of excluded middle: A statement is either true or false

De Morgan's laws: ¬(P∧Q) ≡ ¬P∨¬Q and ¬(P∨Q) ≡ ¬P∧¬Q

Modus ponens: If P→Q and P are true, then Q is true

Modus tollens: If P→Q and ¬Q are true, then ¬P is true

Questions & Answers

Question: I don't understand why "If P then Q" is considered true when P is false. Shouldn't we not be able to determine anything?

Answer: This is a common point of confusion! The key is understanding what "If P then Q" means logically:

The statement "If P then Q" is really saying: "It's never the case that P is true while Q is false."

So when P is false:

  • We don't have a situation where P is true and Q is false
  • The condition "P true and Q false" is not violated
  • Therefore, the statement holds true

Think of it like a promise: "If you clean your room, then you can go out to play." If you don't clean your room, the promise isn't broken regardless of whether you go out to play or not. The promise only fails if you clean your room but still can't go out to play.

Question: How do I know whether "OR" in a logical statement means inclusive OR or exclusive OR?

Answer: In formal logic, "OR" always means inclusive OR unless explicitly stated otherwise:

Inclusive OR (standard logic): "P OR Q" is true when P is true, Q is true, or both are true

Exclusive OR (special notation): "P XOR Q" or "P ⊕ Q" is true only when exactly one of P or Q is true

In word problems:

  • Look for phrases like "either...or" which often implies exclusive
  • Look for "at least one" which implies inclusive
  • When in doubt, assume inclusive OR in formal logic contexts

For example: "You can have soup OR salad" typically means you can have both in logic, but might mean exclusive in everyday conversation.

Question: How do I construct a truth table for a complex logical expression?

Answer: Here's a systematic approach:

  1. Count variables: If you have n variables, you'll need 2^n rows
  2. Create columns: One for each variable, then for each subexpression
  3. Fill variable columns: Use binary counting pattern (00, 01, 10, 11 for 2 variables)
  4. Evaluate step by step: Calculate simpler expressions before complex ones
  5. Complete the table: Work from left to right, top to bottom

Example for (P ∧ Q) ∨ R:

P | Q | R | P∧Q | (P∧Q)∨R
--|---|---|-----|--------
0 | 0 | 0 |  0  |   0
0 | 0 | 1 |  0  |   1
0 | 1 | 0 |  0  |   0
0 | 1 | 1 |  0  |   1
1 | 0 | 0 |  0  |   0
1 | 0 | 1 |  0  |   1
1 | 1 | 0 |  1  |   1
1 | 1 | 1 |  1  |   1
        

Always evaluate parentheses first, then follow operator precedence!

Question: What's the difference between "valid" and "sound" in logical arguments?

Answer: These are distinct concepts:

Valid argument: The conclusion logically follows from the premises. If the premises are true, the conclusion must be true. Validity is about the logical structure.

Sound argument: An argument that is both valid AND has all true premises. Soundness is about both structure and content.

Example of valid but not sound:

  • Premise 1: All birds can fly
  • Premise 2: Penguins are birds
  • Conclusion: Penguins can fly

This argument is valid (the conclusion follows logically), but not sound (the first premise is false).

For an argument to be sound, it must be valid and all premises must actually be true.

Question: How do I approach logical reasoning puzzles systematically?

Answer: Use this systematic approach:

  1. List all entities: Identify all people, places, or things involved
  2. Identify constraints: Write down all the rules and restrictions
  3. Start with definite positions: Look for clues that place someone definitely
  4. Use process of elimination: Cross off impossible arrangements
  5. Test assumptions: If stuck, try a possibility and see if it leads to contradiction
  6. Track implications: When you place someone, update what else must be true

For example, if you know "Alex is not in the middle" and there are only 3 positions, Alex must be in position 1 or 3. This immediately eliminates one possibility for Alex and might help place others.

Always double-check that your final answer satisfies all the original constraints!