Linked from

The 14 pages that link to Partial function, each with the reason it gives.

• FunctionCompared with: Unlike a function on a stated domain, it need not assign outputs throughout that domain.

• Domain of a functionCompared with: It distinguishes a limited domain from a function defined on every element of a larger set.

• BijectionCompared with: A bijection is defined on every element of its stated domain.

• Binary relationCompared with: It relaxes totality while retaining the single-output constraint absent from general relations.

• Injective functionCompared with: Restricting where a function is defined can change whether it is injective.

• CodomainCompared with: Its possible outputs remain distinct from the inputs where it is defined.

• Computable functionCompared with: A computation that fails to halt naturally defines a partial rather than total function.

• Recursive definitionCompared with: Recursive rules can fail to yield a value for every input unless termination is established.

• MorphismCompared with: Ordinary category morphisms are defined as arrows between their specified objects, not partial assignments.

• Left inverseCompared with: The usual left-inverse definition uses a total function g on f’s codomain, not merely on f’s image.

• Value (mathematics)Compared with: A partial function assigns no value to inputs outside its domain.