mekso unary operator: cardinality (#, | |)

Usually should be reserved for use on sets; if applied to group, it is the cardinality of the underlying set (Which is the order of the group)- but it should probably not be applied to an element of a group. Application to a graph is ambiguous: is it the number of vertices or edges, or both, or neither, (if it defined at all)? For a set, each unique heretofore not counted element increments the running subtotal by 1 if the set is countable (small infinite or finite). See: |a|.">cu'a, zilkancu, nilzilcmi, gu'au'i.

- utka'au
- x
_{1}and x_{2}are path-linked by binary predicate x_{3}(ka; possibly non-symmetric/non-commutative) via a from-x_{1}-to-x_{2}-directed graph geodesic of length x_{4}(li; nonnegative integer or positive infinity) in graph x_{5}(default: maximal) which is generated by relation x_{3}.