# utka fu'ivla

x1 and x2 are path-linked by binary predicate x3 (ka) via intermediate steps x4 (ce'o; (ordered) list).

For example, "lo stedu ku utka lo birka lo ka (ce'u ce'u) lamji" is true, with x4 equal to something like "lo cnebo ce'o lo cutne ce'o lo janco". (Also: "lo stedu ku lamji'utka lo birka".) Formally, "utka(A, B, P, [L1...L])" is equivalent to "P(A, L1) and P(L1, L and ... and P(L(n-1), L and P(Ln, B)". The x4 may be empty ("lo nomei") if there are no intermediate steps (id est: the relevant path-linking between x1 and x2 is direct). x4 is a list of only the intermediate steps between x1 and x2 and does not include x1 or x2 themselves; it is ordered so that the relevant relation (x3) holds between x1 and the first term/entry of the list (in that order), between each successive pair of consecutive terms/entries of the list (in the order in which they are listed), and between the last term/entry of the list and x2 (in that order). x4 may not be unique. x3 may not be symmetric (commutative) under exchange of its operands. The predicate may be asymmetrical. See also: ".efku", "ki'irsi", ".utka'au", "takni", "taknyklojyzilpra". See ".utkaro" and ".utkakpu" for somewhat stronger conditions.

## In notes:

jatny'utka
x1 is the captain/commander/leader/boss/superior of/to the captain/commander/leader/boss/superior of/to the captain/commander/leader/boss/superior of/to the ... captain/commander/leader/boss/superior of/to x2 (subject, entity, vehicle, domain), connected by intermediate steps x3.
mindy'utka
x1 directly or indirectly commands x2, via intermediaries x3 (ce'o; ordered list), for result x4 (event) to occur.
pafy'utka
x1 is patrilineal/agnatic to/an agnate of x2; x1 is path-connected to x2 via the fatherhood relation, connected by a graph-path passing through intermediate relations/steps (successive agnates) x3 (ce'o; ordered list).
pavmompazy'utka'au'ypanzi
x1 is any child of the first child of the first child of ... the first child of x2, where the graph geodesic through the ancestorship-directed family tree from x1 to x2 is of length (x3) + 1 (li; x3 must be a nonnegative integer or positive infinity), and where "first" is according to (partial) ordering rule x4 (default: chronological order of birth per successive generation within the given lineage; other restrictions on legitimacy etc. may be specified here as well).
pedy'utka
x1 is a friend of a friend of ... a friend of x2 (experiencer), path-connected by the directed friendship relationship via intermediate nodes (friends) x3 (list; ce'o).
pendy'utka
x1 is a friend of a friend of ... a friend of x2 (experiencer), path-connected by the directed friendship relationship via intermediate nodes (friends) x3 (list; ce'o).
sity'utka
x1 = sitna1 = .utka1 cites/quotes/refers to/makes reference to a source, which itself/who themself cites/quotes/refers to/makes reference to a source, which itself/who themself in turn cites/quotes/refers to/makes reference to source, ..., which itself/who themself cites/quotes/refers to/makes reference to source x2 = sitna2 = .utka2, via intermediate path-connecting steps x3 = .utka3 (ordered list; ce'o), all for the same information/statement x4 = sitna3 (du'u).
lamji'utka
x1 is directly or indirectly touching x2 via intermediate steps x3 (ce'o list); x1 and x2 belong to the same connected component.
utka'au
x1 and x2 are path-linked by binary predicate x3 (ka; possibly non-symmetric/non-commutative) via a from-x1-to-x2-directed graph geodesic of length x4 (li; nonnegative integer or positive infinity).
.utkakpu
x1 and x2 are path-connected by ordered binary relation/predicate x3 (ka), such that all paths which satisfy condition(s) x4 (ka; default: no additional conditions) in the relevant graph (x5) linking nodes by said relation x3 in a directed manner and which contain x1 must also (later in the path) contain x2.
utkakpu
x1 and x2 are path-connected by ordered binary relation/predicate x3 (ka), such that all paths which satisfy condition(s) x4 (ka; default: no additional conditions) in the relevant graph (x5) linking nodes by said relation x3 in a directed manner and which contain x1 must also (later in the path) contain x2.
utkaro
x1 and x2 are path-linked by directed binary predicate x3 (ka) via intermediate steps x4 (ordered list; ce'o), such that no other node exists in the graph (x5) to which x2 is connected in the same way/direction.