
doi: 10.1007/bf00353657
A poset is u-conditionally complete if a subset has a least upper bound whenever all its subsets of cardinality less than u have upper bounds. The authors prove that for these posets the set of fixed point sets of monotonic functions coincides with the set of its retracts, which can be described as those u-conditionally complete subposets which are well embedded.
order preserving function, order variety, Semilattices, u-conditionally complete poset, retracts, fixed point sets of monotonic functions
order preserving function, order variety, Semilattices, u-conditionally complete poset, retracts, fixed point sets of monotonic functions
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
