16 Jul
2003
16 Jul
'03
12:48 a.m.
It just occurred to me that there is something closely related in lattice theory; unfortunately I cannot give a reference, but I remember that one calls a subposet P' of a poset P relatively (co)complete if whenever a subset of P' has an upper bound in P, it has a least upper bound in P'. A related question: does anybody know any analogs of the Freyd's Adjoint Functor Theorems for functors between in(co)complete categories? Mamuka