Abstract
Formalizing mathematical proofs has as aim to represent arbitrary mathematical notions and proofs on a computer in order to construct a database of certified results useful to learn and develop the subject. At present it is mathematically not appealing to construct formal proofs. To make formalzing more mathematician-friendly one should have a good interface for proofs, definitions and computations. The proof-assistant Mizar does have a good interface for proofs, but not for making computations. Other assistants, like Coq based on type theory, do have a good interface for computations, but not for proofs. This paper sketches ways in which proofs are represented in a mathematical way. Although the underlying formalized statements come from the system Coq, this is not essential Mainly the paper has as aim to convince implementers of mathematical assistants to make systems in such a way that formalizing proofs becomes natural. Much further developed is the work on Isar providing a mathematical proof language for the assistant Isabelle. The approach in this paper is to approximate a proof language by writing proof-sketches, a notion by Wiedijk, with the aim that they should eventually be verifiable by a proof-checker. [Nederpelt, 2002] has a different approach: there the emphasis is on the ease of providing formalizations of mathematical definitions.
For Dick de Bruijn at the occasion of his 85th anniversary
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Bibliography
N.G. de Bruijn. The mathematical vernacular, a language for mathematics and typed sets, in Nederpelt et al. [1994], North-Holland, Elsevier, pp. 865–936. 1994.
R.L. Constable. Using reflection to explain and enhance type theory, in: H. Schwichtenberg (ed.), Proof and Computation, Computer and System Sciences 139, Springer, pp. 109–144. 1995.
F. Kamareddine and R. Nederpelt. A refinement of de Bruijn’s formal language of mathematics, Journal of Logic, Language and Information,to appear.
R. Nederpelt. Weak Type Theory: a formal language for mathematics, Technical Report 02–05,Dept. of Mathematics and Computer Science, Eindhoven University of Technology, Box 513, 5600 MB Eindhoven, The Netherlands. 2002. URL: vubisveb.tue.nl/N/scripts/mgvms32.d11?TS=Sk.
Nederpelt, R. P., J. H. Geuvers and R. de Vrijer (eds.) Selected papers on Automath, North-Holland Publishing Co., Amsterdam. 1994.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Barendregt, H. (2003). Towards an Interactive Mathematical Proof Mode. In: Kamareddine, F.D. (eds) Thirty Five Years of Automating Mathematics. Applied Logic Series, vol 28. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0253-9_2
Download citation
DOI: https://doi.org/10.1007/978-94-017-0253-9_2
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-6440-0
Online ISBN: 978-94-017-0253-9
eBook Packages: Springer Book Archive