Russell, the Language for Formal Mathematics
Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 11 (2011) no. 2, pp. 27-50
Voir la notice de l'article provenant de la source Math-Net.Ru
Russell is a computer language for the formal mathematics, which is intended to represent the modern mathematics on a formal level, provide trustworthy proof verification and automation of routine (technical) proofs. Russell is a high-level superstructure language over the smm language, which, in turn, is a simplified version of metamath language. The main features of Russell are: universality and reliability of metamath, human readable and editable proof texts, which may be managed without external programs. Russell may be concerned a candidate for the QED manifesto realisation.
Keywords:
formal mathematics, automated reasoning, presentation of mathematical knowledge, automated proof checking.
@article{VNGU_2011_11_2_a3,
author = {D. Yu. Vlasov},
title = {Russell, the {Language} for {Formal} {Mathematics}},
journal = {Sibirskij \v{z}urnal \v{c}istoj i prikladnoj matematiki},
pages = {27--50},
publisher = {mathdoc},
volume = {11},
number = {2},
year = {2011},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VNGU_2011_11_2_a3/}
}
D. Yu. Vlasov. Russell, the Language for Formal Mathematics. Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 11 (2011) no. 2, pp. 27-50. http://geodesic.mathdoc.fr/item/VNGU_2011_11_2_a3/