English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

The aim of this paper is to determine the logical and computational strength of instances of the Bolzano‐Weierstraß principle (BW) and a weak variant of it.  We show that BW is instance‐wise equivalent to the weak König’s lemma for Σ 0  1 ‐trees (Σ 0  1 ‐ WKL). This means that from every bounded sequence of reals one can compute an infinite Σ 0  1 ‐0/1‐tree, such that each infinite branch of it yields an accumulation point and vice versa. Especially, this shows that the degrees  d  ≫ 0′ are exactly those containing an accumulation point for all bounded computable sequences.  Let BW weak  be the principle stating that every bounded sequence of real numbers contains a Cauchy subsequence (a sequence converging but not necessarily fast). We show that BW weak  is instance‐wise equivalent to the (strong) cohesive principle (StCOH) and—using this—obtain a classification of the computational and logical strength of BW weak . Especially we show that BW weak  does not solve the halting problem and does not lead to more than primitive recursive growth. Therefore it is strictly weaker than BW. We also discuss possible uses of BW weak . © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim

The cohesive principle and the Bolzano‐Weierstraß principle