Read
Build the mental model
Move through the guided explanation first so the central distinction and purpose are clear before you evaluate your own work.
Mathematical Foundations
Operations on Sets
Introduces the standard set operations — union, intersection, complement, difference, symmetric difference, power set, and Cartesian product — and teaches students to verify results by element-chasing and visualize simple cases using Venn diagrams.
Read the explanation sections first, then use the activities to test whether you can apply the idea under pressure.
Start Here
What this lesson is helping you do
Introduces the standard set operations — union, intersection, complement, difference, symmetric difference, power set, and Cartesian product — and teaches students to verify results by element-chasing and visualize simple cases using Venn diagrams. The practice in this lesson depends on understanding Set, Subset, Power Set, and Cartesian Product and applying tools such as Axiom of Extensionality and Russell's Paradox Restriction correctly.
How to approach it
Read the explanation sections first, then use the activities to test whether you can apply the idea under pressure.
What the practice is building
You will put the explanation to work through formalization practice, quiz, proof construction, evaluation practice, analysis practice, rapid identification, and diagnosis practice activities, so the goal is not just to recognize the idea but to use it under your own control.
What success should let you do
Correctly compute 8 set-operation results on small concrete sets (at least one each of union, intersection, difference, symmetric difference, complement, power set, and Cartesian product) and justify each computation by referring to the defining condition.
Reading Path
Move through the lesson in this order
The page is designed to teach before it tests. Use this sequence to keep the reading, examples, and practice in the right relationship.
Study
Watch the move in context
Use the worked examples to see how the reasoning behaves when someone else performs it carefully.
Do
Practice with a standard
Only then move into the activities, using the pause-and-check prompts as a final checkpoint before you submit.
Guided Explanation
Read this before you try the activity
These sections give the learner a usable mental model first, so the practice feels like application rather than guesswork.
Core operations
Union, intersection, and the logic of argument conditions
The union A ∪ B is the set of all elements that belong to A, to B, or to both. Formally, x ∈ A ∪ B if and only if x ∈ A or x ∈ B. The intersection A ∩ B is the set of elements that belong to both A and B: x ∈ A ∩ B if and only if x ∈ A and x ∈ B. These two operations are the set-theoretic analogues of 'or' and 'and,' and that is not a coincidence. Whenever an argument asks 'which cases satisfy at least one of these conditions,' the answer is a union; whenever it asks 'which cases satisfy both conditions simultaneously,' the answer is an intersection.
Concrete example. Let A = {2, 4, 6, 8} and B = {3, 4, 5, 6}. Then A ∪ B = {2, 3, 4, 5, 6, 8}: every element that appears in either set, with no repetitions because a set is a set. And A ∩ B = {4, 6}: the elements that appear in both. The identity card test is useful here. To check whether a given element belongs to a union, ask 'is it in A or in B?' To check whether it belongs to an intersection, ask 'is it in A and in B?' Answering those two questions settles membership immediately.
What to look for
- For a union, include an element if it belongs to at least one of the operand sets.
- For an intersection, include an element only if it belongs to every operand set.
- Recognize that union corresponds to disjunction and intersection to conjunction in argument evaluation.
Union and intersection are the set-theoretic shadows of 'or' and 'and.' Every membership question about them reduces to the same question about the operand sets.
Expanding the toolkit
Complement, difference, and symmetric difference
The complement of a set is the set of things that are not in it, but this only makes sense relative to some universe of discourse U: the complement A^c is the set of x ∈ U such that x ∉ A. The difference A − B (sometimes written A \ B) is the set of elements that are in A but not in B: x ∈ A − B if and only if x ∈ A and x ∉ B. Note that A − B and B − A are usually different; difference is not symmetric. The symmetric difference A △ B contains elements that are in exactly one of the two sets: x ∈ A △ B if and only if x ∈ A or x ∈ B, but not both. Equivalently, A △ B = (A − B) ∪ (B − A).
Concrete example. With A = {2, 4, 6, 8} and B = {3, 4, 5, 6} again, the difference A − B = {2, 8} is what remains of A once we throw out everything that B also contains, and B − A = {3, 5} is what remains of B once we throw out everything that A also contains. The symmetric difference A △ B = {2, 3, 5, 8} collects the elements that belong to exactly one of the two sets. Set differences correspond to arguments of the form 'the cases that meet condition A but fail condition B,' while symmetric differences correspond to 'cases where exactly one of the two conditions holds.'
What to look for
- Always specify the universe before talking about complements.
- Remember that A − B is usually not equal to B − A.
- Use A △ B to express 'exactly one of the two conditions holds,' and watch for the exclusive-or flavor.
Complement, difference, and symmetric difference correspond to the argument conditions 'not,' 'and not,' and 'exactly one of.' Each has a precise set-theoretic definition you can apply element by element.
Method
Element-chasing: the workhorse technique for verifying identities
Set-theoretic identities like A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C) can always be verified by element-chasing. The method has two directions. To show that the left side is a subset of the right, start with an arbitrary element x of the left side and argue, step by step, that x must also belong to the right side. Then do the same in the other direction: take an arbitrary element of the right side and argue that it belongs to the left. Once both directions are done, the two sets have exactly the same elements, and by extensionality they are equal.
Element-chasing looks mechanical, but it is a real proof technique used throughout mathematics. The secret is to keep it boring. Do not skip steps; do not say 'obviously.' Write 'suppose x ∈ A ∪ (B ∩ C). Then x ∈ A or x ∈ B ∩ C. Case 1: if x ∈ A, then x ∈ A ∪ B and x ∈ A ∪ C, so x ∈ (A ∪ B) ∩ (A ∪ C). Case 2: if x ∈ B ∩ C, then x ∈ B, so x ∈ A ∪ B, and similarly x ∈ A ∪ C, so again x ∈ (A ∪ B) ∩ (A ∪ C). Either way, x belongs to the right side.' That is the level of care you should aim for, because it makes errors visible and keeps the reasoning honest.
What to look for
- To prove an identity, prove ⊆ in both directions.
- Start with 'let x be an arbitrary element of the left side' and chase the membership through each definition.
- Write out case splits explicitly when dealing with unions or disjunctions.
Element-chasing turns set identities into short case-by-case arguments about membership. Discipline is more useful than cleverness.
Set-building operations
Power sets and Cartesian products make new sets
The power set P(A) is the set of all subsets of A. For the three-element set A = {1, 2, 3}, the power set has 2^3 = 8 elements: P(A) = {∅, {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3}}. In general, if A has n elements, then P(A) has 2^n elements, because each element of A can independently be present or absent in a subset. Power sets are how we move from a set to 'the space of all things you could select from it,' which comes up constantly in formal logic and probability.
The Cartesian product A × B is the set of all ordered pairs whose first coordinate is in A and whose second coordinate is in B. For example, if A = {Alice, Bob} and B = {coffee, tea}, then A × B = {(Alice, coffee), (Alice, tea), (Bob, coffee), (Bob, tea)}. If A has m elements and B has n elements, A × B has m × n elements. The Cartesian product is essential because every relation and every function can be defined as a subset of a Cartesian product, which is the central insight of the next lesson.
What to look for
- Remember the rule |P(A)| = 2^|A| for finite sets.
- List the subsets systematically by size to avoid missing any when computing a power set.
- Keep ordered-pair coordinates straight: the first element of A × B comes from A, the second from B.
Power sets and Cartesian products turn sets into new, larger sets, and these constructions are the raw material for relations and functions in the next lesson.
Core Ideas
The main concepts to keep in view
Use these as anchors while you read the example and draft your response. If the concepts blur together, the practice usually blurs too.
Set
A well-defined collection of distinct objects, considered as a single mathematical object; the objects are called elements or members of the set.
Why it matters: The set is the primitive building block of modern mathematics and the semantic foundation on which most formal logic rests.
Subset
A set A is a subset of a set B, written A ⊆ B, if every element of A is also an element of B; A is a proper subset if in addition A ≠ B.
Why it matters: The subset relation is how set theory expresses class inclusion, and distinguishing it from membership is essential to avoid foundational confusion.
Power Set
The power set of a set A, written P(A) or 2^A, is the set whose elements are all the subsets of A, including the empty set and A itself.
Why it matters: The power set operation transforms any set into a new set of higher size and is the source of Cantor's theorem and the first infinite hierarchy of cardinalities.
Cartesian Product
The Cartesian product A × B of two sets is the set of all ordered pairs (a, b) where a ∈ A and b ∈ B.
Why it matters: The Cartesian product turns pairs of sets into a new set and is the construction that lets relations and functions be defined set-theoretically.
Reference
Open these only when you need the extra structure
How the lesson is meant to unfold
Concept Intro
The core idea is defined and separated from nearby confusions.
Rule Or Standard
This step supports the lesson by moving from explanation toward application.
Worked Example
A complete example demonstrates what correct reasoning looks like in context.
Guided Practice
You apply the idea with scaffolding still visible.
Assessment Advice
Use these prompts to judge whether your reasoning meets the standard.
Mastery Check
The final target tells you what successful understanding should enable you to do.
Reasoning tools and formal patterns
Rules and standards
These are the criteria the unit uses to judge whether your reasoning is actually sound.
Axiom of Extensionality
Two sets are equal if and only if they have exactly the same elements; order and repetition of listed elements are irrelevant.
Common failures
- Treating {1, 2, 3} and {3, 2, 1} as different sets because the elements are listed in a different order.
- Treating {1, 1, 2} as a three-element set rather than recognizing it as the two-element set {1, 2}.
Russell's Paradox Restriction
There is no set whose members are exactly those sets that are not members of themselves; naive unrestricted comprehension must be replaced by axiomatic separation or a similar restriction.
Common failures
- Assuming that every describable property carves out a set, which leads to Russell's paradox.
- Treating 'the set of all sets' as a legitimate set without noticing the contradictions it generates.
Subset and Membership Are Different Relations
Membership (∈) and inclusion (⊆) are distinct: x ∈ A means x is one of the elements of A, while A ⊆ B means every element of A is also an element of B.
Common failures
- Writing 1 ⊆ {1, 2} when the correct claim is 1 ∈ {1, 2}.
- Writing {1} ∈ {1, 2} when the correct claim is {1} ⊆ {1, 2}.
Reflexivity, Symmetry, and Transitivity
A relation R on A is reflexive if every element is related to itself, symmetric if a R b implies b R a, and transitive if a R b and b R c imply a R c; an equivalence relation must satisfy all three.
Common failures
- Checking a finite sample of pairs and declaring a relation transitive without verifying that every three-step chain is respected.
- Confusing symmetry with reflexivity, or antisymmetry with asymmetry.
Functions Must Be Well-Defined
A relation f ⊆ A × B is a function only when every element of A is paired with exactly one element of B; no element of A may be missing, and no element of A may be paired with two different outputs.
Common failures
- Defining a 'function' that leaves some elements of the domain without any output.
- Defining a 'function' by a rule that produces two different outputs for the same input under different representations.
Pigeonhole Principle
If a function maps a finite set of size n into a finite set of size m < n, then at least two elements of the domain must share the same image; equivalently, no injection exists from a larger finite set into a smaller one.
Common failures
- Claiming an injection between two finite sets without checking the sizes.
- Using the pigeonhole principle to conclude anything stronger than the existence of a collision, such as identifying which specific elements collide.
Patterns
Use these when you need to turn a messy passage into a cleaner logical structure before evaluating it.
Set-Builder Notation
Input form
natural_language_description
Output form
set_builder_expression
Steps
- Identify the domain from which candidate elements are drawn.
- Write the candidate variable followed by a vertical bar or colon.
- State the defining property the candidate must satisfy, using predicate-logic style notation when possible.
- Wrap the whole expression in set braces.
- Verify that the property actually picks out the intended collection by checking a few test elements.
Watch for
- Leaving the domain unspecified, so the builder could describe a proper class rather than a set.
- Mixing up membership and inclusion inside the defining predicate.
- Writing a property that is vacuously true for every candidate, producing the entire domain by accident.
Relation as a Set of Ordered Pairs
Input form
natural_language_relation
Output form
subset_of_cartesian_product
Steps
- Identify the source set A and the target set B the relation connects.
- Form the Cartesian product A × B as the space of all possible ordered pairs.
- Write the relation as the subset R ⊆ A × B containing exactly the pairs (a, b) for which a is related to b.
- Check each of reflexivity, symmetry, transitivity, and antisymmetry by inspecting the pairs.
- If the relation is functional, verify that each element of A appears as the first coordinate of exactly one pair.
Watch for
- Listing unordered pairs when the relation is not symmetric.
- Forgetting reflexive pairs (a, a) when the relation actually does relate every element to itself.
- Treating a relation on A as if it were a relation from A to some other set, mislabeling the source and target.
Worked Through
Examples that model the standard before you try it
Do not skim these. A worked example earns its place when you can point to the exact move it is modeling and the mistake it is trying to prevent.
Worked Example
Union, Intersection, and Difference on Small Sets
Compute each operation by running through every element of the operand sets and applying the defining condition. Union is 'or,' intersection is 'and,' difference is 'and not,' and symmetric difference is 'exactly one of.'
Content
- Let A = {2, 4, 6, 8} and B = {3, 4, 5, 6}.
- A ∪ B = {2, 3, 4, 5, 6, 8}.
- A ∩ B = {4, 6}.
- A − B = {2, 8} (the elements of A that B does not contain).
- B − A = {3, 5} (the elements of B that A does not contain).
- A △ B = (A − B) ∪ (B − A) = {2, 3, 5, 8}.
Worked Example
Power Set of {1, 2, 3}
When computing a power set, order your listing by subset size. That habit prevents you from missing subsets and makes the 2^n count obvious.
Content
- Let A = {1, 2, 3}.
- P(A) has 2^3 = 8 elements.
- P(A) = { ∅, {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3} }.
- Listed systematically by size: one empty set, three singletons, three pairs, one full set.
Pause and Check
Questions to use before you move into practice
Self-check questions
- For each operation, can I state its defining condition in terms of 'and,' 'or,' or 'not'?
- Can I compute unions, intersections, differences, and symmetric differences on small numeric sets without using a diagram?
- Can I list all 2^n subsets of an n-element set systematically?
Practice
Now apply the idea yourself
Move into practice only after you can name the standard you are using and the structure you are trying to preserve or evaluate.
Formalization Practice
DeductiveCompute and Verify
For each item, compute the requested set by applying the relevant operation, then express briefly how the result corresponds to an argument-evaluation condition (e.g., 'both conditions hold,' 'at least one holds').
Set operations in action
Throughout this activity, take A = {1, 2, 3, 4}, B = {3, 4, 5, 6}, C = {2, 4, 6}, and universe U = {1, 2, 3, 4, 5, 6, 7, 8}.
Item A
Compute A ∪ B and state which elements appear because they were in A, which because they were in B, and which because they were in both.
Element-by-element breakdown of a union.
Item B
Compute A ∩ C and explain why 4 is an element of the result while 3 is not.
Intersection requires membership in every operand.
Item C
Compute A − B and B − A and verify that they are different sets.
Difference is not symmetric.
Item D
Compute B^c relative to U and say which elements of U survived because they were not in B.
Complement relative to a stated universe.
Item E
Compute A △ C and explain the result in terms of the phrase 'exactly one of A or C.'
Symmetric difference as exclusive or.
Item F
Compute P({a, b}) and list its four elements explicitly.
Power set of a two-element set.
Item G
Compute {0, 1} × {x, y} and list its four ordered pairs in the canonical order.
Cartesian product of two small sets.
Choose one of the arguments above, assign sentence letters, and translate the premises and conclusion into symbolic form.
Quiz
DeductiveOperations Check
Answer each short question directly. Keep justifications brief but explicit.
Short-answer check on operations
These questions test whether the definitions and identities from this lesson are fluent for you.
Question 1
State the rule |P(A)| = 2^|A| and explain, in one sentence, why it holds.
Formula and the one-sentence combinatorial explanation.
Question 2
Is union commutative? Is difference commutative? Justify each answer with a one-line example.
Commutativity of operations.
Question 3
Give two sets A and B for which A △ B = A ∪ B, and explain what must be true about A ∩ B for this to happen.
Symmetric difference equals union precisely when the sets are disjoint.
Question 4
Using element-chasing language (no full proof), explain why A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C).
Distributivity of intersection over union, explained in chase-style terms.
Proof Draft
LineStatementJustificationAction
1
2
3
Formalization Practice
DeductiveFormalization Drill: Operations on Sets
Translate each natural-language argument into formal notation. Identify the logical form and check whether the argument is valid.
Practice scenarios
Work through each scenario carefully. Apply the concepts from this lesson.
Argument 1
If the server crashes, then the backup activates. If the backup activates, then an alert is sent. The server crashed. What follows?
Argument 2
Either the contract is valid or the parties must renegotiate. The contract is not valid. What follows?
Argument 3
All databases store records. This system does not store records. What can we conclude about this system?
Choose one of the arguments above, assign sentence letters, and translate the premises and conclusion into symbolic form.
Proof Construction
DeductiveProof Practice: Operations on Sets
Construct a step-by-step proof or derivation for each argument. Justify every step with the rule you are applying.
Practice scenarios
Work through each scenario carefully. Apply the concepts from this lesson.
Prove
From premises: (1) P -> Q, (2) Q -> R, (3) P. Derive R.
Prove
From premises: (1) A v B, (2) A -> C, (3) B -> C. Derive C.
Prove
From premises: (1) ~(P & Q), (2) P. Derive ~Q.
Proof Draft
LineStatementJustificationAction
1
2
3
Evaluation Practice
DeductiveValidity Check: Operations on Sets
Determine whether each argument is deductively valid. If invalid, describe a counterexample where the premises are true but the conclusion is false.
Practice scenarios
Work through each scenario carefully. Apply the concepts from this lesson.
Argument A
All philosophers study logic. Socrates is a philosopher. Therefore, Socrates studies logic.
Argument B
If it rains, the ground is wet. The ground is wet. Therefore, it rained.
Argument C
No birds are mammals. Some mammals fly. Therefore, some things that fly are not birds.
Argument D
Either the door is locked or the alarm is on. The door is not locked. Therefore, the alarm is on.
Proof Draft
LineStatementJustificationAction
1
2
3
Proof Construction
DeductiveDeep Practice: Operations on Sets
Work through these challenging exercises. Each one requires careful application of formal reasoning. Show your work step by step.
Challenging derivations
Prove each conclusion from the given premises. Label every inference rule you use.
Challenge 1
Premises: (1) (A & B) -> C, (2) D -> A, (3) D -> B, (4) D. Derive: C.
Challenge 2
Premises: (1) P -> (Q & R), (2) R -> S, (3) ~S. Derive: ~P.
Challenge 3
Premises: (1) A v B, (2) A -> (C & D), (3) B -> (C & E). Derive: C.
Challenge 4
Premises: (1) ~(P & Q), (2) P v Q, (3) P -> R, (4) Q -> S. Derive: R v S.
Proof Draft
LineStatementJustificationAction
1
2
3
Analysis Practice
DeductiveReal-World Transfer: Operations on Sets
Apply formal logic to real-world contexts. Translate each scenario into formal notation, determine validity, and explain the practical implications.
Logic in the wild
These scenarios come from law, science, and everyday reasoning. Formalize and evaluate each.
Legal reasoning
A contract states: 'If the product is defective AND the buyer reports within 30 days, THEN a full refund will be issued.' The product was defective. The buyer reported on day 35. The company denies the refund. Is the company's position logically valid?
Medical reasoning
A diagnostic protocol states: 'If the patient has fever AND cough, test for flu. If the flu test is negative AND symptoms persist for 7+ days, test for bacterial infection.' A patient has a cough but no fever. What does the protocol require?
Policy reasoning
A policy reads: 'Students may graduate early IF they complete all required courses AND maintain a 3.5 GPA OR receive special faculty approval.' Due to the ambiguity of OR, identify the two possible readings and explain what difference they make.
Proof Draft
LineStatementJustificationAction
1
2
3
Rapid Identification
DeductiveTimed Drill: Operations on Sets
Work through these quickly. For each mini-scenario, identify the logical form, name the rule used, and state whether the inference is valid. Aim for accuracy under time pressure.
Quick-fire logic identification
Identify the logical form and validity of each argument in under 60 seconds per item.
Item 1
If the reactor overheats, the failsafe triggers. The failsafe triggered. Therefore, the reactor overheated.
Item 2
All licensed pilots passed the medical exam. Jenkins is a licensed pilot. Therefore, Jenkins passed the medical exam.
Item 3
Either the encryption key expired or someone changed the password. The encryption key did not expire. Therefore, someone changed the password.
Item 4
If taxes increase, consumer spending decreases. Consumer spending has not decreased. Therefore, taxes have not increased.
Item 5
No insured vehicle was towed. This vehicle was towed. Therefore, this vehicle is not insured.
Item 6
If the sample is contaminated, then the results are unreliable. The sample is contaminated. Therefore, the results are unreliable.
Proof Draft
LineStatementJustificationAction
1
2
3
Evaluation Practice
DeductivePeer Review: Operations on Sets
Below are sample student responses to a logic exercise. Evaluate each response: Is the formalization correct? Is the proof valid? Identify specific errors and suggest corrections.
Evaluate student proofs
Each student attempted to prove a conclusion from given premises. Find and correct any mistakes.
Student A's work
Premises: P -> Q, Q -> R, P. Student wrote: (1) P [premise], (2) P -> Q [premise], (3) Q [MP 1,2], (4) Q -> R [premise], (5) R [MP 3,4]. Conclusion: R. Student says: 'Valid proof by two applications of Modus Ponens.'
Student B's work
Premises: A v B, A -> C. Student wrote: (1) A v B [premise], (2) A -> C [premise], (3) A [from 1], (4) C [MP 2,3]. Conclusion: C. Student says: 'Since A or B is true, A must be true, so C follows.'
Student C's work
Premises: ~P v Q, P. Student wrote: (1) ~P v Q [premise], (2) P [premise], (3) ~~P [DN 2], (4) Q [DS 1,3]. Conclusion: Q. Student says: 'I used double negation then disjunctive syllogism.'
Student D's work
Premises: (P & Q) -> R, P, Q. Student wrote: (1) P [premise], (2) Q [premise], (3) (P & Q) -> R [premise], (4) R [MP 1,3]. Conclusion: R. Student says: 'Modus Ponens with P and the conditional.'
Proof Draft
LineStatementJustificationAction
1
2
3
Proof Construction
DeductiveConstruction Challenge: Operations on Sets
Build complete proofs or arguments from scratch. You are given only a conclusion and some constraints. Construct valid premises and a rigorous derivation.
Build your own proofs
For each task, create a valid argument with explicit premises and step-by-step derivation.
Task 1
Construct a valid argument with exactly three premises that concludes: 'The network is secure.' Use at least one conditional and one disjunction in your premises.
Task 2
Build a valid syllogistic argument that concludes: 'Some scientists are not wealthy.' Your premises must be universal statements (All X are Y or No X are Y).
Task 3
Create a proof using reductio ad absurdum (indirect proof) that derives ~(P & ~P) from no premises. Show every step and justify each with a rule name.
Task 4
Construct a chain of conditional reasoning with at least four steps that connects 'The satellite detects an anomaly' to 'Emergency protocols are activated.' Make each link realistic and name the domain.
Proof Draft
LineStatementJustificationAction
1
2
3
Diagnosis Practice
DeductiveCounterexample Challenge: Operations on Sets
For each invalid argument below, construct a clear counterexample -- a scenario where all premises are true but the conclusion is false. Then explain which logical error the argument commits.
Find counterexamples to invalid arguments
Each argument appears plausible but is invalid. Prove invalidity by constructing a specific counterexample.
Argument 1
If a student studies hard, they pass the exam. Maria passed the exam. Therefore, Maria studied hard.
Argument 2
All roses are flowers. Some flowers are red. Therefore, some roses are red.
Argument 3
No fish can fly. No birds are fish. Therefore, all birds can fly.
Argument 4
If the alarm sounds, there is a fire. The alarm did not sound. Therefore, there is no fire.
Argument 5
All effective medicines have been tested. This substance has been tested. Therefore, this substance is an effective medicine.
Proof Draft
LineStatementJustificationAction
1
2
3
Analysis Practice
DeductiveIntegration Exercise: Operations on Sets
These exercises combine deductive logic with other topics and reasoning styles. Apply formal logic alongside empirical evaluation, explanation assessment, or problem-solving frameworks.
Cross-topic deductive exercises
Each scenario requires deductive reasoning combined with at least one other skill area.
Scenario 1
A quality control team uses this rule: 'If a batch fails two consecutive tests, it must be discarded.' Batch 47 failed Test A and passed Test B, then failed Test C. Formally determine whether the rule requires discarding Batch 47, and discuss whether the rule itself is well-designed from a problem-solving perspective.
Scenario 2
A researcher argues: 'All peer-reviewed studies in this meta-analysis show that X reduces Y. This study shows X reduces Y. Therefore, this study will be included in the meta-analysis.' Evaluate the deductive form, then inductively assess whether the meta-analysis conclusion would be strong.
Scenario 3
An insurance policy states: 'Coverage applies if and only if the damage was caused by a covered peril AND the policyholder reported it within 72 hours.' A policyholder reported water damage after 80 hours, claiming the damage was not discoverable sooner. Apply the formal logic of the policy, then consider whether the best explanation supports an exception.
Scenario 4
A hiring algorithm uses: 'If GPA >= 3.5 AND experience >= 2 years, then advance to interview.' Candidate X has GPA 3.8 and 18 months experience. Formally determine the outcome. Then evaluate: is the algorithm's rule inductively justified? What evidence would you want?
Proof Draft
LineStatementJustificationAction
1
2
3
Diagnosis Practice
DeductiveMisconception Clinic: Operations on Sets
Each item presents a common misconception about deductive logic. Identify the misconception, explain why it is wrong, and provide a correct version of the reasoning.
Common deductive misconceptions
Diagnose and correct each misconception. Explain the error clearly enough for a fellow student to understand.
Misconception 1
A student claims: 'An argument is valid if its conclusion is true. Since the conclusion "Water is H2O" is obviously true, any argument concluding this must be valid.'
Misconception 2
A student says: 'Modus Tollens and denying the antecedent are the same thing. Both involve negation and a conditional, so they must work the same way.'
Misconception 3
A student writes: 'This argument is invalid because the conclusion is false: All cats are reptiles. All reptiles lay eggs. Therefore, all cats lay eggs.'
Misconception 4
A student argues: 'A sound argument can have a false conclusion, because soundness just means the argument uses correct logical rules.'
Misconception 5
A student claims: 'Since P -> Q is equivalent to ~P v Q, we can derive Q from P -> Q alone, without knowing whether P is true.'
Proof Draft
LineStatementJustificationAction
1
2
3
Proof Construction
DeductiveScaffolded Proof: Operations on Sets
Build proofs in stages. Each task gives you a partially completed derivation. Fill in the missing steps, justify each one, and then extend the proof to a further conclusion.
Step-by-step proof building
Complete each partial proof, then extend it. Every step must cite a rule.
Scaffold 1
Premises: (1) (A v B) -> C, (2) D -> A, (3) D. Partial proof: (4) A [MP 2,3]. Your tasks: (a) Complete the proof to derive C. (b) If we add premise (5) C -> E, extend the proof to derive E.
Scaffold 2
Premises: (1) P -> (Q -> R), (2) P, (3) Q. Partial proof: (4) Q -> R [MP 1,2]. Your tasks: (a) Complete the proof to derive R. (b) If we add premise (5) R -> ~S, extend to derive ~S. (c) If we also add (6) S v T, what can you derive?
Scaffold 3
Premises: (1) ~(A & B), (2) A. Your task: Prove ~B step by step. Hint: You may need to use an assumption for indirect proof. Show the subproof structure clearly.
Scaffold 4
Premises: (1) P v Q, (2) P -> R, (3) Q -> S, (4) ~R. Your tasks: (a) Derive ~P from (2) and (4). (b) Using (a), derive Q from (1). (c) Using (b), derive S. (d) Name each rule used.
Proof Draft
LineStatementJustificationAction
1
2
3
Analysis Practice
DeductiveSynthesis Review: Operations on Sets
These exercises require you to combine everything you have learned about deductive reasoning. Each scenario tests multiple skills simultaneously: formalization, rule application, validity checking, and proof construction.
Comprehensive deductive review
Each task combines multiple deductive skills. Show all your work.
Comprehensive 1
A software license agreement states: 'The software may be used commercially if and only if the licensee has purchased an enterprise plan and has fewer than 500 employees, or has received written exemption from the vendor.' Formalize this using propositional logic, determine what follows if a company has an enterprise plan and 600 employees with no exemption, and identify any ambiguity in the original text.
Comprehensive 2
Construct a valid argument with four premises and one conclusion about data privacy. Then create an invalid argument about the same topic that looks similar but commits a formal fallacy. Finally, prove the first is valid and show a counterexample for the second.
Proof Draft
LineStatementJustificationAction
1
2
3
Animated Explainers
Step-by-step visual walkthroughs of key concepts. Click to start.
Read the explanation carefully before jumping to activities!
Further Support
Open these only if you need extra help or context
Mistakes to avoid before submitting
- Do not skip element-chasing steps when checking an identity; cases need to be handled explicitly.
- Do not forget to include ∅ as an element of every power set.
Where students usually go wrong
Reporting A ∪ B with duplicate elements from both sets, forgetting that a set cannot repeat its members.
Assuming A − B is equal to B − A, which is only true in the special case A = B.
Listing only the non-empty subsets when asked for a power set and forgetting the empty set.
Mixing the first and second coordinates when computing a Cartesian product.
Historical context for this way of reasoning
John Venn
Venn introduced the diagrammatic method that now bears his name in 1880. Although Venn diagrams are often associated with categorical logic, their direct interpretation is set-theoretic: each region represents a combination of membership in the labeled sets.