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.

Categories

Add categories

Keywords

Reprint years

DOI

10.1007/s00153-019-00667-w

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,423

External links

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

Through your library

My notes

Similar books and articles

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.
Computable neighbourhoods of points in semicomputable manifolds.Zvonko Iljazović & Lucija Validžić - 2017 - Annals of Pure and Applied Logic 168 (4):840-859.
On Turing degrees of points in computable topology.Iraj Kalantari & Larry Welch - 2008 - Mathematical Logic Quarterly 54 (5):470-482.
Computability of compact operators on computable Banach spaces with bases.Vasco Brattka & Ruth Dillhage - 2007 - Mathematical Logic Quarterly 53 (4‐5):345-364.
Derivatives of Computable Functions.Ning Zhong - 1998 - Mathematical Logic Quarterly 44 (3):304-316.
A computable version of Banach’s Inverse Mapping Theorem.Vasco Brattka - 2009 - Annals of Pure and Applied Logic 157 (2-3):85-96.
On the convergence of Fourier series of computable Lebesgue integrable functions.Philippe Moser - 2010 - Mathematical Logic Quarterly 56 (5):461-469.
On Computable Self-Embeddings of Computable Linear Orderings.Rodney G. Downey, Bart Kastermans & Steffen Lempp - 2009 - Journal of Symbolic Logic 74 (4):1352 - 1366.
Finite computable dimension does not relativize.Charles F. D. McCoy - 2002 - Archive for Mathematical Logic 41 (4):309-320.
A Banach–Mazur computable but not Markov computable function on the computable real numbers.Peter Hertling - 2005 - Annals of Pure and Applied Logic 132 (2-3):227-246.
Computational complexity on computable metric spaces.Klaus Weirauch - 2003 - Mathematical Logic Quarterly 49 (1):3-21.
Effectivity in Spaces with Admissible Multirepresentations.Matthias Schröder - 2002 - Mathematical Logic Quarterly 48 (S1):78-90.
When series of computable functions with varying domains are computable.Iraj Kalantari & Larry Welch - 2013 - Mathematical Logic Quarterly 59 (6):471-493.
H‐monotonically computable real numbers.Xizhong Zheng, Robert Rettinger & George Barmpalias - 2005 - Mathematical Logic Quarterly 51 (2):157-170.

Analytics

Added to PP
2019-03-01

Downloads
20 (#749,846)

6 months
4 (#800,606)

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