## Studying repleteness in the category of cpos

### BibTeX

@MISC{Makkai_studyingrepleteness,

author = {Michael Makkai},

title = {Studying repleteness in the category of cpos},

year = {}

}

### OpenURL

### Abstract

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. Synthetic Domain Theory developed from an idea of Dana Scott: it is consistent with intuitionistic set theory that all functions between domains are continuous. He never wrote about this point of view explicitly, though he presented his ideas in many lectures also suggesting that the model offered by Kleene’s realizability was appropriate, and influenced various thesis works, e.g. [10,13,11,8,12], see also [14]. SDT can now be recognized as defining the “good properties ” required on a category C (usually, a topos with a dominance t: 1 ✲ Σ) in order to develop domain theory within a theory of sets. One of the problems addressed early in the theory was the identification of the sets to be considered as the Scott domains. As one would expect in a synthetic approach, the collection of these should be determined by the “good properties ” of the universe, in an intrinsic way. The best suggestion so far for such a collection comes from [6,15,5] and is that of repleteness. It is an orthogonality condition, see [2], and determines the replete objects of C as those which are completely recoverable from their properties detected by Σ. Say that A is replete (wrt. Σ) if it is orthogonal to all f: X ✲ Y in 1

### Citations

83 | The effective topos - Hyland - 1982 |

67 | Categories of continuous functors - Freyd, Kelly |

60 | Realizability Toposes and Language Semantics - Longley - 1994 |

53 | First steps in synthetic domain theory - Hyland - 1991 |

44 | Continuity and Effectiveness in Topoi - Rosolini - 1986 |

33 | The fixed point property in synthetic domain theory - Taylor - 1991 |

29 | Realizability and Recursive Mathematics - McCarty - 1984 |

17 | is not always sober - Johnstone - 1981 |

15 | Program Verification in Synthetic Domain Theory - Reus - 1995 |

13 | Domain Theory in Realizability Toposes - Phoa - 1990 |

11 | Two models of synthetic domain theory - Fiore, Rosolini - 1997 |

9 | The S-replete construction - Hyland, Moggi - 1995 |

1 | Epis need not be - Lehmann, Pasztor - 1982 |

1 | Letter to Wesley Phoa - Scott - 1989 |