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 sequenc
✦ LIBER ✦
The principle of the excluded third and the Bolzano-Weierstrass lemma
✍ Scribed by J. Billing
- Book ID
- 112788876
- Publisher
- Springer Netherlands
- Year
- 1949
- Tongue
- English
- Weight
- 49 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0004-2080
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The cohesive principle and the Bolzano-W
✍
Alexander P. Kreuzer
📂
Article
📅
2011
🏛
John Wiley and Sons
🌐
English
⚖ 97 KB
On the computational content of the Bolz
✍
Pavol Safarik; Ulrich Kohlenbach
📂
Article
📅
2010
🏛
John Wiley and Sons
🌐
English
⚖ 299 KB
We will apply the methods developed in the field of 'proof mining' to the Bolzano-Weierstraß theorem BW and calibrate the computational contribution of using this theorem in proofs of combinatorial statements. We provide an explicit solution of the Gödel functional interpretation (combined with nega
The Bolzano–Weierstrass Theorem is the j
✍
Vasco Brattka; Guido Gherardi; Alberto Marcone
📂
Article
📅
2012
🏛
Elsevier Science
🌐
English
⚖ 514 KB
On Hindman spaces and the Bolzano–Weiers
✍
Filipów, Rafał
📂
Article
📅
2013
🏛
Elsevier Science
🌐
English
⚖ 258 KB
A Failure of the Bolzano-Weierstrass Lem
✍
Review by: Alonzo Church
📂
Article
📅
1947
🏛
Association for Symbolic Logic
🌐
English
⚖ 189 KB
On the principle of the excluded middle
✍
Łukasiewicz, Jan; Woleński, Jan; Simons, Peter
📂
Article
📅
1987
🏛
Taylor and Francis Group
🌐
English
⚖ 140 KB