Sentence examples for relation is defined on from inspiring English sources

An order relation is defined on [0, 1]({^{2}}): ((mu _{1}, lambda _{1}) le (mu _{2}, lambda _{2}) Leftrightarrow mu _{1} le mu _{2}), and (lambda _{2} le lambda _{1}), constituting a lattice that will be symbolized by (tau ).

A temporal relation is defined on an 'ordered' pair: in (2), the pair (complained, fever) has type Overlap_After, whereas the pair (fever, complained) has type Before_Overlap.

When qualitative probability relations are defined on a language with a rich enough vocabulary and satisfy one additional axiom, they can be shown to be representable by probability functions i.e., given any qualitative probability relation ⊆, there is a unique probability function P such that A ⊆ B just in case P[A] ≤ P[B].

These relations are defined on propositions, not on the beliefs of an agent, so the focus is not on epistemology per se, although a theory of nonmonotonic logic will certainly have implications for epistemology.

The natural order relation is defined analogously on a set of edges (tubes), a set of vertices, or a united set of edges and vertices.

The cone induces a partial order on, that is, the relation is defined by (1.2).

A graph rewriting relation is defined, then simulated by a tree rewriting relation, which can be in turn simulated by a rewriting relation on equivalence classes of terms.

A second equivalence relation is defined as follows.

A graph consists of a set of elements (vertices or nodes) together with a binary relation that is defined on the set; a relation between two vertices is called edge (Wilson 1996).

Using the previous definition, we have the following lemma: [18] Let z 1, z 2, z 3,... ∈ C and the partial order relation ⪯ is defined on C.

Later, in 2006, Feng and Liu [6] considered a relation ⪯ which is defined on X by x ⪯ y ⇔ η ( d ( x, y ) ) ≤ φ ( x ) − φ ( y ) (1.4).