License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.CCA.2009.2276
URN: urn:nbn:de:0030-drops-22764
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2009/2276/
Go to the corresponding OASIcs Volume Portal

Weihrauch, Klaus
Contributed Papers

Computable Separation in Topology, from T_0 to T_3

pdf-format:
Weihrauch.2276.pdf (0.3 MB)

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.

BibTeX - Entry

@InProceedings{weihrauch:OASIcs:2009:2276,
  author =	{Klaus Weihrauch},
  title =	{{Computable Separation in Topology, from T_0 to T_3}},
  booktitle =	{6th International Conference on Computability and Complexity in Analysis (CCA'09)},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-12-5},
  ISSN =	{2190-6807},
  year =	{2009},
  volume =	{11},
  editor =	{Andrej Bauer and Peter Hertling and Ker-I Ko},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2276},
  URN =		{urn:nbn:de:0030-drops-22764},
  doi =		{10.4230/OASIcs.CCA.2009.2276},
  annote =	{Keywords: Computable topology, computable separation}
}

Keywords: Computable topology, computable separation
Collection: 6th International Conference on Computability and Complexity in Analysis (CCA'09)
Issue Date: 2009
Date of publication: 25.11.2009

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI