|
|
A137841
|
|
Number of distinct n-ary operators in a quinternary logic.
|
|
2
|
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
The total number of n-ary operators in a k-valued logic is T = k^(k^n), i.e. if S is a set of k elements, there are T ways of mapping an ordered subset of n elements taken from S to an element of S. Some operators are "degenerate": the operator has arity p, if only p of the n input values influence the output. = therefore the set of operators can be partitioned into n+1 disjoint subsets representing arities from 0 to n.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 5^(5^n).
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|