Computable approximations of a chainable continuum with a computable endpoint

Archive for Mathematical Logic 63 (1):181-201 (2023)
  Copy   BIBTEX

Abstract

It is known that a semicomputable continuum S in a computable topological space can be approximated by a computable subcontinuum by any given precision under condition that S is chainable and decomposable. In this paper we show that decomposability can be replaced by the assumption that S is chainable from a to b, where a is a computable point.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,449

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.
Computability of pseudo-cubes.Marko Horvat, Zvonko Iljazović & Bojan Pažek - 2020 - Annals of Pure and Applied Logic 171 (8):102823.
Algorithmic randomness over general spaces.Kenshi Miyabe - 2014 - Mathematical Logic Quarterly 60 (3):184-204.
Predicatively computable functions on sets.Toshiyasu Arai - 2015 - Archive for Mathematical Logic 54 (3-4):471-485.
Computable metrization.Tanja Grubba, Matthias Schröder & Klaus Weihrauch - 2007 - Mathematical Logic Quarterly 53 (4‐5):381-395.

Analytics

Added to PP
2023-09-14

Downloads
19 (#1,120,317)

6 months
4 (#864,415)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Computability of graphs.Zvonko Iljazović - 2020 - Mathematical Logic Quarterly 66 (1):51-64.
Is the Mandelbrot set computable?Peter Hertling - 2005 - Mathematical Logic Quarterly 51 (1):5-18.

Add more references