Specker sequences revisited

Mathematical Logic Quarterly 51 (5):532-540 (2005)
  Copy   BIBTEX

Abstract

Specker sequences are constructive, increasing, bounded sequences of rationals that do not converge to any constructive real. A sequence is said to be a strong Specker sequence if it is Specker and eventually bounded away from every constructive real. Within Bishop's constructive mathematics we investigate non-decreasing, bounded sequences of rationals that eventually avoid sets that are unions of sequences of intervals with rational endpoints. This yields surprisingly straightforward proofs of certain basic results fromconstructive mathematics. Within Russian constructivism, we show how to use this general method to generate Specker sequences. Furthermore, we show that any nonvoid subset of the constructive reals that has no isolated points contains a strictly increasing sequence that is eventually bounded away from every constructive real. If every neighborhood of every point in the subset contains a rational number different from that point, the subset contains a strong Specker sequence

Links

PhilArchive



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

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

Reclassifying the antithesis of Specker’s theorem.Hannes Diener - 2012 - Archive for Mathematical Logic 51 (7-8):687-693.
Constructive notions of equicontinuity.Douglas S. Bridges - 2009 - Archive for Mathematical Logic 48 (5):437-448.
On local non‐compactness in recursive mathematics.Jakob G. Simonsen - 2006 - Mathematical Logic Quarterly 52 (4):323-330.
On the Cauchy completeness of the constructive Cauchy reals.Robert S. Lubarsky - 2007 - Mathematical Logic Quarterly 53 (4‐5):396-414.
Varieties of constructive mathematics.D. S. Bridges - 1987 - New York: Cambridge University Press. Edited by Fred Richman.
Schütte's tautology and the Kochen-Specker theorem.Jeffrey Bub - 1996 - Foundations of Physics 26 (6):787-806.
General random sequences and learnable sequences.C. P. Schnorr & P. Fuchs - 1977 - Journal of Symbolic Logic 42 (3):329-340.

Analytics

Added to PP
2013-12-01

Downloads
21 (#737,450)

6 months
6 (#520,848)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

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.
The Arithmetical Hierarchy of Real Numbers.Xizhong Zheng & Klaus Weihrauch - 2001 - Mathematical Logic Quarterly 47 (1):51-66.
Recursive Approximability of Real Numbers.Xizhong Zheng - 2002 - Mathematical Logic Quarterly 48 (S1):131-156.

Add more references