arXiv Analytics

Sign in

arXiv:1501.03783 [math.LO]AbstractReferencesReviewsResources

Effective zero-dimensionality for computable metric spaces

Robert Kenny

Published 2015-01-14Version 1

We begin to study classical dimension theory from the computable analysis (TTE) point of view. For computable metric spaces, several effectivisations of zero-dimensionality are shown to be equivalent. The part of this characterisation that concerns covering dimension extends to higher dimensions and to closed shrinkings of finite open covers. To deal with zero-dimensional subspaces uniformly, four operations (relative to the space and a class of subspaces) are defined; these correspond to definitions of inductive and covering dimensions and a countable basis condition. Finally, an effective retract characterisation of zero-dimensionality is proven under an effective compactness condition. In one direction this uses a version of the construction of bilocated sets.

Comments: 24 pages. To appear in Logical Methods in Computer Science. Results in Section 4 have been presented at CCA 2013
Categories: math.LO, cs.LO
Related articles:
arXiv:1701.04642 [math.LO] (Published 2017-01-17)
Computability of semicomputable manifolds in computable topological spaces
arXiv:1802.01355 [math.LO] (Published 2018-02-05)
A Galois connection between Turing jumps and limits
arXiv:1803.03753 [math.LO] (Published 2018-03-10)
On a metric generalization of the $tt$-degrees and effective dimension theory