Computable Separation in Topology, from T_0 to T_3

Author Klaus Weihrauch



PDF
Thumbnail PDF

File

OASIcs.CCA.2009.2276.pdf
  • Filesize: 336 kB
  • 11 pages

Document Identifiers

Author Details

Klaus Weihrauch

Cite As Get BibTex

Klaus Weihrauch. Computable Separation in Topology, from T_0 to T_3. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 257-268, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009) https://doi.org/10.4230/OASIcs.CCA.2009.2276

Abstract

This article continues the study of computable elementary topology started in (Weihrauch, Grubba 2009). We introduce a number of computable versions of the topological $T_0$ to $T_3$ separation axioms and solve their logical relation completely.  In particular, it turns out that computable $T_1$ is equivalent to computable $T_2$. The strongest axiom $SCT_3$ is used in (Grubba, Schroeder, Weihrauch 2007) to construct a computable metric.

Subject Classification

Keywords
  • Computable topology
  • computable separation

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail