Yasuyuki Tsukamoto - Existence of strongly proper dyadic subbases

lmcs:3198 - Logical Methods in Computer Science, March 30, 2017, Volume 13, Issue 1 - https://doi.org/10.23638/LMCS-13(1:18)2017
Existence of strongly proper dyadic subbasesArticle

Authors: Yasuyuki Tsukamoto

We consider a topological space with its subbase which induces a coding for each point. Every second-countable Hausdorff space has a subbase that is the union of countably many pairs of disjoint open subsets. A dyadic subbase is such a subbase with a fixed enumeration. If a dyadic subbase is given, then we obtain a domain representation of the given space. The properness and the strong properness of dyadic subbases have been studied, and it is known that every strongly proper dyadic subbase induces an admissible domain representation regardless of its enumeration. We show that every locally compact separable metric space has a strongly proper dyadic subbase.

Comment: 11 pages

https://doi.org/10.23638/LMCS-13(1:18)2017
Source: arXiv.org:1703.05212
Volume: Volume 13, Issue 1
Secondary volumes: Selected Papers of the Conference "Continuity, Computability, Constructivity: From Logic to Algorithms" (CCC 2015)
Published on: March 30, 2017
Imported on: March 30, 2017
Keywords: Mathematics - General Topology, I.1.1, F.3.2, F.4.1
Licence: arXiv.org - Non-exclusive license to distribute

Classifications

Mathematics Subject Classification 20201
Sources:
  • [1] zbMATH Open.

Share and export

Consultation statistics

This page has been seen 3207 times.
This article's PDF has been downloaded 443 times.