On the computational content of the Bolzano-Weierstraß Principle
DOI10.1002/malq.200910106zbMath1209.03046OpenAlexW1964587127MaRDI QIDQ3053232
Pavol Safarik, Ulrich Kohlenbach
Publication date: 4 November 2010
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.200910106
Dialectica interpretationproof mininghard analysismonotone functional interpretationsequential compactnesscomputable functionalscomputational contentBolzano-Weierstraß principleGödel functional interpretation
Constructive and recursive analysis (03F60) Functionals in proof theory (03F10) Metamathematics of constructive systems (03F50) Higher-type and set recursion theory (03D65)
Related Items (8)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Elimination of Skolem functions for monotone formulas in analysis
- On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness
- Things that can and things that cannot be done in PRA
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
- Strongly majorizable functionals of finite type: A model for barrecursion containing discontinuous functionals
- Ordinal analysis of simple cases of bar recursion
- Effective bounds from ineffective proofs in analysis: An application of functional interpretation and majorization
- On the No-Counterexample Interpretation
- On Tao's “finitary” infinite pigeonhole principle
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- On n-quantifier induction
This page was built for publication: On the computational content of the Bolzano-Weierstraß Principle