Kurz gefasst
Fachartikel in der Zeitschrift Computability, 2012. Verfasst von Alexander P. Kreuzer. Die Arbeit wurde bisher 1-mal zitiert (Crossref).
Abstract (Originalsprache)
We study the logical and computational strength of weak compactness in the separable Hilbert space ℓ2. Let weak-BW be the statement the every bounded sequence in ℓ2 has a weak cluster point. It is known that weak-BW is equivalent to ACA0 over RCA0 and thus that it is equivalent to (nested uses of) the usual Bolzano-Weierstraß principle BW. We show that weak-BW is instance-wise equivalent to $\Pi^0_2$ -CA. This means that for each $\Pi^0_2$ sentence A(n) there is a sequence $(x_i)_{i\in{\mathbb{N}}})$ in ℓ2, such that one can define the comprehension function for A(n) recursively in a cluster point of (xi)i. As a consequence we obtain that the degrees d≥T 0″ are exactly the degrees that contain a weak cluster point of any computable, bounded sequence in ℓ2. Since a cluster point of any sequence in the unit interval [0,1] can be computed in a degree low over 0′ (see [10]), this also shows that instances of weak-BW are strictly stronger than instances of BW. We also comment on the strength of weak-BW in the context of abstract Hilbert spaces in the sense of Kohlenbach and show that his construction of a solution for the functional interpretation of weak compactness is optimal, cf. [7]. 2010 Mathematics Subject Classification. Primary 03F60; Secondary 03D80, 03B30.
Zitieren
APA
Kreuzer, A. P. (2012). On the Strength of Weak Compactness. Computability. https://doi.org/10.3233/com-12010
Vancouver
Kreuzer AP. On the Strength of Weak Compactness. Computability. 2012. doi:10.3233/com-12010
BibTeX
@article{Kreuzer2012,
author = {Kreuzer, Alexander P.},
title = {On the Strength of Weak Compactness},
journal = {Computability},
year = {2012},
doi = {10.3233/com-12010}
}
EUVIMED