Category Archives: Order theory

(Least) upper bounds for order-preserving maps

A map between non-empty partially ordered sets is said to be order-preserving if entails . The collection of order-preserving maps can be endowed with an ordering relation in a natural way by setting in iff for all . When considering … Continue reading

Posted in Order theory | Leave a comment