Talk:Bounded complete poset
![]() | This article is rated Stub-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
|
Merge with "least upper bound property"?
[edit]The definitions of "bounded complete poset" seems to be identical to Least-upper-bound property.
Actually, the definition here seems to be slightly incorrect. It says: every subset with an upper bound has a least upper bound. But every element of the poset is an upper bound for the empty set. So that would imply that for a bounded complete poset, there should be a minimum element, which is not the case. The definition in Least-upper-bound property is correct: every nonempty subset with an upper bound has a least upper bound. That is one more indication why the two articles should probably be merged.
Also, is there a reliable mathematics reference that uses the term "bounded complete"? This should be added. It seems that the reference from Visser is not good for that purpose, as it is mainly about applications of this concept to philosophy? PatrickR2 (talk) 03:40, 13 May 2024 (UTC)