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
On the computational content of the Bolzano-Weierstraß Principle
✍ Scribed by Pavol Safarik; Ulrich Kohlenbach
- Publisher
- John Wiley and Sons
- Year
- 2010
- Tongue
- English
- Weight
- 299 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
✦ Synopsis
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 negative translation) as well as the monotone functional interpretation of BW for the product space i∈N [-ki, ki] (with the standard product metric). This results in optimal program and bound extraction theorems for proofs based on fixed instances of BW, i.e. for BW applied to fixed sequences in i∈N [-ki, ki].
📜 SIMILAR VOLUMES
## Abstract Finite difference schemes, named Compact Finite Difference Schemes with Spectral‐like Resolution, have been used for a less crude approximation of the analytical hardness definition as the second‐order derivative of the energy with respect to the electron number. The improved computatio
Co-operation is presented as a technique for radically improving human-computer interaction with complex knowledge bases during problem-identifying and problemsolving tasks. A study of human-human co-operation literature indicated the importance of creating an environment where the refinement of sol