arity


Also found in: Thesaurus, Encyclopedia, Wikipedia.

ar·i·ty

 (âr′ĭ-tē)
n. pl. ar·i·ties
The number of arguments or operands taken by a function or operator.

[-ar(y) (as in binary ternary) + -ity.]
ThesaurusAntonymsRelated WordsSynonymsLegend:
Noun1.arity - the number of arguments that a function can take
logic - the branch of philosophy that analyzes inference
number - a concept of quantity involving zero and units; "every number has a unique position in the sequence"
Translations
aritačetnost
arité
aritetmjesnost
ariteitplaatsigheidStelligkeit
References in periodicals archive ?
disjoint from V, where each function symbol f is provided with an arity ar(f), being a natural number.
2] both have arity n and have the same underlying domain for their ith attribute, 1 [less than or equal to] i [less than or equal to] n;
To illustrate, let us consider a simple search tree of arity a, depth d.
e arity n clinic " MUMs also support the work of Malawian midwife Charity Salima, who runs her ownin Lilongwe, and Joyful Motherhood, a programme run by Malawian nurse Beatrice Namaleu.
Intuitively, if all mutual exclusion sets of all arity are marked, then the planning graph proposition layers correspond exactly to the projection tree states.
We then say that A is a fixed arity tree automaton.
In practice the general case is to have not only relations of fixed arity, but even relations with an arbitrary number of arguments.
The second property indicates that query is_leaf (an attribute or function) must return true if and only if the node's arity is 0.
If p [element of] [Pi], then #(p) [element of] N denotes the arity of p.
The Prolog notation p/n is used to represent a predicate with symbol p and arity n.
The main difficulty consists in the fact that relations of higher arity may connect elements of a string that may be very distant from one another and it is not a priori clear how a finite state automaton should be able to guess such connections and check their global consistency.
He was an early topology enthusiast and applied topological theorems to his own logic diagrams, proving among other things that no concept requires a relation of arity greater than three in its definition.