Arity (// (listen)) is the number of arguments or operands taken by a function, operation or relation in logic, mathematics, and computer science. In mathematics, arity may also be named rank, but this word can have many other meanings in mathematics. In logic and philosophy, it is also called adicity and degree. In linguistics, it is usually named valency.
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:
- A nullary function takes no arguments.
- A unary function takes one argument.
- A binary function takes two arguments.
- A ternary function takes three arguments.
- An n-ary function takes n arguments.
Sometimes it is useful to consider a constant to be an operation of arity 0, and hence call it nullary.
Also, in non-functional programming, a function without arguments can be meaningful and not necessarily constant (due to side effects). Often, such functions have in fact some hidden input which might be global variables, including the whole state of the system (time, free memory, ...). The latter are important examples which usually also exist in "purely" functional programming languages.
Examples of unary operators in mathematics and in programming include the unary minus and plus, the increment and decrement operators in C-style languages (not in logical languages), and the successor, factorial, reciprocal, floor, ceiling, fractional part, sign, absolute value, square root (the principal square root), complex conjugate (unary of "one" complex number, that however has two parts at a lower level of abstraction), and norm functions in mathematics. The two's complement, address reference and the logical NOT operators are examples of unary operators in math and programming.
Most operators encountered in programming and mathematics are of the binary form. For both programming and mathematics, these include the multiplication operator, the radix operator, the often omitted exponentiation operator, the logarithm operator, the addition operator, and the division operator. Logical predicates such as OR, XOR, AND, IMP are typically used as binary operators with two distinct operands. In CISC architectures, it is common to have two source operands (and store result in one of them).
The computer programming language C and its various descendants (including C++, C#, Java, Julia, Perl, and others) provide the ternary conditional operator
?:. The first operand (the condition) is evaluated, and if it is true, the result of the entire expression is the value of the second operand, otherwise it is the value of the third operand. The Python language has a ternary conditional expression,
x if C else y.
The Forth language also contains a ternary operator,
*/, which multiplies the first two (one-cell) numbers, dividing by the third, with the intermediate result being a double cell number. This is used when the intermediate result would overflow a single cell.
Many (RISC) assembly language instructions are ternary (as opposed to only two operands specified in CISC); or higher, such as
MOV %AX, (%BX, %CX), which will load (MOV) into register AX the contents of a calculated memory location that is the sum (parenthesis) of the registers BX and CX.
From a mathematical point of view, a function of n arguments can always be considered as a function of one single argument which is an element of some product space. However, it may be convenient for notation to consider n-ary functions, as for example multilinear maps (which are not linear maps on the product space, if n ≠ 1).
The same is true for programming languages, where functions taking several arguments could always be defined as functions taking a single argument of some composite type such as a tuple, or in languages with higher-order functions, by currying.
In computer science, a function accepting a variable number of arguments is called variadic. In logic and philosophy, predicates or relations accepting a variable number of arguments are called multigrade, anadic, or variably polyadic.
Latinate names are commonly used for specific arities, primarily based on Latin distributive numbers meaning "in group of n", though some are based on Latin cardinal numbers or ordinal numbers. For example, 1-ary is based on cardinal unus, rather than from distributive singulī that would result in singulary.
|x-ary||Arity (Latin based)||Adicity (Greek based)||Example in mathematics||Example in computer science|
|0-ary||Nullary (from nūllus)||Niladic||A constant||A function without arguments, True, False|
|1-ary||Unary||Monadic||Additive inverse||Logical NOT operator|
|2-ary||Binary||Dyadic||Addition||OR, XOR, AND|
|3-ary||Ternary||Triadic||Triple product of vectors||Conditional operator|
|9-ary||Novenary (alt. nonary)||Enneadic|
|10-ary||Denary (alt. decenary)||Decadic|
|More than 2-ary||Multary and multiary||Polyadic|
|Varying||Variadic||Sum; e.g.,||Variadic function, reduce|
n-ary means n operands (or parameters), but is often used as a synonym of "polyadic".
In computer programming, there is often a syntactical distinction between operators and functions; syntactical operators usually have arity 0, 1, or 2 (the ternary operator ?: is also common). Functions vary widely in the number of arguments, though large numbers can become unwieldy. Some programming languages also offer support for variadic functions, i.e., functions syntactically accepting a variable number of arguments.
- Logic of relatives
- Binary relation
- Ternary relation
- Theory of relations
- Signature (logic)
- p-adic number
- n-ary code
- n-ary group
- Function prototype – Declaration of a function's name and type signature but not body
- Type signature – Defines the inputs and outputs for a function, subroutine or method
- Hazewinkel, Michiel (2001). Encyclopaedia of Mathematics, Supplement III. Springer. p. 3. ISBN 978-1-4020-0198-7.
- Schechter, Eric (1997). Handbook of Analysis and Its Foundations. Academic Press. p. 356. ISBN 978-0-12-622760-4.
- Detlefsen, Michael; McCarty, David Charles; Bacon, John B. (1999). Logic from A to Z. Routledge. p. 7. ISBN 978-0-415-21375-2.
- Cocchiarella, Nino B.; Freund, Max A. (2008). Modal Logic: An Introduction to its Syntax and Semantics. Oxford University Press. p. 121. ISBN 978-0-19-536658-7.
- Crystal, David (2008). Dictionary of Linguistics and Phonetics (6th ed.). John Wiley & Sons. p. 507. ISBN 978-1-405-15296-9.
- Quine, W. V. O. (1940), Mathematical logic, Cambridge, Massachusetts: Harvard University Press, p. 13
- Robinson, Abraham (1966), Non-standard Analysis, Amsterdam: North-Holland, p. 19
- Oliver, Alex (2004). "Multigrade Predicates". Mind. 113 (452): 609–681. doi:10.1093/mind/113.452.609.
A monograph available free online: