Bounded complete poset
id:
bounded-complete-poset-302-3042589
title:
Bounded complete poset
text:
In the mathematical field of order theory, a partially ordered set is bounded complete if all of its subsets that have some upper bound also have a least upper bound. Such a partial order can also be called consistently or coherently complete (Visser 2004, p. 182), since any upper bound of a set can be interpreted as some consistent (non-contradictory) piece of information that extends all the information present in the set. Hence the presence of some upper bound in a way guarantees the consiste
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Bounded_complete_poset
date created:
date modified:
2022-10-26T18:28:24Z
main entity:
{"identifier":"Q4949980","url":"https://www.wikidata.org/entity/Q4949980"}
image:
fields total:
13
integrity:
13