Computability of pseudo-cubes

Annals of Pure and Applied Logic 171 (8):102823 (2020)
  Copy   BIBTEX

Abstract

We examine topological pairs (\Delta, \Sigma) which have computable type: if X is a computable topological space and f:\Delta \rightarrow X a topological embedding such that f(\Delta) and f(\Sigma) are semicomputable sets in X, then f(\Delta) is a computable set in X. It it known that (D, W) has computable type, where D is the Warsaw disc and W is the Warsaw circle. In this paper we identify a class of topological pairs which are similar to (D, W) and have computable type: we prove that (\Delta, \Sigma) has computable type if \Delta can somehow be approximated by a 2-cell whose boundary circle approximates \Sigma. Moreover, we examine higher-dimensional analogues of such pairs.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 99,322

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Computability of graphs.Zvonko Iljazović - 2020 - Mathematical Logic Quarterly 66 (1):51-64.
Comparing Computability in Two Topologies.Djamel Eddine Amir & Mathieu Hoyrup - 2024 - Journal of Symbolic Logic 89 (3):1232-1250.
Computable metrization.Tanja Grubba, Matthias Schröder & Klaus Weihrauch - 2007 - Mathematical Logic Quarterly 53 (4‐5):381-395.
Computability of measurable sets via effective topologies.Yongcheng Wu & Decheng Ding - 2006 - Archive for Mathematical Logic 45 (3):365-379.

Analytics

Added to PP
2020-05-06

Downloads
36 (#511,066)

6 months
8 (#457,359)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations