Upper bound in a partially ordered set

An upper bound of a subset

A

of a partially ordered set is an element

u

satisfying

a \leq u

for every

a \in A

.

 Ancestors (7)

 Incoming links (3)

 Synonyms (1)

codex/upper-bound

 View article source

 Discussion (0)

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