On local non‐compactness in recursive mathematics

Mathematical Logic Quarterly 52 (4):323-330 (2006)
  Copy   BIBTEX

Abstract

A metric space is said to be locally non-compact if every neighborhood contains a sequence that is eventually bounded away from every element of the space, hence contains no accumulation point. We show within recursive mathematics that a nonvoid complete metric space is locally non-compact iff it is without isolated points.The result has an interesting consequence in computable analysis: If a complete metric space has a computable witness that it is without isolated points, then every neighborhood contains a computable sequence that is eventually computably bounded away from every computable element of the space

Links

PhilArchive



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

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

Unique solutions.Peter Schuster - 2006 - Mathematical Logic Quarterly 52 (6):534-539.
Generalising compactness.Hannes Diener - 2008 - Mathematical Logic Quarterly 54 (1):49-57.
Varieties of constructive mathematics.D. S. Bridges - 1987 - New York: Cambridge University Press. Edited by Fred Richman.
Compactness notions for an apartness space.Douglas S. Bridges - 2012 - Archive for Mathematical Logic 51 (5-6):517-534.
Classifying Dini's Theorem.Josef Berger & Peter Schuster - 2006 - Notre Dame Journal of Formal Logic 47 (2):253-262.
Can constructive mathematics be applied in physics?Douglas S. Bridges - 1999 - Journal of Philosophical Logic 28 (5):439-453.
Reclassifying the antithesis of Specker’s theorem.Hannes Diener - 2012 - Archive for Mathematical Logic 51 (7-8):687-693.
Product a-frames and proximity.Douglas S. Bridges - 2008 - Mathematical Logic Quarterly 54 (1):12-26.
Reverse Mathematics and Recursive Graph Theory.William Gasarch & Jeffry L. Hirst - 1998 - Mathematical Logic Quarterly 44 (4):465-473.
A theory of rules for enumerated classes of functions.Andreas Schlüter - 1995 - Archive for Mathematical Logic 34 (1):47-63.
Natural Topology.Frank Waaldijk - 2012 - Brouwer Society.

Analytics

Added to PP
2013-12-01

Downloads
37 (#423,461)

6 months
5 (#633,186)

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

Nicht konstruktiv beweisbare sätze der analysis.Ernst Specker - 1949 - Journal of Symbolic Logic 14 (3):145-158.
Theorie der Numerierungen I.Ju L. Eršov - 1973 - Mathematical Logic Quarterly 19 (19‐25):289-388.
Theorie der Numerierungen II.J. U. L. Eršov - 1975 - Mathematical Logic Quarterly 21 (1):473-584.
Theorie Der Numerierungen III.Ju L. Erš - 1977 - Mathematical Logic Quarterly 23 (19-24):289-371.
Theorie Der Numerierungen III.Ju L. Erš - 1976 - Mathematical Logic Quarterly 23 (19‐24):289-371.

View all 8 references / Add more references