Studying Repleteness in the Category of Cpos
Michael Makkai, Giuseppe Rosolini · Electronic Notes in Theoretical Computer Science · 1997
We consider the notion of replete object in the category of directed complete partial orders and Scott-continuous functions, and show that, contrary to previous expectations, there are non-replete objects. The same happens in the case of ω-complete posets.