Abstract
For a directed complete poset P, let λ(P) and σ(P) be the lower topology and the Lawson topology on P respectively. We constructively prove that if P is a quasicontinuous domain and all lower closed subsets in (P, λ(P)) are closed in (P, ω(P)),then (P,λ(P)) is strictly completely regular ordered space.
Project supported by the National Natural Science Foundation of China and the Natural Science Foundatioin of Jiangxi Province, China
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bernays, P., A system of axiomatic set theory III, J. Symbolic Logic. 9 (1942), 65-89.
Gierz, G., Hofmann, K., Keimel, K., Lawson, J., Mislove, M., and Scott, D., A Compendium of Continuous Lattices, Springer-Verlag, 1980.
Gierz, G. and Lawson, J., Generalized continuous and hypercon- tinuous lattices, Rocky Mountain J. Math. 11 (1981), 271-296.
Gierz, G., Lawson, J., and Stralka, A., Quasicontinuous poset, Houston J. Math. 9 (1983), 191-208.
Kou Hui, On some questions in domain theory and locale theory, Doctoral dissertation, Sichuan University, 1998.
Lawson, J., Order and strongly sober compactifications, In: G. Reed, A. Roscoe, and R. Wachter (editors), Topology and Category Theory in Computer Science, Oxford Press, 1991, 179-205.
Venugopalan, Quasicontinuous poset, Semigroup Forum, 41 (1990),193-200.
Xu Xiaoquan, Construction of homomorphism of M-continuous lattices,Trans. Amer. Math. Soc. 347 (1995), 3167-3175.
Xu Xiaoquan,Strictly complete regularity of the Lawson topology on a continuous poset, Topology and its Applications, 103 (2000), 37-42.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this paper
Cite this paper
Xu, XQ. (2001). The Lawson Topology on Quasicontinuous Domains. In: Keimel, K., Zhang, GQ., Liu, YM., Chen, YX. (eds) Domains and Processes. Semantic Structures in Computation, vol 1. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-0654-5_2
Download citation
DOI: https://doi.org/10.1007/978-94-010-0654-5_2
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-3859-1
Online ISBN: 978-94-010-0654-5
eBook Packages: Springer Book Archive