Sets & Logic
65 concepts in Math
Sets and logic provide the formal language and reasoning framework that underpins all of mathematics. A set is simply a well-defined collection of objects, but this simple idea leads to powerful ways of organizing and analyzing information. Students learn about unions, intersections, complements, subsets, and Venn diagrams as tools for categorizing and comparing groups. Logic introduces the structure of valid reasoning: statements, negations, conditionals, and quantifiers. Students practice distinguishing between what is always true, sometimes true, and never true — a skill that strengthens mathematical proof and everyday critical thinking alike. Understanding logical connectives (and, or, not, if-then) and recognizing common logical fallacies prepares students for rigorous argument in mathematics, computer science, philosophy, and law.
Suggested learning path: Start with basic set notation and Venn diagrams, then study set operations and their properties, followed by propositional logic, truth tables, and an introduction to mathematical proof.
Set
A well-defined collection of distinct, unordered objects called elements, described either by listing or by a membership rule.
Element
An individual object that belongs to, or is a member of, a given set — either it is in the set or it is not.
Subset
Set $A$ is a subset of set $B$ if every element of $A$ is also an element of $B$, written $A \subseteq B$.
Union
The union of sets $A$ and $B$ is the set of all elements that belong to $A$, to $B$, or to both, written $A \cup B$.
Intersection
The intersection of sets $A$ and $B$ is the set of all elements that belong to both $A$ and $B$ simultaneously, written $A \cap B$.
Complement
The complement of set $A$ relative to a universal set $U$ is the set of all elements in $U$ that do not belong to $A$, written $A^c$ or $A'$.
Empty Set
The empty set, denoted $\emptyset$ or $\{\}$, is the unique set that contains no elements at all. It is a subset of every set because the statement 'every element of $\emptyset$ belongs to $A$' is vacuously true — there are no elements to contradict it.
Cardinality
The cardinality of a finite set is the number of distinct elements it contains, written $|A|$ — it measures the size of the set without regard to element order or identity.
Venn Diagram
A diagram using overlapping circles to visually represent sets and their relationships such as union, intersection, and complement.
Logical Statement
A logical statement (or proposition) is a declarative sentence that has exactly one truth value: it is either true or false. For example, '7 is prime' is a logical statement (true), while 'Is 7 prime?' is not (it's a question).
Negation
The negation of a statement $P$, written $\neg P$, is the statement with the opposite truth value: true when $P$ is false, and false when $P$ is true.
Conjunction
A conjunction $P \wedge Q$ is a compound statement that is true if and only if both constituent statements $P$ and $Q$ are individually true.
Disjunction
A disjunction $P \vee Q$ is a compound statement that is true whenever at least one of its parts is true.
Conditional Statement
A conditional $P \to Q$ is a statement meaning "if $P$ is true, then $Q$ must be true," read as "if $P$ then $Q$."
Contrapositive
The contrapositive of a conditional statement $P \Rightarrow Q$ is $\neg Q \Rightarrow \neg P$, formed by negating both parts and reversing their order — it is always logically equivalent to the original.
Biconditional
A biconditional $P \leftrightarrow Q$ is true when $P$ and $Q$ have the same truth value — both true or both false.
Truth Table
A table that systematically lists every possible combination of truth values for the input variables and the resulting truth value of the expression.
Quantifiers
Symbols specifying the scope of a predicate: $\forall$ (for all, universal) and $\exists$ (there exists, existential).
Abstraction
The cognitive and mathematical process of identifying essential features shared by many specific cases and ignoring irrelevant details.
Representation
A mathematical representation is any format — diagram, equation, table, graph, or symbolic expression — used to encode and communicate a mathematical idea or relationship between quantities.
Mathematical Modeling
The process of using mathematical structures — functions, equations, distributions — to represent, analyze, and predict real-world phenomena.
Assumptions
Statements accepted as true without proof that form the starting conditions for a mathematical argument or model.
Constraints (Meta)
Constraints are conditions, rules, or boundaries that restrict which values or solutions are allowed in a mathematical problem, narrowing an infinite space of possibilities to a manageable set.
Simplification
The process of replacing a complex expression or model with a simpler equivalent that preserves the essential features.
Idealization
Replacing a messy real-world object or process with a perfect, simplified version that captures its essence while ignoring complications.
Edge Cases
Special or extreme input values — such as zero, infinity, empty sets, or boundary conditions — where formulas or reasoning may behave differently.
Counterexample
A counterexample is a specific instance that satisfies the hypothesis of a claim but contradicts its conclusion, thereby disproving the general statement.
Invariance
A property of a mathematical object that remains unchanged when the object undergoes a particular transformation or operation.
Symmetry (Meta)
A property of a mathematical object that remains unchanged under a specified transformation — reflection, rotation, translation, or algebraic substitution.
Structure Recognition
The skill of identifying that a given mathematical expression or problem belongs to a known family or matches a recognizable pattern.
Generalization
The process of extending a specific result or pattern to hold for a broader class of objects or situations.
Specialization
Applying a general theorem or formula to a specific case by substituting particular values for the variables or parameters.
Decomposition
The strategy of breaking a complex mathematical object or problem into simpler, independent subproblems that can be solved separately.
Recomposition
Recomposition is the process of combining simpler parts, sub-results, or solved sub-problems back together to form a complete solution or to understand the whole structure from its pieces.
Equivalence Classes
An equivalence class is the set of all elements that are related to a given element under an equivalence relation — it groups objects that are considered 'the same' in some specified sense.
Consistency (Meta)
The property of a set of mathematical statements having no internal contradictions — all statements can be simultaneously true within the same system.
Completeness (Intuition)
The property of a mathematical system where every true statement that can be expressed in the system can also be proved within it.
Ambiguity
A situation where a mathematical expression, statement, or notation can be interpreted in more than one valid way, leading to different results.
Notation Overload
When the same symbol is used to mean different things in different contexts, requiring the reader to infer meaning from context.
Conceptual Compression
The cognitive process of packaging a multi-step procedure or idea into a single mental object that can be manipulated as a unit.
Reasoning vs Computation
Reasoning is the process of understanding why a mathematical fact is true and how ideas connect, while computation is the mechanical process of calculating an answer — both are essential but serve different purposes.
Proof (Intuition)
The informal, intuitive sense of why a mathematical statement must be true — the "aha" that precedes and motivates a formal proof.
Explanation vs Derivation
The distinction between explaining WHY a result is true (conceptual insight) and showing HOW it can be derived step by step (procedural derivation).
Conceptual Dependency
The relationship between concepts where understanding one requires prior understanding of another — the prerequisite structure of mathematical knowledge.
Transfer of Ideas
The ability to recognize that a technique or concept from one area of mathematics applies, possibly in adapted form, to a different area.
Analogical Reasoning
Drawing conclusions about a new situation by recognizing its structural similarity to a better-understood situation.
Multiple Viewpoints
The practice of analyzing the same mathematical object or problem from several different representations, frameworks, or perspectives.
Hidden Variables
Quantities or factors that influence a mathematical or real-world situation but are not explicitly included in the current model or expression.
Dimensional Reasoning
Using the units and dimensions of physical quantities to check formulas, guide derivations, and eliminate impossible answers.
Scaling Laws
Relationships describing how a quantity changes when the size or scale of a system is multiplied by a factor, often expressed as power laws.
Limiting Cases
Extreme values of a parameter (approaching zero, infinity, or a critical threshold) used to check formulas and reveal simplified behavior.
Robustness
The property of a result, algorithm, or model remaining valid or approximately correct even when its assumptions are slightly violated.
Sensitivity (Meta)
The degree to which a result or output changes in response to small changes in its inputs, parameters, or assumptions.
Conceptual Bottlenecks
Specific concepts or ideas whose misunderstanding blocks progress across a wide range of related mathematical topics.
Mental Models
A mental model is an internal representation of a mathematical concept that lets you reason about it intuitively — like picturing numbers on a number line or functions as input-output machines.
Concept Networks
The web of relationships between mathematical concepts, where each node is an idea and edges represent logical dependence, analogy, or application.
Error Analysis
The systematic study of how errors arise in calculations or models, how large they are, and how they propagate through subsequent steps.
Meaning Preservation
Meaning preservation is the principle that valid mathematical transformations must maintain the truth and relationships of the original expression — changing form without changing content.
Mathematical Elegance
The aesthetic quality of a mathematical argument or result that achieves its goal with striking simplicity, insight, or economy of means.
Proofs
A mathematical proof is a rigorous logical argument that demonstrates the truth of a statement beyond doubt, proceeding from accepted axioms and previously proven results through valid inference rules.
Mathematical Communication
Mathematical communication is the clear expression of definitions, reasoning, notation, and conclusions.
Proof Techniques
Proof techniques are standard strategies for establishing mathematical claims under different structures.
Direct Proof
A direct proof establishes a statement $P \Rightarrow Q$ by assuming $P$ is true and using logical steps, definitions, and known theorems to arrive at $Q$ — the most straightforward proof strategy.
Proof by Contradiction
Proof by contradiction (reductio ad absurdum) assumes the negation of what you want to prove, then derives a logical contradiction, thereby establishing that the original statement must be true.
Mathematical Induction
Mathematical induction proves statements indexed by integers by verifying a base case and an inductive step.