Abstract
In this paper we are interested in the process of formalizing a mathematical text written in Common Mathematical Language (CML) into type theory using intermediate representations in Weak Type Theory [8] and in type theory with open terms. We demonstrate that this method can be reliable not only in the sense that eventually we get formally verified mathematical texts, but also in the sense that we can have a fairly high confidence that we have produced a ‘faithful’ formalization (i.e. that the formal text is as close as possible to the intentions expressed in the informal text).
A computer program that assists a human along the formalization path should create enough “added value” to be useful in practice. We also discuss some problems that such an implementation needs to solve and possible solutions for them.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barendregt, H.: Lambda calculi with types. In: Abramsky, et al. (eds.) Handbook of Logic in Computer Science, pp. 117–309. Oxford University Press, Oxford (1992)
Barendregt, H., Geuvers, H.: Proof assistants using dependent type systems. In: Handbook of Automated Reasoning. Elsevier Science Publishers B.V., Amsterdam (1999)
van Benthem Jutting, L.S.: Checking Landau’s “Grundlagen” in the Automath System. In: Nederpelt, R.P., Geuvers, J.H., de Vrijer, R.C. (eds.) Selected Papers on Automath. Studies in Logic and Foundations of Mathematics, vol. 133, pp. 701–732. North-Holland, Amsterdam (1994)
de Bruijn, N.G.: The mathematical language Automath, its usage and some of its extensions. In: Nederpelt, R.P., Geuvers, J.H., de Vrijer, R.C. (eds.) Selected Papers on Automath. Studies in Logic and Foundations of Mathematics, vol. 133. North-Holland, Amsterdam (1994)
The Coq Development Team, The Coq Proof Assistant Reference Manual - Version V7.4 (February 2003), http://coq.inria.fr/
Jojgov, G.I.: Incomplete Proofs and Terms and Their Use in Interactive Theorem Proving, PhD thesis. Eindhoven University of Technology (2004)
Jojgov, G.I., Nederpelt, R.P., Scheffer, M.: Faithfully reflecting the structure of informal mathematical proofs into formal type theories. In: Proceedings of the MKM Symposium 2003. Elsevier, Amsterdam (2003)
Kamareddine, F., Nederpelt, R.: A refinement of de Bruijn’s formal language of mathematics. Journal of Logic, Language and Information (to appear)
Nederpelt, R.: Weak Type Theory: A formal language for mathematics, Technical report. Eindhoven University of Technology (May 2002)
Pollack, R.: The LEGO Proof Assistant, http://www.dcs.ed.ac.uk/home/lego/index.html
Rudnicki, P.: An overview of the Mizar project. In: Proceedings of the 1992 Workshop on Types for Proofs and Programs (1992), http://www.mizar.org
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jojgov, G., Nederpelt, R. (2004). A Path to Faithful Formalizations of Mathematics. In: Asperti, A., Bancerek, G., Trybulec, A. (eds) Mathematical Knowledge Management. MKM 2004. Lecture Notes in Computer Science, vol 3119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27818-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-27818-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23029-8
Online ISBN: 978-3-540-27818-4
eBook Packages: Springer Book Archive