Skip to main content
    • Aa
    • Aa

Mechanizing Nonstandard Real Analysis

  • Jacques D. Fleuriot (a1) and Lawrence C. Paulson (a2)

This paper first describes the construction and use of the hyperreals in the theorem-prover Isabelle within the framework of higher-order logic (HOL). The theory, which includes infinitesimals and infinite numbers, is based on the hyperreal number system developed by Abraham Robinson in his nonstandard analysis (NSA). The construction of the hyperreal number system has been carried out strictly through the use of definitions to ensure that the foundations of NSA in Isabelle are sound. Mechanizing the construction has required that various number systems including the rationals and the reals be built up first. Moreover, to construct the hyperreals from the reals has required developing a theory of filters and ultrafilters and proving Zorn's lemma, an equivalent form of the axiom of choice.

This paper also describes the use of the new types of numbers and new relations on them to formalize familiar concepts from analysis. The current work provides both standard and nonstandard definitions for the various notions, and proves their equivalence in each case. To achieve this aim, systematic methods, through which sets and functions are extended to the hyperreals, are developed in the framework. The merits of the nonstandard approach with respect to the practice of analysis and mechanical theorem-proving are highlighted throughout the exposition.

    • Send article to Kindle

      To send this article to your Kindle, first ensure is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.

      Note you can select to send to either the or variations. ‘’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Mechanizing Nonstandard Real Analysis
      Available formats
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about sending content to Dropbox.

      Mechanizing Nonstandard Real Analysis
      Available formats
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about sending content to Google Drive.

      Mechanizing Nonstandard Real Analysis
      Available formats
Hide All
1. Abrial J. R. and Laffitte G., ‘Towards the mechanization of the proofs of some classical theorems of set theory‘, Preprint, February 1993.
2. Ballantyne A. M. and Bledsoe W. W., ‘Automatic proofs of theorems in analysis using nonstandard analysis’, J. ACM 24 (1977) 353374.
3. Bedrax T., ‘Infmal: prototype of an interactive theorem prover based on infinitesimal analysis’, Master's thesis, Pontifica Universidad Catolica de Chile, 1993. Liciendoen Mathematica con Mencion en Computation Thesis.
4. Beeson M., ‘Using nonstandard analysis to ensure the correctness of symbolic computations’, Internal. J. Found. Comput. Sci. 6 (1995) 299338.
5. Burkill J. C. and Burkill H., A second course in mathematical analysis (Cambridge University Press, 1970).
6. Chuaqui R. and Suppes P., ‘Free-variable axiomatic foundations of infinitesimal analysis: a fragment with finitary consistency proof’, J. Symbolic Logic 60 (1995) 122159.
7. Church A., ‘A formulation of the simple theory of type’, J. Symbolic Logic 5 (1940) 5668.
8. Conway J. H., On numbers and games (Academic Press Inc. (London) Ltd, 1976).
9. Davis P. J. and Hersh R., The mathematical experience (Harmondsworth, Penguin, 1983).
10. Fleuriot J. D. and Paulson L. C., ‘A combination of geometry theorem proving and nonstandard analysis, with application to Newton's Principia’, Automated deduction —CADE-15 (ed. Kirchner C and Kirchner H.), Lecture Notes in Artificial Intelligence 1421 (Springer-Verlag, 1998) 3‘16.
11. Gleason A. M., Fundamentals of abstract analysis, Series in Mathematics (Addison-Wesley, 1966).
12. Gordon M. and Melham T., Introduction to HOL: a theorem proving environment for higher order logic (Cambridge University Press, 1993).
13. Harrison John, ‘Constructing the real numbers in HOL’, Proceedings of the IFIP TC10/WG10.2 International Workshop on Higher Order Logic Theorem Proving and its Applications (ed. Claesen L. J. M. and Gordon M. J. C.), IFIP Trans. A: Comput. Sci. Tech., vol. A-20 (North-Holland, IMEC, Leuven, Belgium, 1992) 145164.
14. Harrison John, Theorem proving with the real numbers (Springer-Verlag, 1998). Also published as Technical Report 408 of the Computer Laboratory, University of Cambridge, 1996.
15. Henle J. M. and Kleinberg E. M., Infinitesimal calculus (The MIT Press, 1979).
16. Hoskins R. F., Standard and nonstandard analysis, Math. Appl. (Ellis Horwood Limited, 1990).
17. Hurd A. E. and P. A. LOEB, An introduction to nonstandard real analysis, Pure Appl. Math. 118 (Academic Press Inc., Boston, MA, 1985).
19. Jutting L. S., ‘Checking Landau's “Grundlagen” in the Automath system’, Ph.D. thesis, Eindhoven University of Technology, 1977.
20. Keisler H. J., Foundations of infinitesimal calculus (Prindle, Weber & Schmidt, 1976).
21. Landau E., Foundations of analysis (Chelsea, 1951).
22. Laugwitz D., ‘Infinitely small quantities in Cauchy's textbooks’, Historia Math. 14 (1987) 258274.
23. Lindstrøm T., ‘An invitation to nonstandard analysis’, Nonstandard analysis and its applications (ed. Cutland N.), London Math. Soc. Student Texts 10 (Cambridge University Press, 1988) 1105.
24. Nipkow T. and Von Oheimb D., ‘Javalight is type-safe — definitely’, Proc. 25th ACM Symp. Principles of Programming Languages (ACM Press, New York, 1998) 161170.
25. Paulson L. C., Isabelle: a generic theorem prover, Lecture Notes in Comput. Sci. 828 (Springer, 1994).
26. Paulson L. C., ‘The inductive approach to verifying cryptographic protocols’, J. Computer Security (1998) 85128.
27. Paulson L. C., ‘Isabelle's object-logics’, Tech. Rep. 286, Computer Laboratory, University of Cambridge (February 1998).
28. Paulson L. C. and K. Grąbczewski, ‘Mechanizing set theory: cardinal arithmetic and the axiom of choice’, Journal of Automat. Reason. 17 (1996) 291323.
29. Robinson A., Non-standard analysis (North-Holland, 1980).
30. Schechter E., Handbook of analysis and its foundations (Academic Press, 1997).
31. Simpson A. P., ‘The Infidel is innocent’, Math. Intelligencer 12 (1990) 4351.
32. Stroyan K. D. and Luxemburg W. A. J., Introduction to the theory of infinitesimals (Academic Press, 1976).
33. Vesley R., ‘An intuitionistic infinitesimal calculus’, Constructive Mathematics (ed. Richman F.), Lecture Notes in Math. 873 (Springer, 1983).
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

LMS Journal of Computation and Mathematics
  • ISSN: -
  • EISSN: 1461-1570
  • URL: /core/journals/lms-journal-of-computation-and-mathematics
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
Type Description Title
Supplementary Materials

Fleuriot and Paulson Appendix

 Unknown (863 KB)
863 KB


Full text views

Total number of HTML views: 0
Total number of PDF views: 54 *
Loading metrics...

Abstract views

Total abstract views: 73 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 23rd October 2017. This data will be updated every 24 hours.