Linked from

The 24 pages that link to Cardinality, each with the reason it gives.

• Power setRelated: Power-set size depends directly on the size of the original set.

• Cartesian productNarrower topic: Cardinality rules quantify how many tuples a product contains.

• Georg CantorRelated: Cantor made cardinality a precise way to distinguish sizes of infinity.

• Continuum hypothesisNarrower topic: The hypothesis compares the cardinalities of the natural numbers and the real numbers.

• Pigeonhole principleRelated: Comparing finite cardinalities is the numerical core of the principle.

• BijectionRelated: Bijections let cardinalities be compared without counting elements directly.

• Countable setNarrower topic: Countability is a basic distinction between possible cardinalities.

• Empty setRelated: The empty set has cardinality zero.

• Finite setRelated: A set is finite exactly when its cardinality is a natural number.

• Injective functionRelated: An injection from one set to another establishes a cardinality comparison.

• Inclusion–exclusion principleRelated: The formula computes the cardinality of a union from intersection cardinalities.

• Cantor's theoremNarrower topic: Cantor’s theorem compares cardinalities rather than ordinary numerical counts.

• CodomainRelated: Comparing domain and codomain cardinalities can constrain whether a function is injective or surjective.

• MultisetRelated: Multiset cardinality sums the multiplicities of all its elements.

• Cantor's diagonal argumentRelated: Uncountability is a claim about cardinality, not about numerical magnitude.

• Infinite setRelated: Cardinality distinguishes sizes of infinite sets that cannot be counted finitely.

• InfinityRelated: Cardinality distinguishes infinite collections by their sizes.

• Löwenheim–Skolem theoremRelated: The theorem compares model sizes with the cardinality of the language.

• Uncountable setNarrower topic: Uncountability is a cardinality distinction from the natural numbers.

• CombinationRelated: The size of the chosen subset determines which combinations are being counted.

• Combinatorial proofRelated: Equating the cardinalities of one set under two descriptions yields the desired identity.

• Categorical theoryRelated: The specified size determines which models are compared.

• Schröder–Bernstein theoremNarrower topic: The theorem converts mutual size comparisons into equality of cardinalities.

• Maximum-cardinality matchingRelated: The objective is the number of selected edges, not their weights.