Skip to main content

Properties of domain representations of spaces through dyadic subbases


A dyadic subbase S of a topological space X is a subbase consisting of a countable collection of pairs of open subsets that are exteriors of each other. If a dyadic subbase S is proper, then we can construct a dcpo DS in which X is embedded. We study properties of S with respect to two aspects. (i) Whether the dcpo DS is consistently complete depends on not only S itself but also the enumeration of S. We give a characterization of S that induces the consistent completeness of DS regardless of its enumeration. (ii) If the space X is regular Hausdorff, then X is embedded in the minimal limit set of DS . We construct an example of a Hausdorff but non-regular space with a dyadic subbase S such that the minimal limit set of DS is empty.

Hide All
Blanck, J. (2000). Domain representations of topological spaces. Theoretical Computer Science 247 (1–2), 229255, Elsevier Science.
Erdős, P. (1934). A theorem of Sylvester and Schur. Journal of London Mathematical Society s1-9 (4), 282288.
Gianantonio, P. D. (1999). An abstract data type for real numbers. Theoretical Computer Science 221 (1–2), 295326.
Gierz, G., Hofmann, K. H., Keimel, K., Lauson, J. D., Mislove, M. W. and Scott, D. S. (2003). Continuous lattices and domains. Encyclopedia of Mathematics and its Applications 93, Cambridge University Press.
Ohta, H., Tsuiki, H. and Yamada, S. (2011). Independent subbases and non-redundant codings of separable metrizable spaces. Topology and its Applications 158 (1), 114, Elsevier Science.
Plotkin, G. (1978). $\mathbb{T}^{\omega}$ as a universal domain. Journal of Computer and System Sciences 17 (2), 209236.
Steen, L. A. and Seebach, J. A. (1995). Counterexamples in Topology. Dover.
Tsuiki, H. (2002). Real number computation through Gray code embedding. Theoretical Computer Science 284 (2) 467485.
Tsuiki, H. (2004a). Compact metric spaces as minimal-limit sets in domains of bottomed sequences. Mathematical Structures in Computer Science 14 (6) 853878.
Tsuiki, H. (2004b). Dyadic subbases and efficiency properties of the induced {0, 1, ⊥}ω-representations. Topology Proceedings 28 (2) 673687.
Tsuiki, H. and Tsukamoto, Y. (2015). Domain representations induced by dyadic subbases. Logical Methods in Computer Science 11 (1) 117.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 15 *
Loading metrics...

Abstract views

Total abstract views: 104 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 22nd March 2018. This data will be updated every 24 hours.