Realizability interpretation of proofs in constructive analysis

Theory of Computing Systems

Volumn 43, Issue 3-4, 2008, Pages 583-602

  Schwichtenberg, Helmut ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

Continuous inverse function; Intermediate value theorem; Non computational quantifier; Program extraction; Realizability

Indexed keywords

INTERMEDIATE VALUE THEOREM; INVERSE FUNCTIONS; NON-COMPUTATIONAL QUANTIFIER; PROGRAM EXTRACTION; REALIZABILITY;

MATHEMATICAL TECHNIQUES;

COMPUTER SCIENCE;

EID: 57249108030     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-007-9027-4     Document Type: Article

References (18)

1. Andersson, P.: Exact real arithmetic with automatic error estimates in a computer algebra system. Master's thesis, Mathematics Department, Uppsala University (2001)
2. J. Berger 2005 Exact calculation of inverse functions Math. Log. Q. 51 2 201 205
3. U. Berger 2005 Uniform Heyting arithmetic Ann. Pure Appl. Log. 133 125 148
4. Berger, U.: Program extraction from normalization proofs. In: Bezem, M., Groote, J. (eds.) Typed Lambda Calculi and Applications. Lecture Notes in Comput. Sci., vol. 664, pp. 91-106. Springer, Berlin (1993)
5. U. Berger M. Eberl H. Schwichtenberg 2003 Term rewriting for normalization by evaluation Inf. Comput. 183 19 42
6. Bishop, E.: Foundations of Constructive Analysis. McGraw-Hill, New York (1967)
7. Cruz-Filipe, L.: Constructive real analysis: a type-theoretical formalization and applications. Ph.D. Thesis, Nijmegen University (2004)
8. Geuvers, H., Wiedijk, F., Zwanenburg, J.: A constructive proof of the fundamental theorem of algebra without using the rationals. In: Callaghan, P., Luo, Z., McKinna, J., Pollack, R. (eds.) Proc. Types 2000. Lecture Notes in Comput. Sci., vol. 2277, pp. 96-111. Springer, Berlin (2000)
9. K. Gödel 1958 Über eine bisher noch nicht benützte Erweiterung des finiten Standpunkts Dialectica 12 280 287
10. Hurewicz, W.: Lectures on Ordinary Differential Equations. MIT Press, Cambridge (1958)
11. Kohlenbach, U.: Real growth in standard parts of analysis. Habilitationsschrift, Fachbereich Mathematik, Universität Frankfurt am Main (1995)
12. Kohlenbach, U.: Proof theory and computational analysis. Electron. Notes Theor. Comput. Sci. 13 (1998), 34 p.
13. Kreisel, G.: Interpretation of analysis by means of constructive functionals of finite types. In: Heyting, A. (ed.) Constructivity in Mathematics, pp. 101-128. North-Holland, Amsterdam (1959)
14. Letouzey, P.: A new extraction for Coq. In: Geuvers, H., Wiedijk, F. (eds.) Types for Proofs and Programs, Second International Workshop, TYPES 2002. Lecture Notes in Comput. Sci., vol. 2646. Springer, Berlin (2003)
15. M. Mandelkern 1982 Continuity of monotone functions Pac. J. Math. 99 2 413 418
16. Moore, R.E.: Interval Analysis. Prentice-Hall, Englewood Cliffs (1966)
17. Schwichtenberg, H.: Constructive analysis with witnesses. In: Schwichtenberg, H., Spies, K. (eds.) Proof Technology and Computation. Proc. NATO Advanced Study Institute, Marktoberdorf, 2003. Series III: Computer and Systems Sciences, vol. 200, pp. 323-353. IOS Press, Utrecht (2006)
18. Troelstra, A.S. (ed.): Metamathematical Investigation of Intuitionistic Arithmetic and Analysis. Lecture Notes in Math., vol. 344. Springer, Berlin (1973)