<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-20T05:25:14Z</responseDate>
  <request identifier="137" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:137</identifier>
        <datestamp>2024-03-06T11:05:51Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Dyadic Subbases and Representations of Topological Spaces</dc:title>
          <dc:creator>Tsuiki, Hideki</dc:creator>
          <dc:subject>Dyadic subbase</dc:subject>
          <dc:subject>embedding</dc:subject>
          <dc:subject>computation over topological spaces</dc:subject>
          <dc:subject>Plotkin's $T^\omega$</dc:subject>
          <dc:description>We explain topological properties of the embedding-based approach to&#13;
computability on topological spaces. With this approach, he considered&#13;
a special kind of embedding of a topological space into Plotkin's&#13;
$T^\omega$, which is the set of infinite sequences of $T = \{0,1,\bot \}$.&#13;
We show that such an embedding can also be characterized by a dyadic&#13;
subbase, which is a countable subbase $S = (S_0^0, S_0^1, S_1^0, S_1^1, \ldots)$ such that $S_n^j$ $(n = 0,1,2,\ldots; j = 0,1$ are regular open&#13;
and $S_n^0$ and $S_n^1$ are exteriors of each other.  We survey properties&#13;
of dyadic subbases which are related to efficiency properties of the&#13;
representation corresponding to the embedding.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Hideki Tsuiki</dc:contributor>
          <dc:date>2005</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 4351, Spatial Representation: Discrete vs. Continuous Computational Models (2005)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.04351.15</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-1376</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04351.15</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
