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
Relations and Their Properties
Defines a relation as a subset of a Cartesian product, introduces reflexivity, symmetry, transitivity, and antisymmetry, explains equivalence relations and the partitions they induce, and discusses order relations.
Read for structure, not just vocabulary. The goal is to learn how natural-language claims are converted into a cleaner formal shape.
Start Here
What this lesson is helping you do
Defines a relation as a subset of a Cartesian product, introduces reflexivity, symmetry, transitivity, and antisymmetry, explains equivalence relations and the partitions they induce, and discusses order relations. The practice in this lesson depends on understanding Cartesian Product, Relation, and Equivalence Relation and applying tools such as Axiom of Extensionality and Russell's Paradox Restriction correctly.
How to approach it
Read for structure, not just vocabulary. The goal is to learn how natural-language claims are converted into a cleaner formal shape.
What the practice is building
You will put the explanation to work through analysis practice, quiz, formalization practice, proof construction, evaluation 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 relations by checking each of reflexivity, symmetry, transitivity, and antisymmetry, and label each as an equivalence relation, a partial order, or neither, with justification referring to ordered pairs or 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 definition
A relation is a set of ordered pairs
In ordinary language we talk about relations informally: 'Alice is a sibling of Bob,' '3 is less than 5,' 'this train is scheduled before that one.' Set theory gives all of these a single rigorous definition. A binary relation R from a set A to a set B is a subset of the Cartesian product A × B. The relation holds between a and b precisely when the ordered pair (a, b) is an element of R, and we write a R b as a shorthand for (a, b) ∈ R. That's the whole definition: a relation is literally its set of holding pairs.
Concrete example. Let P = {Alice, Bob, Carol} and define R = {(Alice, Bob), (Bob, Carol)}. Then Alice R Bob is true and Bob R Carol is true, because those pairs are listed, but Carol R Alice is false, because (Carol, Alice) does not appear in R. This looks almost trivial, but the set-theoretic view buys you something real: every question about the relation — is it reflexive? symmetric? transitive? — becomes a question about which ordered pairs are or are not present in R, which is a purely mechanical check.
What to look for
- Treat a relation as a set of ordered pairs.
- Write a R b only when the ordered pair (a, b) is genuinely in R.
- Keep the first and second coordinates in the correct order — relations are not in general symmetric.
A relation is nothing more than a subset of a Cartesian product. Everything we do with relations reduces to membership checks on that subset.
The four properties
Reflexivity, symmetry, transitivity, antisymmetry
A relation R on a set A is reflexive if every element is related to itself: for all a ∈ A, we have a R a. It is symmetric if whenever a R b holds, b R a also holds. It is transitive if whenever a R b and b R c both hold, a R c also holds. It is antisymmetric if whenever a R b and b R a both hold, then a = b. These four properties look similar on the page, but they describe genuinely different structural features of a relation, and an argument about any relation usually begins by identifying which of them hold.
Concrete example. On the set A = {1, 2, 3}, the relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)} is reflexive (all three pairs (a, a) are present), symmetric (the pair (1, 2) has its mirror (2, 1)), and transitive as well (you can check every three-step chain). It is not antisymmetric, because we have both 1 R 2 and 2 R 1 but 1 ≠ 2. A common beginner mistake is to check only a few pairs and declare a relation transitive prematurely. The honest check is to look at every pair (a, b) and (b, c) that holds and verify that (a, c) also holds.
What to look for
- For reflexivity, check whether (a, a) appears for every element a.
- For symmetry, pair every (a, b) with its mirror (b, a).
- For transitivity, verify every two-step chain leads to the corresponding direct pair.
- For antisymmetry, ensure that two-way relating (a, b) and (b, a) can only happen when a = b.
Four properties — reflexive, symmetric, transitive, antisymmetric — classify most of the structural behavior of relations. Each of them is verified by an explicit check on ordered pairs.
A central construction
Equivalence relations carve sets into partitions
A relation that is reflexive, symmetric, and transitive is called an equivalence relation. Examples include 'has the same birthday as' on a set of people, 'is congruent modulo 5 to' on the integers, 'has the same fingerprint as' on a population, and equality itself on any set. Equivalence relations formalize the everyday idea of being 'the same for our purposes' even when the items are not literally identical, and they appear so often in mathematics that they have a special name.
Every equivalence relation R on a set A produces a partition of A. The equivalence class of an element a, written [a], is the set of all x ∈ A with x R a. The axioms of reflexivity, symmetry, and transitivity guarantee that every element belongs to exactly one equivalence class, that distinct equivalence classes never overlap, and that together the classes cover all of A. Conversely, every partition of A defines an equivalence relation by the rule 'a R b if and only if a and b are in the same block.' Partitions and equivalence relations are two ways of looking at the same thing.
What to look for
- Confirm the three properties (reflexive, symmetric, transitive) before calling a relation an equivalence relation.
- Define the equivalence class [a] as the set of elements that are R-related to a.
- Check that the equivalence classes cover A and are pairwise disjoint.
Equivalence relations and partitions are two faces of the same structure. Whenever you have one, you have the other.
Antisymmetry in action
Order relations and a preview of the later lessons
A relation that is reflexive, antisymmetric, and transitive is called a partial order. Examples include ≤ on the real numbers, ⊆ on the subsets of a fixed set, and 'divides' on the positive integers. Partial orders are what we use to formalize the idea that some things come before or contain others, even when the comparison is not always possible. In a partial order, some pairs of elements are comparable (one is below the other) and some are not; when every pair is comparable, the order is called total or linear.
The difference between an equivalence relation and a partial order comes down to symmetry versus antisymmetry. Symmetry says 'if a is R-related to b, then b is R-related to a,' which makes the relation blur direction. Antisymmetry says 'if both directions hold, then the two elements were really the same to begin with,' which enforces one-way comparison. Holding those two ideas apart is crucial: equivalence blurs, order ranks.
What to look for
- A partial order is reflexive, antisymmetric, and transitive.
- A total order is a partial order in which every pair of elements is comparable.
- Distinguish equivalence (symmetric) from order (antisymmetric) — they are structurally opposed.
Equivalence and order are the two most important kinds of relation, and they differ exactly in whether they are symmetric or antisymmetric.
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.
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.
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.
Equivalence Relation
A relation R on A that is reflexive, symmetric, and transitive; each equivalence relation partitions A into disjoint equivalence classes.
Why it matters: Equivalence relations are how mathematics formalizes 'sameness up to some aspect,' and the partition they induce is the engine behind quotient constructions.
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.
Formalization Demo
The lesson shows how the same reasoning looks once its structure is made explicit.
Worked Example
A complete example demonstrates what correct reasoning looks like in context.
Guided Practice
You apply the idea with scaffolding still visible.
Independent Practice
You work more freely, with less support, to prove the idea is sticking.
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
Congruence Modulo 3 as an Equivalence Relation
An equivalence relation automatically partitions its underlying set into equivalence classes. Here, congruence modulo 3 partitions the integers into three classes based on the remainder upon division by 3.
Content
- Let R be the relation on the integers defined by a R b if and only if a − b is divisible by 3.
- Reflexive: for every integer a, a − a = 0, which is divisible by 3, so a R a.
- Symmetric: if a − b is divisible by 3, so is b − a = −(a − b), so a R b implies b R a.
- Transitive: if a − b and b − c are both divisible by 3, then a − c = (a − b) + (b − c) is also divisible by 3, so a R b and b R c imply a R c.
- Equivalence classes: [0] = {..., −6, −3, 0, 3, 6, ...}, [1] = {..., −5, −2, 1, 4, 7, ...}, [2] = {..., −4, −1, 2, 5, 8, ...}.
- The three classes partition the integers into remainder classes modulo 3.
Worked Example
Subset as a Partial Order
The subset relation is the canonical example of a partial order that is not total. Reflexivity and transitivity are straightforward; antisymmetry is exactly the statement that sets with the same members are the same set.
Content
- Let R be the subset relation ⊆ on the power set of A = {1, 2, 3}.
- Reflexive: every set is a subset of itself, so X ⊆ X.
- Antisymmetric: if X ⊆ Y and Y ⊆ X, then X = Y by extensionality.
- Transitive: if X ⊆ Y and Y ⊆ Z, then every element of X is in Y and every element of Y is in Z, so every element of X is in Z.
- Not total: {1, 2} and {2, 3} are not comparable — neither is a subset of the other.
Pause and Check
Questions to use before you move into practice
Self-check questions
- Can I state each of reflexivity, symmetry, transitivity, and antisymmetry in precise set-theoretic terms?
- Given a concrete relation, can I produce its equivalence classes if it is an equivalence relation?
- Can I give an example of a partial order that is not total?
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.
Analysis Practice
DeductiveClassify the Relation
For each relation below, decide which of the four properties (reflexivity, symmetry, transitivity, antisymmetry) hold. Then say whether it is an equivalence relation, a partial order, both, or neither.
Relations to analyze
For each item, explicitly check each property by reference to the ordered pairs, not by general intuition.
Relation A
On the set A = {1, 2, 3}, let R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)}.
A small relation where you can check every pair by hand.
Relation B
On the set of integers, let R be defined by a R b if and only if a − b is divisible by 3.
A classical equivalence relation — congruence modulo 3.
Relation C
On the set of real numbers, let R be the relation ≤.
A total order — check antisymmetry carefully.
Relation D
On the power set of {1, 2, 3}, let R be the subset relation ⊆.
A partial order that is not total — not every pair of subsets is comparable.
Relation E
On the set of all living people, let R be the relation 'is the biological parent of.'
Check each property and discuss which fails.
Proof Draft
LineStatementJustificationAction
1
2
3
Quiz
DeductiveRelations Check
Answer each question briefly, focusing on the structural reason for your answer.
Short-answer check on relations
These questions test the vocabulary and structural reasoning from this lesson.
Question 1
Define an equivalence relation in one sentence. Name the three required properties.
Standard definition — state it cleanly.
Question 2
Give a small concrete example of a relation that is symmetric and transitive but not reflexive, and explain the issue.
Recall that symmetry plus transitivity does not imply reflexivity on every element of the underlying set.
Question 3
Explain what it means for the equivalence classes of an equivalence relation to partition the underlying set.
Partition = cover plus pairwise-disjoint.
Question 4
State the difference between a partial order and a total order, and give one example of each on finite sets of size at most 4.
Total = every pair comparable.
Proof Draft
LineStatementJustificationAction
1
2
3
Formalization Practice
DeductiveFormalization Drill: Relations and Their Properties
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: Relations and Their Properties
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: Relations and Their Properties
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: Relations and Their Properties
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: Relations and Their Properties
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: Relations and Their Properties
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: Relations and Their Properties
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: Relations and Their Properties
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: Relations and Their Properties
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: Relations and Their Properties
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: Relations and Their Properties
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: Relations and Their Properties
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: Relations and Their Properties
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 verify transitivity by checking only a handful of pairs; the property must hold for every three-element chain.
- Do not confuse a relation failing to be reflexive with the relation being 'almost an equivalence relation.' Reflexivity is essential.
Where students usually go wrong
Checking transitivity on a small sample of pairs instead of every two-step chain.
Declaring a relation an equivalence relation without verifying all three properties, especially reflexivity.
Confusing antisymmetry with asymmetry (a R b implying not b R a is a different, stronger property).
Forgetting that equivalence classes partition the whole underlying set, not just the pairs that explicitly appeared in R.
Historical context for this way of reasoning
Georg Cantor
Cantor's treatment of 'equipollent' sets — sets in bijection with each other — is the first explicit use of an equivalence relation in modern mathematics, and it was the framework in which he developed his theory of cardinality.