<?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-08-16T00:12:17Z</responseDate>
  <request identifier="2274" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2274</identifier>
        <datestamp>2024-03-06T10:28:38Z</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>A Note on Closed Subsets in Quasi-zero-dimensional Qcb-spaces (Extended Abstract)</dc:title>
          <dc:creator>Schröder, Matthias</dc:creator>
          <dc:subject>Computable analysis</dc:subject>
          <dc:subject>Qcb-spaces</dc:subject>
          <dc:subject>extendability</dc:subject>
          <dc:description>We introduce the notion of quasi-zero-dimensionality as a substitute for the notion of zero-dimensionality, motivated by the fact that the latter behaves badly in the realm of qcb-spaces. We prove that the category $\QZ$ of quasi-zero-dimensional qcb$_0$-spaces is cartesian closed. Prominent examples of spaces in $\QZ$ are the spaces in the sequential hierarchy of the Kleene-Kreisel continuous functionals. Moreover, we characterise some types of closed subsets  of $\QZ$-spaces in terms of their ability to allow extendability of continuous functions.  These results are related to an open problem in Computable Analysis.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Matthias Schröder</dc:contributor>
          <dc:date>2009</dc:date>
          <dc:relation>Is Part Of OASIcs, Volume 11, 6th International Conference on Computability and Complexity in Analysis (CCA'09) (2009)</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/OASIcs.CCA.2009.2274</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-22748</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2274</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
