Author:
BOLDO SYLVIE,LELAY CATHERINE,MELQUIOND GUILLAUME
Abstract
In the recent years, numerous proof systems have improved enough to be used for formally verifying non-trivial mathematical results. They, however, have different purposes and it is not always easy to choose which one is adapted to undertake a formalization effort. In this survey, we focus on properties related to real analysis: real numbers, arithmetic operators, limits, differentiability, integrability and so on. We have chosen to look into the formalizations provided in standard by the following systems: Coq, HOL4, HOL Light, Isabelle/HOL, Mizar, ProofPower-HOL, and PVS. We have also accounted for large developments that play a similar role or extend standard libraries: ACL2(r) for ACL2, C-CoRN/MathClasses for Coq, and the NASA PVS library. This survey presents how real numbers have been defined in these various provers and how the notions of real analysis described above have been formalized. We also look at the methods of automation these systems provide for real analysis.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference107 articles.
1. Cohen C. (2012) Formalized Algebraic Numbers: Construction and First Order Theory, Ph.D. thesis, École Polytechnique.
2. Functions and their basic properties;Byliński;Journal of Formalized Mathematics,1990
3. Verifying Mixed Real-Integer Quantifier Elimination
4. An Irrational Construction of ℝ from ℤ
5. Convergent sequences and the limit of sequences;Kotowicz;Journal of Formalized Mathematics,1990
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献