We characterize the categories with ÿnite limits whose exact completions are toposes and discuss some examples and counter-examples.
More exact completions that are toposes
✍ Scribed by Matı́as Menni
- Book ID
- 104307179
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 143 KB
- Volume
- 116
- Category
- Article
- ISSN
- 0168-0072
No coin nor oath required. For personal study only.
✦ Synopsis
Assuming some extra structure (present in realizability and localic examples) we simplify the characterization of the categories with ÿnite limits whose exact completions are toposes given in Menni (J. Pure Appl. Algebra, to appear). This simpliÿcation allows us to obtain new examples and non-examples and also to provide a new perspective and an alternative proof of recent results on the inevitability of untypedness for realizability toposes.
📜 SIMILAR VOLUMES
We show that the class of all circuits is exactly learnable in randomized expected polynomial time using weak subset and weak superset queries. This is a consequence of the following result which we consider to be of independent interest: circuits are exactly learnable in randomized expected polynom