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
What Is a Set?
Introduces sets as collections defined by their members, explains the axiom of extensionality, distinguishes membership from subset, discusses the empty set, and shows why naive unrestricted comprehension collapses into Russell's paradox.
Focus on understanding the core distinction first, then use the examples to see how the idea behaves in actual arguments.
Start Here
What this lesson is helping you do
Introduces sets as collections defined by their members, explains the axiom of extensionality, distinguishes membership from subset, discusses the empty set, and shows why naive unrestricted comprehension collapses into Russell's paradox. The practice in this lesson depends on understanding Set, Element (Member), and Subset and applying tools such as Axiom of Extensionality and Russell's Paradox Restriction correctly.
How to approach it
Focus on understanding the core distinction first, then use the examples to see how the idea behaves in actual arguments.
What the practice is building
You will put the explanation to work through classification practice, quiz, formalization practice, 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 classify 8 set-theoretic claims as true, false, or malformed, and provide a short justification for each that refers to the correct relation (membership or inclusion).
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.
Definition
A set is a collection determined entirely by its members
A set is a collection of distinct objects, considered as a single mathematical object in its own right. The objects in the collection are called its elements or members, and the fundamental question you can ask about any proposed set is simply which things belong to it. When we write the set A = {2, 4, 6}, we mean the unique collection whose elements are exactly the numbers 2, 4, and 6. Nothing else is hidden in the set beyond its membership list.
Because a set is determined by its members and nothing else, order and repetition do not matter. The sets {2, 4, 6}, {6, 4, 2}, and {2, 2, 4, 6, 6} are all the same set: they have exactly the same members. This is the content of the axiom of extensionality, the most basic law of set theory. Two sets are equal if and only if they have the same elements, no matter how they are described or listed.
What to look for
- Treat a set as fully determined by its list of elements.
- Ignore the order in which elements are listed inside the braces.
- Ignore apparent repetitions — an element is either in the set or it isn't.
A set is nothing over and above its elements; extensionality is the rule that makes that slogan precise.
Core distinction
Membership and subset are two different relations
The symbol ∈ expresses membership: x ∈ A says that x is one of the elements of A. The symbol ⊆ expresses inclusion: A ⊆ B says that every element of A is also an element of B. These two relations look similar at a glance, but confusing them is probably the single most common mistake beginners make. When A = {1, 2, 3}, it is correct to write 1 ∈ A, because 1 is an element of A. It is wrong to write 1 ⊆ A, because 1 is a number, not a set, and the subset relation is about sets within sets.
Here is the rule to keep the two straight. If you are asking 'is this thing one of the listed elements,' you are asking about membership and you use ∈. If you are asking 'does everything in this smaller collection also appear in the larger one,' you are asking about inclusion and you use ⊆. For the set A = {1, 2, 3}, we have 1 ∈ A and {1} ⊆ A and {1, 2} ⊆ A, but we do not have 1 ⊆ A or {1} ∈ A (unless A also happens to contain {1} as one of its listed elements).
What to look for
- Use ∈ when asking whether a specific object appears in the set.
- Use ⊆ when asking whether one set is entirely contained in another.
- Read every formula aloud and confirm the preposition matches: 'is in' for ∈ and 'is a subset of' for ⊆.
Membership asks whether something appears in the list; inclusion asks whether every element of one set also appears in another. These are different relations and they require different symbols.
Edge cases
The empty set and nested sets
The empty set, written ∅ or {}, is the unique set that has no elements at all. It is genuinely strange until you get used to it. For every object x, the statement x ∈ ∅ is false, because ∅ has no elements for x to be. At the same time, the statement ∅ ⊆ B is true for every set B, because the claim 'every element of ∅ is in B' has nothing to rule out — it is vacuously true. Uniqueness of the empty set follows from extensionality: two empty sets would have exactly the same elements (namely none), so they must be equal.
Sets can also be elements of other sets. The set {{1, 2}, {3}} has two elements, both of which happen to be sets themselves. Write that set out and ask what it contains: it contains the set {1, 2} and the set {3}. It does not contain the number 1, because 1 is not one of the two listed elements; 1 only appears inside one of the elements. This distinction — between being a member and being a member of a member — is another place where the membership/inclusion confusion reappears in disguise.
What to look for
- Remember that ∅ has no elements but is a subset of every set.
- When a set contains other sets, check membership carefully: the inner elements are not members of the outer set.
- Work out small examples by hand until nested membership feels natural.
The empty set is a subset of everything but a member of almost nothing, and sets of sets require you to track levels of membership carefully.
Russell's paradox
Why naive comprehension has to be restricted
Early set theory assumed that any describable property of objects carves out a set: given a property P, there is a set of all x such that P(x). This is called naive or unrestricted comprehension, and it is appealing because it matches how we usually describe collections in ordinary language. Unfortunately, it leads to a contradiction. Let R be the set of all sets that are not members of themselves: R = {A | A ∉ A}. Now ask whether R is a member of itself. If R ∈ R, then R satisfies the defining property, so R ∉ R. If R ∉ R, then R satisfies the defining property for being in R, so R ∈ R. Either answer contradicts itself.
This is Russell's paradox, and it forces a response. Modern set theory replaces unrestricted comprehension with the axiom schema of separation: given an existing set A and a property P, you may form the subset {x ∈ A | P(x)}. You cannot create a set from a property alone; you have to start with a set that is already known to exist and carve out a subset of it. That single restriction is enough to block Russell's construction, because the paradoxical 'set of all sets that do not contain themselves' is never allowed to be formed in the first place. The cost is that naive collections like 'the set of all sets' are ruled out, but the benefit is consistency.
What to look for
- Recognize that not every describable collection is a set.
- Remember that legitimate set formation starts from a given set and uses separation.
- Treat 'the set of all sets' with suspicion — it is not a set in the modern framework.
Naive comprehension is inconsistent, and the modern response is to restrict how sets can be formed. Separation, not unrestricted comprehension, is the legal tool.
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.
Element (Member)
An object belonging to a set; if x is an element of the set A, we write x ∈ A, and if it is not, we write x ∉ A.
Why it matters: Membership is the one primitive relation of set theory, and every other notion in the unit is defined in terms of it.
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.
Reference
Open these only when you need the extra structure
How the lesson is meant to unfold
Hook
A motivating question or contrast that frames why this lesson matters.
Concept Intro
The core idea is defined and separated from nearby confusions.
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
Extensionality in Action
The order of listing and any apparent repetitions are purely cosmetic. A set is determined by which things belong to it, and that is all.
Content
- Set 1: {1, 2, 3}.
- Set 2: {3, 1, 2}.
- Set 3: {1, 2, 2, 3, 3, 3}.
- By extensionality, these three are all the same set, because they all have exactly the elements 1, 2, and 3.
Worked Example
Nested Membership
When sets contain other sets, always work out membership question by question. Being 'inside' an element is not the same as being a member of the containing set.
Content
- Let A = {1, {2, 3}, 4}.
- Is 2 ∈ A? No. The elements of A are 1, the set {2, 3}, and 4. The number 2 is inside one of those elements, not a member of A directly.
- Is {2, 3} ∈ A? Yes. The set {2, 3} is literally one of the three listed elements.
- Is {2, 3} ⊆ A? No. For that we would need 2 ∈ A and 3 ∈ A, and neither holds.
Pause and Check
Questions to use before you move into practice
Self-check questions
- Can I state extensionality without looking at my notes?
- For any given claim, can I decide whether ∈ or ⊆ is the right symbol?
- Can I explain in one paragraph why Russell's paradox forces a restriction on set formation?
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.
Classification Practice
DeductiveMembership, Inclusion, or Neither
For each claim below, decide whether it is true, false, or malformed, and justify your answer by pointing to the relevant elements of the sets involved.
Set claims to evaluate
For each claim, decide whether the statement is true, false, or uses the wrong symbol. Treat A = {1, 2, {3, 4}}, B = {1, 2, 3, 4}, C = {{1}, {2}}, and D = ∅ throughout.
Claim A
3 ∈ A
Look at the listed elements of A — the number 3 is inside a sub-set, not directly a member of A.
Claim B
{3, 4} ∈ A
Here the whole set {3, 4} is one of the listed elements of A, which is different from asking about 3 or 4 individually.
Claim C
{1, 2} ⊆ B
Check whether every element of the left set appears in the right set.
Claim D
1 ⊆ B
The number 1 is not a set, so the subset symbol is out of place here.
Claim E
D ⊆ C
Remember that the empty set is a subset of every set.
Claim F
{1} ∈ C
Look at the actual listed elements of C — they are themselves sets.
Proof Draft
LineStatementJustificationAction
1
2
3
Quiz
DeductiveFoundations Check
Answer each short question in one or two sentences. Focus on the concepts, not on long computations.
Short-answer check
These questions check whether you have internalized the basic vocabulary from this lesson.
Question 1
State the axiom of extensionality in your own words and explain why it implies that {1, 2, 3} and {3, 2, 1} are the same set.
Give the rule and then the application; both are required.
Question 2
Explain the difference between x ∈ A and {x} ⊆ A, and give an example where one is true and the other would be badly typed.
Contrast a membership claim with an inclusion claim.
Question 3
How many elements does the set {∅, {∅}} have, and what are they?
Count carefully — the empty set and the set containing the empty set are distinct.
Question 4
State Russell's paradox informally and explain in one sentence how the modern axiom of separation avoids it.
Describe the paradoxical set, then the restriction that rules it out.
Proof Draft
LineStatementJustificationAction
1
2
3
Formalization Practice
DeductiveFormalization Drill: What Is a Set?
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: What Is a Set?
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: What Is a Set?
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: What Is a Set?
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: What Is a Set?
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: What Is a Set?
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: What Is a Set?
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: What Is a Set?
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: What Is a Set?
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: What Is a Set?
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: What Is a Set?
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: What Is a Set?
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: What Is a Set?
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 read set notation by visual similarity — always ask whether the left object is a member of or a subset of the right object.
- Do not treat 'the set of all X' as automatically well-defined; it is only a set when X is a property restricted to an existing set.
Where students usually go wrong
Writing 1 ⊆ {1, 2, 3} when the intended claim is 1 ∈ {1, 2, 3}.
Writing {1} ∈ {1, 2, 3} when the correct claim is {1} ⊆ {1, 2, 3}.
Treating {1, 2} and {2, 1} as different sets because the listed order differs.
Claiming that the set of all sets that are not members of themselves is a legitimate object of set theory.
Historical context for this way of reasoning
Bertrand Russell
Russell discovered the paradox that bears his name in 1901 while reviewing Frege's Grundgesetze. The discovery upended naive set theory and set the stage for the axiomatic systems developed by Zermelo and Fraenkel a few years later.