Finiteness and decidability: II
- 1 September 1978
- journal article
- research article
- Published by Cambridge University Press (CUP) in Mathematical Proceedings of the Cambridge Philosophical Society
- Vol. 84 (2) , 207-218
- https://doi.org/10.1017/s0305004100055043
Abstract
It has been known for some time ((6), p. 270; (4), theorem 9·19) that if is a Boolean topos, then the full subcategory Kf of Kuratowski-finite objects in is again a topos. For a non-Boolean topos , however, Kf need not be a topos, as can be seen when is the Sierpinski topos ((1), example 7·1); on the other hand, two other full subcategories of , coinciding with Kf when is Boolean, suggest themselves as candidates for a subtopos of finite objects. Of one of these, the category dKf of decidable K-finite objects in , the Main Theorem of (1) asserts that it is always a (Boolean) topos. The other is the category sKf of -subobjects of K-finite objects. The inclusionsdKf ⊆ Kf ⊆ sKf are clear.are clear.Keywords
This publication has 2 references indexed in Scilit:
- Some topos theoretic concepts of finitenessPublished by Springer Nature ,1975
- Subobject Classifiers and Classes of Subfunctors.MATHEMATICA SCANDINAVICA, 1974