Abstract
We present three newsletters drawn from the documentation of a project aimed at developing a software system which ingests proofs formalized within Zermelo-Fraenkel set theory and checks their compliance with mathematical rigor. Our verifier will accept trivial steps as obvious and will be able to process large proof scripts (say dozens of thousands of proofware lines written on persistent files). To test our prototype proof-checker we are developing, starting from the bare rudiments of set theory, various “proof scenarios,” the largest of which concerns the Cauchy Integral Theorem.
The first newsletter is devoted to the treatment of inductive sets and to the issue of proof modularization, in sight of possible applications of our computerized proof environment in program correctness verification. The second newsletter proposes a decision procedure for ordered Abelian groups, examined in detail, as a candidate for inclusion in the inferential core of our verification system.
The third newsletter discusses how to best define the set of real numbers and prove their basic properties. After having experienced difficulties with the classical approach devised by Dedekind, we now incline to follow the approach originally developed by Cantor and recently adapted by E. A. Bishop and D. S. Bridges.
Work partially supported by MURST/MIUR Grant prot. 2001017741 under project “Aggregate- and number-reasoning for computing: from decision algorithms to constraint programming with multisets, sets, and maps.”
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
E. W. Beth. The Foundations of Mathematics. North-Holland, 1959.
D. S. Bridges. Foundations of Real and Abstract Analysis, volume 174 of Graduate Texts in Mathematics. Springer-Verlag, 1997.
G. Cantor. Uber die Ausdehnung eines Satzes aus der Theorie der trigonometrischen Reihen. Mathematische Annalen, 5:123–132, 1872.
W. M. Farmer, G. J. D., and T. F. J. IMPS: An interactive mathematical proof system. J. of Automated Reasoning, 11:213–248, 1993.
L. Fuchs. Abelian Groups. Academic Press, 1970.
J. A. Goguen and G. Malcolm. Algebraic Semantics of Imperative Programs. MIT, 1996.
Yu. Gurevič. Elementary properties of ordered Abelian groups. Translations of AMS, 46:165–192, 1965.
J. P. Ignizio and T. M. Cavalier. Linear Programming. International Series in Industrial and Systems Engineering. Prentice Hall, New Jersey, 1994.
A. I. Kokorin and V. M. Kopytov. Fully Ordered Groups. Wiley and Sons, 1974.
W. W. McCune. Otter 2.0 User Guide. Technical Report ANL-90/9, Argonne National Laboratory, Argonne, Illinois, 1990.
E. G. Omodeo and J. T. Schwartz. A ‘theory’ mechanism for a proof-verifier based on first-order set theory. In A. Kakas and F. Sadri, editors, Computational Logic: Logic Programming and Beyond — Essays in honour of Bob Kowalski, Part II, volume 2408 of Lecture Notes in Artificial Intelligence. Springer-Verlag, Berlin, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Cantone, D., Omodeo, E.G., Schwartz, J.T., Ursino, P. (2003). Notes from the Logbook of a Proof-Checker’s Project*. In: Dershowitz, N. (eds) Verification: Theory and Practice. Lecture Notes in Computer Science, vol 2772. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39910-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-39910-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21002-3
Online ISBN: 978-3-540-39910-0
eBook Packages: Springer Book Archive