Linked from

The 76 pages that link to Set, each with the reason it gives.

• Equivalence relationNarrower topic: An equivalence relation groups the elements of its underlying set.

• FunctionNarrower topic: Domains and codomains are sets of permitted inputs and outputs.

• CombinatoricsNarrower topic: Combinatorial problems often begin by specifying the objects available for selection.

• Group actionNarrower topic: An action needs points on which the group elements operate.

• Domain of a functionNarrower topic: A function’s domain is a set of permitted inputs.

• Power setNarrower topic: A power set is constructed from a set as its input.

• Cartesian productNarrower topic: A Cartesian product is constructed from sets as its input collections.

• Ordered pairNarrower topic: Ordered-pair constructions use sets as their basic ingredients.

• SubsetNarrower topic: Subsethood compares the elements contained in two sets.

• Function compositionNarrower topic: Function domains and codomains are sets, which constrain valid compositions.

• Indicator functionNarrower topic: The specified set determines exactly where the function takes value one.

• CardinalityNarrower topic: Cardinality assigns a size to sets, regardless of what their elements are.

• AlgebraNarrower topic: Sets provide the language for specifying numbers, solutions, and algebraic structures.

• Countable setNarrower topic: Countability classifies sets by whether their elements can be enumerated.

• Empty setNarrower topic: The empty set is the unique set with no members.

• Binary relationNarrower topic: A relation is itself a set, whose members are ordered pairs.

• Finite setNarrower topic: Finiteness is a property of sets, defined through their elements.

• Sample spaceNarrower topic: The sample space is a set, so set operations describe events.

• Identity elementNarrower topic: The identity and the elements it leaves unchanged belong to the operation's set.

• CodomainNarrower topic: A codomain is itself a set, with membership determining which outputs are allowed.

• AssociativityNarrower topic: An operation’s elements are drawn from a specified set.

• Binary operationNarrower topic: The operation is defined on one set and must return elements of it.

• Countable additivityNarrower topic: The rule concerns measurable sets and their unions.

• Surjective functionNarrower topic: Domains, codomains, and images are sets whose elements surjectivity compares.

• Cumulative hierarchyNarrower topic: The hierarchy organizes sets into levels rather than treating them as an unstructured totality.

• Image (mathematics)Narrower topic: An image is a set whose elements are attained output values.

• Reflexive relationNarrower topic: The elements that must relate to themselves are exactly the members of the underlying set.

• Measure spaceNarrower topic: The underlying points of a measure space form a set.

• SemigroupNarrower topic: The elements on which a semigroup’s operation is defined form its underlying set.

• Choice functionNarrower topic: Each input to a choice function is a set.

• Associative propertyNarrower topic: An operation is associative relative to the set on which it is defined.

• Axiom of pairingNarrower topic: The axiom applies to sets and asserts the existence of another set.

• Axiom of unionNarrower topic: The axiom concerns a set whose members are themselves sets.

• Cardinal numberNarrower topic: Cardinal numbers assign sizes to sets.

• ElementNarrower topic: An element is defined by belonging to a set.

• Infinite setNarrower topic: An infinite set is a set whose elements cannot be counted to a finite total.

• Set-builder notationNarrower topic: Set-builder notation is one way to specify which objects belong to a set.

• CombinationNarrower topic: A combination is a subset, so set membership captures its order-free nature.

• Partition of a setNarrower topic: A partition divides one underlying set into blocks.

• Quotient setNarrower topic: The quotient set is itself a set, with classes rather than original elements as members.

• Upper boundNarrower topic: An upper bound is defined by checking every member of a specified set.

• Mathematical structureNarrower topic: A structure begins with an underlying set of objects.

• Membership relationNarrower topic: Membership states whether an object belongs to one of these collections.

• Ramsey's theoremNarrower topic: The theorem colors subsets drawn from an underlying infinite set.

• Axiom of Power SetNarrower topic: The axiom states what set must exist for each set already given.

• Axiom of regularityNarrower topic: Regularity quantifies over sets and their elements.

• Axiom schema of replacementNarrower topic: Replacement begins with a set of inputs and asserts that their defined outputs also form a set.

• Free objectNarrower topic: A set provides the generators for the free construction over sets.

• MagmaNarrower topic: A magma's elements form the set on which its operation acts.

• CodeNarrower topic: Sets are among the simplest objects represented by codes.