CMClearMathAcademy

Simplifying Logical Statements

A free Logic lesson from the “Logical Equivalence” unit, with a worked example and practice problems including step-by-step solutions.

Logical simplification removes unnecessary double negatives and rewrites statements in clearer equivalent forms. Learning objective: Simplify statements while preserving meaning. Prerequisite: No formal prerequisite. Work in this lesson starts with ordinary language, then connects the idea to symbols only after the meaning is clear. Example 1: ¬(p ∧ q) is equivalent to ¬p ∨ ¬q. Example 2: A conditional is equivalent to its contrapositive, not necessarily to its converse. A common misconception is to treat familiar wording as proof; instead, check exactly what the statement says and what follows from it.

What you'll learn

Why it matters: Equivalent statements let students rewrite claims without changing meaning, a key habit in algebra and proof.

Worked example

Problem. Example case A (Simplifying Logical Statements): Worked example: Which rule or habit best matches Simplifying Logical Statements?

  1. Simplifying Logical Statements targets a specific reasoning habit.
  2. Simplifying Logical Statements focuses on simplify statements while preserving meaning.
  3. The other choices either overclaim or change the logical relationship.

Answer: Simplifying Logical Statements focuses on simplify statements while preserving meaning.

Practice problems

1. Practice case A (Simplifying Logical Statements): Using De Morgan's Law, which statement is equivalent to ¬(p ∧ q)?

Choices: ¬p ∨ ¬q · ¬p ∧ ¬q · p ∨ q · p ∧ ¬q

Show solution
  1. Warm-up: First identify exactly what the question is asking: Practice case A (Simplifying Logical Statements): Using De Morgan's Law, which statement is equivalent to ¬(p ∧ q)?
  2. Use De Morgan's Laws: negating an and statement changes it to or, and negating an or statement changes it to and.
  3. Use De Morgan's Law.
  4. Negating an and changes it to or.
  5. Negate both parts: ¬p ∨ ¬q.
  6. Verify the selected choice by checking that it preserves the stated logical meaning and that the other choices change the rule or claim.

Answer: ¬p ∨ ¬q

2. Practice case B (Simplifying Logical Statements): Using De Morgan's Law, which statement is equivalent to ¬(p ∨ q)?

Choices: ¬p ∧ ¬q · ¬p ∨ ¬q · p ∧ q · p → q

Show solution
  1. Warm-up: First identify exactly what the question is asking: Practice case B (Simplifying Logical Statements): Using De Morgan's Law, which statement is equivalent to ¬(p ∨ q)?
  2. Use De Morgan's Laws: negating an and statement changes it to or, and negating an or statement changes it to and.
  3. Use De Morgan's Law.
  4. Negating an or changes it to and.
  5. Negate both parts: ¬p ∧ ¬q.
  6. Verify the selected choice by checking that it preserves the stated logical meaning and that the other choices change the rule or claim.

Answer: ¬p ∧ ¬q

3. Practice case C (Simplifying Logical Statements): Which statement is equivalent to p → q?

Choices: ¬q → ¬p · q → p · ¬p → ¬q · p ↔ q

Show solution
  1. Warm-up: First identify exactly what the question is asking: Practice case C (Simplifying Logical Statements): Which statement is equivalent to p → q?
  2. For symbolic logic, translate the symbols into plain English, then apply the truth condition for the connective.
  3. A conditional matches its contrapositive.
  4. Switch and negate both parts.
  5. That gives ¬q → ¬p.
  6. Verify the selected choice by checking that it preserves the stated logical meaning and that the other choices change the rule or claim.

Answer: ¬q → ¬p

4. Practice case D (Simplifying Logical Statements): How can a truth table show two statements are equivalent?

Choices: Their final columns match in every row. · They use the same number of letters. · One statement is longer. · Both contain an arrow.

Show solution
  1. Equivalence means same truth value in every case.
  2. Truth tables list every case.
  3. Matching final columns prove equivalence.

Answer: Their final columns match in every row.

5. Practice case E (Simplifying Logical Statements): Lesson focus: Which transfer task would show readiness for Simplifying Logical Statements?

Choices: Apply simplify statements while preserving meaning in a new sentence or context. · Repeat the exact worked example without changing the context. · Pick an answer before identifying the claim parts. · Use a rule from another lesson because the words sound close.

Show solution
  1. A transfer task keeps the same objective but changes the surface context.
  2. Apply simplify statements while preserving meaning in a new sentence or context.
  3. That is a better mastery signal than memorizing a practice prompt.

Answer: Apply simplify statements while preserving meaning in a new sentence or context.

Practice this interactively with instant feedback and an AI tutor.

Practice Simplifying Logical Statements Take the free placement check

More Logic lessons