Computably regular topological spaces
This article continues the study of computable elementary topology started by the author and T. Grubba in 2009 and extends the author's 2010 study of axioms of computable separation. Several computable T3- and Tychonoff separation axioms are introduced and their logical relation is investigated...
Main Author: | Klaus Weihrauch |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2013-08-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/1192/pdf |
Similar Items
-
Products of effective topological spaces and a uniformly computable Tychonoff Theorem
by: Robert Rettinger, et al.
Published: (2013-11-01) -
Representations of measurable sets in computable measure theory
by: Klaus Weihrauch, et al.
Published: (2014-08-01) -
Turing machines on represented sets, a model of computation for Analysis
by: Nazanin Tavana, et al.
Published: (2011-06-01) -
Computable Jordan Decomposition of Linear Continuous Functionals on $C[0;1]$
by: Klaus Weihrauch, et al.
Published: (2014-09-01) -
Approximation systems for functions in topological and in metric spaces
by: Dimiter Skordev
Published: (2013-11-01)