Oxford Index Search Results

You are looking at 1-20 of 243 items for:

symmetric relation x clear all

Refine by subject

 

Refine by type

Refine by product

 

symmetric relation

Overview page. Subjects: Computing.

A binary relation ∼ on a set S is symmetric if, for all a and b in S, whenever ab then ba.

See overview in Oxford Index

symmetric relation

Christopher Kirwan.

in The Oxford Companion to Philosophy

January 2005; p ublished online January 2005 .

Reference Entry. Subjects: Philosophy. 89 words.

A binary, i.e. two-term, relation is symmetric, or symmetrical, when it holds both ways if at all, i.e. if it

symmetric relation

Christopher Clapham and James Nicholson.

in The Concise Oxford Dictionary of Mathematics

January 2009; p ublished online January 2009 .

Reference Entry. Subjects: Pure Mathematics. 28 words.

A *binary relation ∼ on a set S is symmetric if, for all a and b in S,

symmetric relation

Christopher Clapham and James Nicholson.

in The Concise Oxford Dictionary of Mathematics

January 2014; p ublished online September 2014 .

Reference Entry. Subjects: Pure Mathematics. 29 words.

A *binary relation ∼ on a set S is symmetric if, for all a and b in S, whenever ...

symmetric relation

Overview page. Subjects: Computing.

A binary relation ∼ on a set S is symmetric if, for all a and b in S, whenever ab then ba.

See overview in Oxford Index

non-symmetric (of a relation)

Christopher Clapham and James Nicholson.

in The Concise Oxford Dictionary of Mathematics

January 2009; p ublished online January 2009 .

Reference Entry. Subjects: Pure Mathematics. 58 words.

Not *symmetric, or *asymmetric, or *antisymmetric. The relation has to hold for some pairs

non‐symmetric ((of a relation))

Christopher Clapham and James Nicholson.

in The Concise Oxford Dictionary of Mathematics

January 2014; p ublished online September 2014 .

Reference Entry. Subjects: Pure Mathematics. 61 words.

Not *symmetric, or *asymmetric, or *antisymmetric. The relation has to hold for some pairs in both orders, and hold for only one order for some other pairs, i.e. there exist elements ...

null...

symmetric relation

Edited by Andrew Butterfield, Gerard Ekembe Ngondi and Anne Kerr.

in A Dictionary of Computer Science

January 2016; p ublished online January 2016 .

Reference Entry. Subjects: Computing. 50 words.

A *relation R defined on a set S and having the property thatwheneverxRytheny...

symmetric relation

John Daintith and Edmund Wright.

in A Dictionary of Computing

January 2008; p ublished online January 2008 .

Reference Entry. Subjects: Computing. 54 words.

A *relation R defined on a set S and having the property thatwhenever x R 

Symmetric Chain Decomposition for Cyclic Quotients of Boolean Algebras and Relation to Cyclic Crystals

Patricia Hersh and Anne Schilling.

in International Mathematics Research Notices

January 2013; p ublished online January 2012 .

Journal Article. Subjects: Mathematics. 3439 words.

The quotient of a Boolean algebra by a cyclic group is proved to have a symmetric chain decomposition. This generalizes earlier work of Griggs, Killian and Savage on the case of prime...

Go to »  abstract

equivalence relation

Christopher Clapham and James Nicholson.

in The Concise Oxford Dictionary of Mathematics

January 2014; p ublished online September 2014 .

Reference Entry. Subjects: Pure Mathematics. 62 words.

A *binary relation ~ on a set S that is *reflexive, *symmetric and *transitive. For an equivalence relation ~, ...

equivalence relation

John Daintith and Edmund Wright.

in A Dictionary of Computing

January 2008; p ublished online January 2008 .

Reference Entry. Subjects: Computing. 46 words.

A *relation that is *transitive, *symmetric, and *reflexive. The concept is a convenient

equivalence relation

Christopher Clapham and James Nicholson.

in The Concise Oxford Dictionary of Mathematics

January 2009; p ublished online January 2009 .

Reference Entry. Subjects: Pure Mathematics. 56 words.

A *binary relation ~ on a set S that is *reflexive, *symmetric and *transitive.

symmetric

Simon Blackburn.

in The Oxford Dictionary of Philosophy

January 2016; p ublished online March 2016 .

Reference Entry. Subjects: Philosophy. 30 words.

A *relation is symmetric when if Rxy, then Ryx. For example, if a person x

symmetric

Simon Blackburn.

in The Oxford Dictionary of Philosophy

January 2008; p ublished online January 2008 .

Reference Entry. Subjects: Philosophy. 30 words.

A *relation is symmetric when if Rxy, then Ryx. For example, if a person x

causal asymmetry

E. J. Lowe.

in The Oxford Companion to Philosophy

January 2005; p ublished online January 2005 .

Reference Entry. Subjects: Philosophy. 189 words.

Causation seems to be an anti symmetrical relation, meaning that if an event a is a cause of another event

equivalence relation

Simon Blackburn.

in The Oxford Dictionary of Philosophy

January 2016; p ublished online March 2016 .

Reference Entry. Subjects: Philosophy. 129 words.

A *relation which is transitive, symmetric, and reflexive divides its field into exclusive classes of things. Within each class

equivalence relation

Simon Blackburn.

in The Oxford Dictionary of Philosophy

January 2008; p ublished online January 2008 .

Reference Entry. Subjects: Philosophy. 129 words.

A *relation which is transitive, symmetric, and reflexive divides its field into exclusive classes of things. Within each class

equivalence relation

Christopher Kirwan.

in The Oxford Companion to Philosophy

January 2005; p ublished online January 2005 .

Reference Entry. Subjects: Philosophy. 50 words.

An equivalence relation is a binary, i.e. two-term, relation that is transitive, symmetric, and (strongly) reflexive; for

asymmetric relation

Overview page. Subjects: Computing.

A relation R defined on a set S and having the property that

whenever x R y

then it is never the case that

y R x

where xnull...

See overview in Oxford Index

antisymmetric relation

Overview page. Subjects: Computing.

A relation R defined on a set S and having the property that

whenever x R y and y R x

then x = y

where x and y are arbitrary members of S....

See overview in Oxford Index