˜yÐÄvlog

Advertisement

Advertisement

partial ordering

noun

Mathematics.
  1. a relation defined on a set, having the properties that each element is in relation to itself, the relation is transitive, and if two elements are in relation to each other, the two elements are equal.
Discover More

˜yÐÄvlog History and Origins

Origin of partial ordering1

First recorded in 1940–45

Advertisement

Advertisement

Advertisement

Advertisement

Browse

  • #
  • aa
  • bb
  • cc
  • dd
  • ee
  • ff
  • gg
  • hh
  • ii
  • jj
  • kk
  • ll
  • mm
  • nn
  • oo
  • pp
  • qq
  • rr
  • ss
  • tt
  • uu
  • vv
  • ww
  • xx
  • yy
  • zz