Least element ( $⊥$ )

An element

⊥

of a partially ordered set

P

is a least element if

⊥ \leq x

for every

x \in P

. A least element is unique: two such elements are below each other, so antisymmetry makes them equal.

 Ancestors (8)

 Incoming links (5)

Bounded-complete partially ordered set
Calculus, probability, linear algebra, discrete mathematics, logic and proof, and models of computation examination paper by the University of Oxford (2003)
Past exam of the year 1 of the computer science course of the University of Oxford / 2003 / Calculus, probability, linear algebra, discrete mathematics, logic and proof, and models of computation / 7 / a / Solution
Past exam of the year 1 of the computer science course of the University of Oxford / 2003 / Calculus, probability, linear algebra, discrete mathematics, logic and proof, and models of computation / 8 / c / Solution
Two-chain noncontinuous complete partial order

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic Create my own version