{"docId":1023,"paperId":1023,"url":"https:\/\/lmcs.episciences.org\/1023","doi":"10.2168\/LMCS-11(1:11)2015","journalName":"Logical Methods in Computer Science","issn":"","eissn":"1860-5974","volume":[{"vid":152,"name":"Volume 11, Issue 1"}],"section":[],"repositoryName":"arXiv","repositoryIdentifier":"1501.03783","repositoryVersion":2,"repositoryLink":"https:\/\/arxiv.org\/abs\/1501.03783v2","dateSubmitted":"2013-11-09 00:00:00","dateAccepted":"2015-06-25 11:48:41","datePublished":"2015-03-25 00:00:00","titles":["Effective zero-dimensionality for computable metric spaces"],"authors":["Kenny, Robert"],"abstracts":["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.","Comment: 25 pages. To appear in Logical Methods in Computer Science. Results in Section 4 have been presented at CCA 2013"],"keywords":["Mathematics - Logic","Computer Science - Logic in Computer Science"]}