reflexive relation

(redirected from Irreflexive)
Also found in: Dictionary, Wikipedia.
Related to Irreflexive: Antisymmetric

reflexive relation

[ri′flek·siv ri‚lā·shən]
(mathematics)
A relation among the elements of a set such that every element stands in that relation to itself.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
Mentioned in ?
References in periodicals archive ?
Positive addiction to running is pleasant but it does not dominate the person's life as in the case of NAR, so the latter could be comparable, for example, to the addiction to compulsive and irreflexive buying, according to Garcia Ureta (2007).
The design features [D.sub.i] of a part are graph's nodes and the dimensions are the edges; edges show the reflexive relations as [D.sub.i] tolerances c1, c2, c3, c4 and irreflexive relations as dimensions C1, C2, C3, C4, C5, C6, C7, C8.
The property of the reductive relationship between theories or different sciences is irreflexive (A theory can not be reduced to itself.), asymmetric (If [T.sub.2] is reduced to [T.sub.1], [T.sub.1] can not be reduced to [T.sub.2] .) and transitive (If [T.sub.2] is reduced to [T.sub.1], and [T.sub.3] to [T.sub.2] , [T.sub.3] can be reduced to [T.sub.1]).
Antisemitism was often a part of official policy, but it was more often an irreflexive business-as-usual conduct of people of all social classes in the fierce struggle for survival what had become, by the early twentieth century, almost universally (at least in urban and semiurban areas) a very hard-scrabble immigrant society.
We will use the term graph if [rho] is irreflexive and symmetric.
Proposition 1 The precedence relation is irreflexive, antisymmetric, and transitive.
A partially ordered set relation is any relation that is either reflexive, transitive, and antisymmetric, or irreflexive, transitive, and asymmetric.
The aggregate and I, she says, are now related by the ancestral of a relation (irreflexive, asymmetrical, and intransitive) called constitution.
A (strict, partial) ordering on a set X is a transitive and irreflexive binary relation on X.