Generalizations of Tarski's fixed point theorem for order varieties of complete meet semilattices (Q1121297): Difference between revisions

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.