Proof theory and computational analysis

Electronic Notes in Theoretical Computer Science

Volumn 13, Issue , 1998, Pages 124-157

  Kohlenbach, Ulrich ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CHEBYSHEV APPROXIMATION; COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; FUNCTION EVALUATION; INTEGRAL EQUATIONS; MATHEMATICAL MODELS; POLYNOMIALS;

COMPUTATIONAL ANALYSIS; NUMERICAL DATA; POLYNOMIAL BOUNDS; PROOF THEORY;

THEOREM PROVING;

EID: 0003575974     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80219-1     Document Type: Conference Paper

References (24)

1. Beeson M. Foundations of Constructive Mathematics. Springer Ergebnisse der Mathematik und ihrer Grenzgebiete 3. Folge, Band 6. 1985;Springer Berlin Heidelberg, New York Tokyo
2. Bishop E., Bridges D. Constructive analysis. Springer Grundlehren der mathematischen Wissenschaften. vol. 279:1985;. Berlin
3. Brown D.K., Simpson S.G. Which set existence axioms are needed to prove the separable Hahn - Banach theorem? Ann. Pure Appl. Logic. 31:1986;123-144
4. Feferman S. Theories of finite type related to mathematical practice. Barwise J. Handbook of Mathematical Logic. 1977;913-972 North - Holland, Amsterdam
5. Ferreira F. A feasible theory for analysis. J. Smybolic Logic. 59:1994;1001-1011
6. Forster O. Analysis 1. Vieweg Braunschweig/Wiesbaden. 1976
7. Gödel K. Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes. Dialectica. 12:1958;280-287
8. Heuser H. Lehrbuch der Analysis: Teil 1. 1980;Teubner, Stuttgart
9. Howard W.A. Hereditarily majorizable functionals of finite type. Troelstra. 1973
10. Ko K.-I. Complexity theory of real functions. 1991;Birkhäuser; Boston, Basel, Berlin
11. Kohlenbach U. Effective bounds from ineffective proofs in analysis: an application of functional interpretation and majorization. J. Symbolic Logic. 57:1992;1239-1273
12. Kohlenbach U. 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
13. Kohlenbach U. 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. and Optimiz. 14:1993;581-606
14. Kohlenbach U. Analysing proofs in analysis. Hodges W., Hyland M., Steinhorn C., Truss J. Logic: from Foundations to Applications. European Logic Colloquium (Keele, 1993). 1996;225-260 Oxford University Press
15. Kohlenbach U. Real growth in standard parts of analysis. 1995;xv +166 Habilitationsschrift, Frankfurt
16. Kohlenbach U. Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals. Arch. Math. Logic. 36:1996;31-71
17. Kohlenbach, U., Elimination of Skolem functions for monotone formulas in analysis. To appear in: Archive for Mathematical Logic.
18. Kohlenbach, U., The use of a logical principle of uniform boundedness in analysis. To appear in: Proc. 'Logic in Florence 1995.' Synthese Library Kluwer Academic Publisher.
19. Kohlenbach, U., Arithmetizing proofs in analysis. To appear in: Proc. Logic Colloquium 96 (San Sebastian) Springer Lecture Notes in Logic.
20. Kohlenbach, U., On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness. To appear in: Ann. Pure Applied Logic.
21. Kohlenbach, U., On the no-counterexample interpretation. To appear in: J. Symbolic Logic.
22. Parikh R.J. Existence and feasibility in arithmetic. J. Symbolic Logic. 36:1971;494-508
23. Troelstra A.S. Metamathematical investigation of intuitionistic arithmetic and analysis. 344:1973;Springer Lecture Notes in Mathematics
24. Troelstra A.S., van Dalen D. Constructivism in mathematics: An introduction. Vol. I, II:1988;. North - Holland, Amsterdam