Page "Bounded complete poset" Paragraph 1
from
Wikipedia
Formally, a partially ordered set ( P, ≤) is bounded complete if the following holds for any subset S of P:
Page 1 of 1.
1.989 seconds.