arity


Also found in: Dictionary, Encyclopedia, Wikipedia.
Graphic Thesaurus  🔍
Display ON
Animation ON
Legend
Synonym
Antonym
Related
  • noun

Words related to arity

the number of arguments that a function can take

Related Words

References in periodicals archive ?
A term graph is an acyclic rooted graph, in which each node has as label a function symbol or variable, and in which its number of children is compatible with the arity of its label.
1] and are dominated by l, then the interpretation is the empty relation, of the same arity as [E.
We assume that no upper bound is posed on the presence of such members (otherwise the relation could be treated as a finite union of fixed arity relations), and we call members that can appear in rules of this type unrestricted.
n]}, and given a predicate p [element of] [Pi] of arity n, we implicitly refer to [x.
Each node labeled with a function symbol with arity k has k immediate descendants; each node labeled OR has at least two immediate descendants; and the other nodes have no descendants and are called terminal nodes.
We consider second-order logic with equality (unless explicitly stated otherwise) and without function symbols of positive arity.
in accordance with what is typical in databases, we require that each query have an associated arity and that it extract only tuples of that arity.
Another, for our purposes more direct, way is to proceed is to look explicitly at maps of multiple arity.
Reconciliation differs from DFA minimization because we can merge only paths with the same terminal node, and because the likely successor information can have arbitrary arity (for multiway branches), while acceptance in a DFA has arity 2.
The value part of the functor value cell encodes its functions symbol f and arity n.
n]), where f [element of] F is a function symbol of arity n, and [t.
A hypergraph is a graph in which the relation being specified is not necessarily binary; in fact, it need not even be of fixed arity.
n]) with arity n [is greater than or equal to] 0, where [x.
Assume here that the parse trees of types have been put in a canonical form, where [disjunction]-nodes have arbitrary arity, but only non-[disjunction] nodes as children.
The arity of a path p, denoted [Pi]p, is the number of dom's in p, taken modulo 2.