Abstract
We have formalized material from an introductory real analysis textbook in the proof assistant Scunak. Scunak is a system based on set theory encoded in a dependent type theory. We use the formalized material to illustrate some interesting aspects of the relationship between informal presentations of mathematics and their formal representation. We focus especially on a representative example proved using the system.
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
Autexier, S., Fiedler, A.: Textbook proofs meet formal logic - the problem of underspecification and granularity. In: Kohlhase, M. (ed.) MKM 2005. LNCS (LNAI), vol. 3863, pp. 96–110. Springer, Heidelberg (2006)
Bartle, R.G., Sherbert, D.R.: Introduction to Real Analysis. John Wiley and Sons, New York (1982)
Baur, J.: Syntax und semantik mathematischer texte. Diploma thesis, Saarland University, Saarbrücken, Germany (1999)
Bertot, Y., Castéran, P.: Interactive Theorem Proving and Program Development. Coq’Art: The Calculus of Inductive Constructions. In: Texts in Theoretical Computer Science. An EATCS Series, Springer, Heidelberg (2004)
Brown, E.C.: Combining Type Theory and Untyped Set Theory. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 205–219. Springer, Heidelberg (2006)
Brown, C.E.: Encoding functional relations in Scunak. In: LFMTP 2006 (September 2006)
Brown, C.E.: Scunak users manual (2006), http://gtps.math.cmu.edu/cebrown/manual.ps
Brown, C.E.: Verifying and invalidating textbook proofs using scunak. In: Borwein, J.M., Farmer, W.M. (eds.) MKM 2006. LNCS (LNAI), vol. 4108, pp. 110–123. Springer, Heidelberg (2006)
Brown, C.E.: Dependently Typed Set Theory. SEKI-Working-Paper SWP–2006–03, SEKI Publications, Saarland Univ., (2006) ISSN 1860–5931
Kotowicz, J.: Real sequences and basic operations on them. Journal of Formalized Mathematics 1 (1989)
Lane, S.M.: Mathematics, Form, and Function. Springer, Heidelberg (1986)
Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)
Reed, J.: Proof irrelevance and strict definitions in a logical framework. Technical Report 02-153, School of Computer Science, Carnegie Mellon University (2002)
Rudnicki, P.: An overview of the mizar project. In: Workshop on Types for Proofs and Programs, pp. 311–332 (1992)
Wiedijk, F.: Mizar: An impression, http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Horozal, F.F., Brown, C.E. (2007). Formal Representation of Mathematics in a Dependently Typed Set Theory. In: Kauers, M., Kerber, M., Miner, R., Windsteiger, W. (eds) Towards Mechanized Mathematical Assistants. MKM Calculemus 2007 2007. Lecture Notes in Computer Science(), vol 4573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73086-6_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-73086-6_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73083-5
Online ISBN: 978-3-540-73086-6
eBook Packages: Computer ScienceComputer Science (R0)