“Higher-Order” Mathematics in B
In this paper, we investigate the possibility to mechanize the proof of some real complex mathematical theorems in B . For this, we propose a little structure language which allows one to encode mathematical structures and their accompanying theorems. A little tool is also proposed, which translates this language into B, so that Atelier B, the tool associated with B, can be used to prove the theorems. As an illustrative example, we eventually (mechanically) prove the Theorem of Zermelo  stating that any set can be well-ordered. The present study constitutes a complete reshaping of an earlier (1993) unpublished work (referenced in ) done by two of the authors, where the classical theorems of Haussdorf and Zorn were also proved.
KeywordsMathematical Structure Choice Function Proof Obligation Local Constant Complex Proof
Unable to display preview. Download preview PDF.
- 1.J.R. Abrial. The B-Book:Assigning Programs to Meanings. Cambridge University Press (1996).Google Scholar
- 2.N. Bourbaki. Théorie des ensembles. Hermann, Paris, 1970.Google Scholar
- 3.S. Owre, N. Shankar, J. M. Rushby, and D. W. J. Stringer-Calvert PVS language reference version 2.3. Technical report, SRI International, September 1999.Google Scholar
- 5.Markus Wenzel. Using axiomatic type classes in Isabelle. part of the Isabelle distribution. Technical report, TU München, February 2001.Google Scholar
- 8.Clear Sy. Atelier B (version 3.6). 2001.Google Scholar