"Higher-Order" Mathematics in B - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2002

"Higher-Order" Mathematics in B


In this paper, we investigate the possibility to mechanize the proof of some real complex mathematical theorems in B [1]. 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 [6] stating that any set can be well-ordered. The present study constitutes a complete reshaping of an earlier (1993) unpublished work (referenced in [4]) done by two of the authors, where the classical theorems of Haussdorf and Zorn were also proved.
No file

Dates and versions

inria-00100923 , version 1 (26-09-2006)


  • HAL Id : inria-00100923 , version 1


Jean-Raymond Abrial, Dominique Cansell, Guy Laffitte. "Higher-Order" Mathematics in B. 2nd International Conference of B and Z Users - ZB'2002, D. Bert, J.P. Bowen, M.C. Henson, K. Robinson, Jan 2002, Grenoble, France, pp.370-393. ⟨inria-00100923⟩
105 View
0 Download


Gmail Facebook Twitter LinkedIn More