"Higher-Order" Mathematics in B
Identifieur interne : 008974 ( Main/Merge ); précédent : 008973; suivant : 008975"Higher-Order" Mathematics in B
Auteurs : Jean-Raymond Abrial ; Dominique Cansell [France] ; Guy LaffitteSource :
English descriptors
- KwdEn :
Abstract
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.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 003525
- to stream Crin, to step Curation: 003525
- to stream Crin, to step Checkpoint: 001206
Links to Exploration step
CRIN:abrial02bLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="26">"Higher-Order" Mathematics in B</title></titleStmt><publicationStmt><idno type="RBID">CRIN:abrial02b</idno><date when="2002" year="2002">2002</date><idno type="wicri:Area/Crin/Corpus">003525</idno><idno type="wicri:Area/Crin/Curation">003525</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">003525</idno><idno type="wicri:Area/Crin/Checkpoint">001206</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">001206</idno><idno type="wicri:Area/Main/Merge">008974</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">"Higher-Order" Mathematics in B</title><author><name sortKey="Abrial, Jean Raymond" sort="Abrial, Jean Raymond" uniqKey="Abrial J" first="Jean-Raymond" last="Abrial">Jean-Raymond Abrial</name></author><author><name sortKey="Cansell, Dominique" sort="Cansell, Dominique" uniqKey="Cansell D" first="Dominique" last="Cansell">Dominique Cansell</name><affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="region" nuts="2">Lorraine (région)</region></placeName><orgName type="team" n="7">Mosel (Loria)</orgName><orgName type="lab">Laboratoire lorrain de recherche en informatique et ses applications</orgName><orgName type="university">Université de Lorraine</orgName><orgName type="EPST">Centre national de la recherche scientifique</orgName><orgName type="EPST">Institut national de recherche en informatique et en automatique</orgName></affiliation></author><author><name sortKey="Laffitte, Guy" sort="Laffitte, Guy" uniqKey="Laffitte G" first="Guy" last="Laffitte">Guy Laffitte</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>b method</term><term>higher order</term><term>proof structuration</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1528">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.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 008974 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 008974 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= CRIN:abrial02b
|texte= "Higher-Order" Mathematics in B
}}
| This area was generated with Dilib version V0.6.33. |  |