Chainable and circularly chainable semicomputable sets in computable topological spaces

Archive for Mathematical Logic 58 (7-8):885-897 (2019)
  Copy   BIBTEX

Abstract

We examine conditions under which, in a computable topological space, a semicomputable set is computable. It is known that in a computable metric space a semicomputable set S is computable if S is a continuum chainable from a to b, where a and b are computable points, or S is a circularly chainable continuum which is not chainable. We prove that this result holds in any computable topological space.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,069

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.
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.
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.

Analytics

Added to PP
2019-03-01

Downloads
22 (#733,109)

6 months
5 (#710,385)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

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.

Add more citations

References found in this work

On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.

Add more references