In logic, mathematics, and computer science, the arity (synonyms include type, adicity, and rank) of a function or operation is the number of arguments or operands that the function takes. The arity of a relation is the number of domains in the corresponding Cartesian product.
The term "arity" is primarily used with reference to operations. If f is the function f : Sn → S, where S is some set, then f is an operation and n is its arity.
Arities greater than 2 are seldom encountered in mathematics, except in specialized areas, and arities greater than 3 are seldom encountered in computer science.
In linguistics, arity is sometimes called valency, not to be confused with valency in mathematics.
The term "arity" is rarely employed in everyday usage. For example, rather than saying "the arity of the addition operation is 2" or "addition is an operation of arity 2" one usually says "addition is a binary operation". In general, the naming of functions or operators with a given arity follows a convention similar to the one used for n-based numeral systems such as binary and hexadecimal. One combines a Latin prefix with the -ary ending; for example:
?: , which is a so-called conditional operator, taking three parameters.
An alternative nomenclature is derived in a similar fashion from the corresponding Greek roots; for example, medadic, monadic, dyadic, triadic, polyadic, and so on. Thence derive the alternative terms adicity and adinity for the Latin-derived arity.
These words are often used to describe anything related to that number (e.g., undenary chess is a chess variant with an 11x11 board, or the Millenary Petition of 1603).
Abstract algebra | Universal algebra
Stelligkeit | Aarsus | Aridad | Loknombro | Arité | Arito | Plaatsigheid | Argumentowość | Aridade | Арность | Aritet