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
Functions and Cardinality
Defines a function as a well-defined relation, introduces injective, surjective, and bijective functions, develops cardinality for finite and infinite sets, states the pigeonhole principle, and presents Cantor's diagonal argument in intuitive form.
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
Defines a function as a well-defined relation, introduces injective, surjective, and bijective functions, develops cardinality for finite and infinite sets, states the pigeonhole principle, and presents Cantor's diagonal argument in intuitive form. The practice in this lesson depends on understanding Relation, Function, and Cardinality 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 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 6 candidate functions as well-defined or not, and for the well-defined ones, label them as injective, surjective, bijective, or none of these, with supporting justification referring to the domain and codomain.
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.
Precise definition
A function is a relation with a uniqueness condition
A function f from A to B is a relation f ⊆ A × B satisfying one extra requirement: for every element a ∈ A, there is exactly one element b ∈ B with (a, b) ∈ f. This one condition — exactly one output for each input — is what distinguishes a function from a bare relation. When it holds, we write f(a) = b for the unique b paired with a, and we call A the domain and B the codomain. You will sometimes see 'well-defined' used as a synonym for 'satisfies the exactly-one-output condition'; the terms mean the same thing.
Two things can break this condition, and both are failure modes. First, a proposed function might leave some element of the domain with no output at all. Second, a proposed function might assign two different outputs to the same input. Either failure means you do not actually have a function. A small concrete example: on the set A = {Alice, Bob, Carol} and B = {coffee, tea, water}, the relation f = {(Alice, coffee), (Bob, tea), (Carol, water)} is a function. The relation g = {(Alice, coffee), (Bob, tea)} is not a function with domain A because Carol has no output. The relation h = {(Alice, coffee), (Alice, tea), (Bob, water), (Carol, coffee)} is not a function because Alice is assigned two different outputs.
What to look for
- Every element of the domain must get an output.
- No element of the domain may get two different outputs.
- Write f(a) = b only when (a, b) is the unique pair with first coordinate a.
A function is a relation with a uniqueness condition: one output per input. Checking well-definedness is the first thing to do with any candidate function.
Classifying functions
Injections, surjections, and bijections
A function f: A → B is injective (or one-to-one) if different inputs always produce different outputs: whenever f(a) = f(a'), then a = a'. It is surjective (or onto) if every element of the codomain is hit by some input: for every b ∈ B, there exists a ∈ A with f(a) = b. It is bijective if it is both injective and surjective. A bijection is a perfect pairing between A and B: every element of A is matched with a unique element of B, and every element of B is matched with a unique element of A.
Concrete examples. Let A = {1, 2, 3} and B = {x, y, z}. The function f defined by f(1) = x, f(2) = y, f(3) = z is a bijection. The function g defined by g(1) = x, g(2) = x, g(3) = y is neither injective (two inputs share the same output) nor surjective (no input maps to z). The function h defined by h(1) = x, h(2) = x, h(3) = y on A = {1, 2, 3}, B = {x, y} is surjective but not injective. Bijections are especially important because they are the tool we use to say that two sets have the same size.
What to look for
- For injectivity, verify that different inputs cannot share an output.
- For surjectivity, verify that every element of the codomain is achieved.
- A bijection is the only kind of function that can be inverted to give another function.
Injections protect inputs from collisions, surjections fill the codomain, and bijections do both. Bijections are the correct way to say 'these two sets are the same size.'
Counting with and without numbers
Cardinality and the pigeonhole principle
Two sets A and B are said to have the same cardinality, written |A| = |B|, if there exists a bijection between them. For finite sets this matches the ordinary notion of counting: |{1, 2, 3}| = |{x, y, z}| = 3, because the obvious pairing 1 ↦ x, 2 ↦ y, 3 ↦ z is a bijection. The set-theoretic definition is more flexible than the numerical one, because it works for infinite sets where 'count how many' is not available.
The pigeonhole principle follows directly from the finite case. If A and B are finite sets and |A| > |B|, then no function f: A → B can be injective, because at least two elements of A must map to the same element of B. The name comes from the everyday image of pigeons in holes: if you put n + 1 pigeons into n holes, at least one hole ends up with two pigeons. The principle looks obvious, but it is the backbone of many surprising proofs in combinatorics and logic, especially arguments that establish the existence of a collision without having to identify which specific elements collide.
What to look for
- Use a bijection to justify claims of equal cardinality between finite or infinite sets.
- Remember that |A| > |B| for finite sets forces at least one collision in any function A → B.
- Apply the pigeonhole principle as an existence argument, not an identification argument.
Cardinality is comparison by bijection, and the pigeonhole principle is the first non-trivial consequence: collisions are forced whenever there are more inputs than outputs.
The first uncountable set
Cantor's diagonal argument in intuitive form
A set is countable if it has the same cardinality as the natural numbers, meaning you can list its elements in a sequence indexed by 0, 1, 2, 3, and so on. The integers are countable, the rationals are countable, and so is any set whose members you can enumerate exhaustively in an infinite list. Cantor's great discovery was that not every infinite set is countable: the set of real numbers in the interval [0, 1] is strictly larger than the set of natural numbers, in the precise sense that no bijection can exist between them.
The diagonal argument works by contradiction. Suppose, for the sake of argument, that you did have a list r_0, r_1, r_2, ... of all the real numbers in [0, 1], each written as an infinite decimal expansion. Cantor constructs a new real number r* by walking down the diagonal of the list and changing each digit: for every n, make the nth digit of r* differ from the nth digit of r_n. This r* lies in [0, 1] but cannot equal any r_n, because its nth digit differs from the nth digit of r_n by construction. So the list was incomplete, contradicting the assumption. The conclusion is that the real numbers in [0, 1] cannot be listed, so they form a strictly larger infinity than the natural numbers. This is the intuitive entrance to the whole theory of uncountable sets.
What to look for
- Recognize that 'countable' means 'can be listed as r_0, r_1, r_2, ...'
- Follow the diagonal construction step by step until you can reproduce it without notes.
- Understand that the result is a strict size comparison between two infinite sets, not merely an observation about big numbers.
Cantor's diagonal argument shows that the real numbers form a strictly larger infinity than the natural numbers. It is the first evidence that 'infinity' is not one size but a hierarchy.
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.
Relation
A binary relation from A to B is a subset R ⊆ A × B; elements (a, b) ∈ R are usually written a R b.
Why it matters: Every kind of structure in mathematics — order, equivalence, function, graph — is ultimately a relation, and treating relations as sets of ordered pairs gives them rigorous definitions.
Function
A function f: A → B is a relation from A to B such that for every a ∈ A there is exactly one b ∈ B with (a, b) ∈ f; we write f(a) = b for this unique value.
Why it matters: Functions capture the idea of well-defined assignment and are the most widely used relational structure in mathematics and logic.
Cardinality
A measure of the size of a set; two sets have the same cardinality when there exists a bijection between them, and a set is countable when it has the same cardinality as the natural numbers.
Why it matters: Cardinality extends the everyday notion of 'how many' to infinite sets and is the setting in which Cantor's diagonal argument distinguishes the countable from the uncountable.
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
A Bijection Between Finite Sets
For finite sets, a bijection matches the ordinary notion of 'having the same count.' Checking injectivity and surjectivity reduces to going through the paired list.
Content
- Let A = {1, 2, 3} and B = {Alice, Bob, Carol}.
- Define f: A → B by f(1) = Alice, f(2) = Bob, f(3) = Carol.
- Well-defined: each element of A has exactly one output.
- Injective: distinct inputs 1, 2, 3 produce the distinct outputs Alice, Bob, Carol.
- Surjective: every element of B is hit — Alice by 1, Bob by 2, Carol by 3.
- Therefore f is a bijection, witnessing |A| = |B| = 3.
Worked Example
The Even Numbers Are Countable
A set in bijection with a proper subset of itself is necessarily infinite, and the natural numbers are the archetype. The even naturals are 'half' of N in every everyday sense, but as a cardinality they are exactly the same size.
Content
- Let f: N → 2N be defined by f(n) = 2n, where N = {0, 1, 2, 3, ...} and 2N = {0, 2, 4, 6, ...}.
- Well-defined: every natural n has exactly one double 2n.
- Injective: if 2n = 2m then n = m.
- Surjective: every even natural 2k is hit by n = k.
- Therefore f is a bijection, and |N| = |2N|.
Pause and Check
Questions to use before you move into practice
Self-check questions
- Can I state the well-definedness condition for a function in one sentence?
- Given a small finite function, can I decide whether it is injective, surjective, both, or neither?
- Can I reproduce the pigeonhole principle and explain why it is true by counting?
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
DeductiveIs This a Function? What Kind?
For each proposed assignment below, decide whether it is a function from the given domain to the given codomain. If it is, classify it as injective, surjective, bijective, or none of these, and justify your answer.
Candidate functions
For each case, first check well-definedness: is every element of the domain assigned exactly one output? Then, if it is a function, check injectivity and surjectivity.
Case A
Domain A = {1, 2, 3}, codomain B = {x, y, z}. Assignment: 1 ↦ x, 2 ↦ y, 3 ↦ z.
A clean bijection — use it as a baseline.
Case B
Domain A = {1, 2, 3}, codomain B = {x, y, z}. Assignment: 1 ↦ x, 2 ↦ x, 3 ↦ y.
Well-defined, but check injectivity and surjectivity.
Case C
Domain A = {1, 2, 3}, codomain B = {x, y}. Assignment: 1 ↦ x, 2 ↦ x, 3 ↦ y.
Different codomain — is it now surjective?
Case D
Domain A = {Alice, Bob, Carol}, codomain B = {coffee, tea, water}. Assignment: Alice ↦ coffee, Alice ↦ tea, Bob ↦ water, Carol ↦ coffee.
Check well-definedness — Alice has two outputs.
Case E
Domain A = {1, 2, 3, 4, 5}, codomain B = {x, y, z}. Any function f: A → B.
Pigeonhole: what does |A| > |B| force?
Case F
Domain: natural numbers N. Codomain: even natural numbers 2N. Assignment: n ↦ 2n.
A bijection between an infinite set and a proper subset of itself — classify it carefully.
Proof Draft
LineStatementJustificationAction
1
2
3
Quiz
DeductiveFunctions and Cardinality Check
Answer each short question carefully. Keep explanations tight but rigorous.
Short-answer check on functions and cardinality
These questions test the core vocabulary and central arguments from this lesson.
Question 1
Define an injective function in one sentence. Give an example and a non-example using finite sets of size at most 4.
Definition plus explicit contrast.
Question 2
State the pigeonhole principle and give a two-sentence example of its application.
Statement and a concrete use.
Question 3
Explain why the map n ↦ 2n from the natural numbers to the even natural numbers is a bijection, and say what this shows about the cardinality of the two sets.
A countably infinite set can be in bijection with a proper subset — this is a defining feature of infinity.
Question 4
Summarize Cantor's diagonal argument in three or four sentences: what is assumed, what is constructed, and what the conclusion is.
Capture the assumption, the construction, and the contradiction.
Proof Draft
LineStatementJustificationAction
1
2
3
Formalization Practice
DeductiveFormalization Drill: Functions and Cardinality
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: Functions and Cardinality
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: Functions and Cardinality
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: Functions and Cardinality
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: Functions and Cardinality
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: Functions and Cardinality
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: Functions and Cardinality
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: Functions and Cardinality
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: Functions and Cardinality
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: Functions and Cardinality
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: Functions and Cardinality
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: Functions and Cardinality
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: Functions and Cardinality
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 call a relation a function without checking that every domain element is mapped.
- Do not assume every infinite set is countable — Cantor's argument exhibits one that is not.
Where students usually go wrong
Calling something a function when some domain element has no assigned output.
Calling something a function when one domain element is assigned two different outputs.
Confusing injectivity (different inputs produce different outputs) with surjectivity (every codomain element is hit).
Treating 'infinity' as a single size rather than a hierarchy that separates countable from uncountable sets.
Historical context for this way of reasoning
Georg Cantor
Cantor's 1891 paper introduced the diagonal argument that now bears his name, establishing that the cardinality of the real numbers strictly exceeds that of the natural numbers. It was one of the most influential proofs of the nineteenth century and opened the door to modern set theory.