Proof mining in L 1 -approximation

Annals of Pure and Applied Logic

Volumn 121, Issue 1, 2003, Pages 1-38

  Kohlenbach, Ulrich ^a   Oliva, Paulo ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Computable analysis; Constructive mathematics; L 1 approximation; Proof mining; Proof theory; Strong unicity

Indexed keywords

EID: 0037447678     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(02)00081-7     Document Type: Article

References (29)

1. J. Avigad, S. Feferman, Gödel's functional ("Dialectica") interpretation, in: S.R. Buss (Ed.), Handbook of Proof Theory, Studies in Logic and the Foundations of Mathematics, vol. 137, Elsevier, North-Holland, Amsterdam, 1998, pp. 337-405.
2. M. Bartelt, W. Li, Error estimates and Lipschitz constants for best approximation in continuous function spaces, Comput. Math. Appl. 30 (3-6) (1995) 255-268.
3. B.O. Björnestål, Continuity of the metric projection operator I-III, The Preprint Series of Department of Mathematics, vol. 17, Royal Institute of Technology, Stockholm, TRITA-MAT, 1975.
4. D.S. Bridges, A constructive development of Chebychev approximation theory, J. Approx. Theory 30 (1980) 99-120.
5. D.S. Bridges, Lipschitz constants and moduli of continuity for the Chebychev projection, Proc. Amer. Math. Soc. 85 (1982) 557-561.
6. E.W. Cheney, An elementary proof of Jackson's theorem on mean-approximation, Math. Mag. 38 (1965) 189-191.
7. E.W. Cheney, Approximation Theory, AMS, Providence, RI, Chelsea, New York, 1966.
8. S. Feferman, Theories of finite type related to mathematical practice, in: J. Barwise (Ed.), Handbook of Mathematical Logic, North-Holland, Amsterdam, 1977, pp. 913-972.
9. K. Gödel, Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes, Dialectica 12 (1958) 280-287.
10. D. Jackson, Note on a class of polynomials of approximation, Trans. Amer. Math. Soc. 22 (1921) 320-326.
11. K.-I. Ko, On the computational complexity of best Chebycheff approximation, J. Complexity 2 (1986) 95-120.
12. K.-I. Ko, Complexity Theory of Real Functions, Birkhäuser, Boston, Basel, Berlin, 1991.
13. U. Kohlenbach, Theory of majorizable and continuous functionals and their use for the extraction of bounds from non-constructive proofs: effective moduli of uniqueness for best approximations from ineffective proofs of uniqueness (german), Ph.D. Thesis, Frankfurt, 1990, pp. xxii+278.
14. U. Kohlenbach, Effective bounds from ineffective proofs in analysis: an application of functional interpretation and majorization, J. Symbolic Logic 57 (1992) 1239-1273.
15. U. Kohlenbach, Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation, Ann. Pure Appl. Logic 64 (1993) 27-94.
16. U. Kohlenbach, 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, Numer. Funct. Anal. Optim. 14 (1993) 581-606.
17. U. Kohlenbach, Analysing proofs in analysis, in: W. Hodges, M. Hyland, C. Steinhorn, J. Truss (Eds.), Logic: from Foundations to Applications, European Logic Colloquium (Keele, 1993), Oxford University Press, Oxford, 1996, pp. 225-260.
18. U. Kohlenbach, Higher order reverse mathematics, to appear in: S. Simpson (ed.), Reverse Mathematics.
19. U. Kohlenbach, On the computational content of the Krasnoselski and Ishikawa fixed point theorems, in: J. Blanck, V. Brattka, P. Hertling (Eds.), Computability and Complexity in Analysis (CCA'2000), Lecture Notes in Computer Science, vol. 2064, Springer, Berlin, 2001, pp. 119-145.
20. U. Kohlenbach, A quantitative version of a theorem due to Borwein-Reich-Shafrir, Numer. Funct. Anal. Optim. 22 (2001) 641-656.
21. U. Kohlenbach, L. Leuştean, Mann iterates of directionally nonexpansive mappings in hyperbolic spaces, 2002, 33pp, submitted.
22. A. Kroó, On the continuity of best approximations in the space of integrable functions, Acta Math. Acad. Sci. Hungar. 32 (1978) 331-348.
23. 1 -approximation, Proc. Amer. Math. Soc. 83 (4) (1981) 725-729.
24. D.J. Newman, H.S. Shapiro, Some theorems on Chebycheff approximation, Duke Math. J. 30 (1963) 673-681.
25. 1 -approximation, Math. Logic Quart. 48 (S1) (2002) 66-77.
26. 1 -Approximation, Cambridge Tracts in Mathematics, vol. 93, Cambridge University Press, Cambridge, MA, 1989.
27. S.G. Simpson, Subsystems of second order arithmetic, Perspectives in Mathematical Logic, Springer, Berlin, 1999.
28. A.S. Troelstra, Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, in: Lecture Notes in Mathematics, vol. 344, Springer, Berlin, 1973.
29. K. Weihrauch, Computable Analysis, Springer, Berlin, 2000.