Barr, Michael; Diaconescu, Radu Atomic toposes. (English) Zbl 0429.18006 J. Pure Appl. Algebra 17, 1-24 (1980). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 3 ReviewsCited in 26 Documents MSC: 18B25 Topoi 18F10 Grothendieck topologies and Grothendieck topoi 18F20 Presheaves and sheaves, stacks, descent conditions (category-theoretic aspects) Keywords:atom; local homeomorphism; Grothendieck topos; logical morphism; geometric morphism; left exact left adjoint; complete atomic boolean algebra; set-valued sheaves on sites; groupoid; factorization theorems PDFBibTeX XMLCite \textit{M. Barr} and \textit{R. Diaconescu}, J. Pure Appl. Algebra 17, 1--24 (1980; Zbl 0429.18006) Full Text: DOI References: [1] Barr, M., Exact categories, Exact Categories and Categories of Sheaves, Vol. 236 (1971), Springer-Verlag: Springer-Verlag Berlin, Lecture Notes in Mathematics · Zbl 0217.07003 [2] W. Butler, unpublished notes.; W. Butler, unpublished notes. [3] Diaconescu, R., Change of base for some toposes, Dissertation (1973), Dalhousie University [4] Diaconescu, R., Change of base for toposes with generators, J. Pure Applied Algebra, 6, 191-218 (1975) · Zbl 0353.18002 [5] Grothendieck, A.; Verdier, J.-L., Theorie des Topos, Lecture Notes in Mathematics, Vol. 269, 270 (1972), Springer-Verlag: Springer-Verlag Berlin · Zbl 0249.14006 [6] Johnstone, P., Topos Theory (1977), Academic Press: Academic Press New York · Zbl 0368.18001 [7] Mikkelsen, C. J., Lattice-theoretic and logical aspects of elementary topoi, Aarhus University Notes, 25 (1976) · Zbl 0345.18006 [8] Paré, R., Colimits in topoi, Bull. Amer. Math. Soc., 80, 556-561 (1974) · Zbl 0288.18002 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.