Proof mining in \(L_{1}\)-approximation
DOI10.1016/S0168-0072(02)00081-7zbMath1026.03040MaRDI QIDQ1874241
Ulrich Kohlenbach, Paulo Oliva
Publication date: 22 May 2003
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
constructive mathematicscomputable analysisproof miningmonotone functional interpretationJ\(L_1\)-approximationlogical analysis of prima facie non-effective proofsuniform modulus of uniqueness
Constructive and recursive analysis (03F60) Best approximation, Chebyshev systems (41A50) Approximation by polynomials (41A10) Uniqueness of best approximation (41A52) Functionals in proof theory (03F10) Second- and higher-order arithmetic and fragments (03F35) Constructive real analysis (26E40)
Related Items (7)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation
- A constructive development of Chebyshev approximation theory
- On the computational complexity of best Chebyshev approximations
- Error estimates and Lipschitz constants for best approximation in continuous function spaces
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- Some theorems on Cebysev approximation
- A QUANTITATIVE VERSION OF A THEOREM DUE TO BORWEIN-REICH-SHAFRIR
- Lipschitz Constants and Moduli of Continuity for the Chebyshev Projection
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
- On Strong Unicity of L 1 -Approximation
- Effective bounds from ineffective proofs in analysis: An application of functional interpretation and majorization
- On the continuity of best approximations in the space of integrable functions
- New effective moduli of uniqueness and uniform a priori estimates for constants of strong unicity by logical analysis of known proofs in best approximation theory
- On the Computational Complexity of Best L1-approximation
- An Elementary Proof of Jackson's Theorem on Mean-Approximation
This page was built for publication: Proof mining in \(L_{1}\)-approximation