Quotients of countably based spaces are not closed under sobrification

Mathematical Structures in Computer Science

Volumn 16, Issue 2, 2006, Pages 223-229

  Gruenhage, Gary ^a   Streicher, Thomas ^b  

^a AUBURN UNIVERSITY   (United States)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750723448     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129506005184     Document Type: Conference Paper

References (14)

1. Battenfeld, I. (2004) A category of topological predomains, Diploma thesis, TU Darmstadt.
2. Bauer, A. (2002) A relationship between equilogical spaces and type two effectivity. Math. Logic Quarterly 48 (suppl. 1) 1-15.
3. Battenfeld, I., Schröder, M. and Simpson, A. (2006) Compactly Generated Domain Theory. Mathematical Structures in Computer Science 16 (this issue)
4. Day, B. J. (1972) A reflection theorem for closed categories. J. Pure and Appl. Algebra 2 1-11.
5. Escardó, M., Lawson, J. and Simpson, A. (2004) Comparing Cartesian closed categories of (core) compactly generated spaces. Topology Appl. 143 (1-3) 105-145.
6. Hyland, M. (1991) First steps in synthetic domain theory. In: Category Theory (Como 1990). Springer-Verlag Lecture Notes in Mathematics 1488 131-156.
7. Johnstone, P. T. (1981) Scott is not always sober. In: Continuous Lattices. Springer-Verlag Lecture Notes in Mathematics 871 282-283.
8. Johnstone, P. T. (1982) Stone Spaces, Cambridge University Press.
9. Menni, M. and Simpson, A. (2002) Topological and limit-space subcategories of countably-based equilogical spaces. Mathematical Structures in Computer Science 12 (6) 739-770.
10. Phoa, W. (1992) Building domains from graph models. Mathematical Structures in Computer Science 2 (3) 277-299.
11. Simpson, A. (2003) Towards a category of topological domains. In: Proceedings of thirteenth ALGI Workshop, RIMS, Kyoto University.
12. Schröder, M. (2003) Admissible Representations for Continuous Computations, Ph.D. Thesis, Fernuniversität Hagen.
13. Streicher, T. (1999) Inductive construction of repletion. Appl. Categ. Structures 7 (1-2) 185-207.
14. Taylor, P. (1991) The fixpoint property in synthetic domain theory. In: Proc. of 6th IEEE Symposium on Logic in Computer Science 152-160.