出典:Wikipedia
出典:『Wikipedia』 (2011/03/22 21:34 UTC 版)
In mathematics, especially order theory, a strict weak ordering is a binary relation < on a set S that is a strict partial order (a transitive relation that is irreflexive, or equivalently, that is asymmetric) in which the relation "neither a < b nor b < a" is transitive.