Tag Archives: domain-complete

Dcpos built as graphs of functions

Let X and P be two dcpos, and let ψ be a map from X to P. When is the graph of ψ a dcpo? I will give you a funny sufficient condition, which involves the so-called d-topology, and Hausdorffness. … Continue reading

Posted in Uncategorized | Tagged , , , | Comments Off on Dcpos built as graphs of functions