Expresses action directed towards object.

Extends reachability to all connections.

In mathematics, a binary relation on a set is transitive if, for all elements , , in , whenever relates to and to , then also relates to .

Relation holds consistently across triples.

(databases) An attribute of a relation that depends on a key but also on a third attribute which is not a key; this is a violation of third normal form.

In the mathematical field of graph theory, a transitive reduction of a directed graph is another directed graph with the same vertices and as few edges as possible, such that for all pairs of vertices , a (directed) path from to in exists if and only if such a path exists in the reduction.

Verb acting on two objects.