Each function symbol f of arity n is assigned an n-ary function on the domain.
From the en.wikipedia.org
Each relation symbol R of arity n is assigned an n-ary relation on the domain.
From the en.wikipedia.org
Thus a unary operation has arity one, and a binary operation has arity two.
From the en.wikipedia.org
The number of arguments taken by each operation is called the arity of the operation.
From the en.wikipedia.org
In the case of function and predicate symbols, a natural number arity is also assigned.
From the en.wikipedia.org
The list order for the operations of a given arity is determined by the following two rules.
From the en.wikipedia.org
In formal logic, this number is called the arity of the predicate.
From the en.wikipedia.org
An atom can be regarded as a compound term with arity zero.
From the en.wikipedia.org
This is defined analogously to complete Boolean algebras, but with sups and infs limited to countable arity.
From the en.wikipedia.org
More examples
The number of arguments that a function can take
The number of arguments that a predicate takes. E.g. member(X,List) has arity 2. In documentation, the arity of a predicate is written as predicate/arity. E.g. member/2.
Is the number of arguments of the function. If this function is absent in the standard C library, it should be written in C and added to the library file usrlib.a in the CompHEP working directory.
The property of a relationship which enumerates how many entities are involved.