|
Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya Matematika, Mekhanika, Informatika, 2011, Volume 11, Issue 2, Pages 27–50
(Mi vngu77)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Russell, the Language for Formal Mathematics
D. Yu. Vlasovab a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
b Novosibirsk State University
Abstract:
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.
Received: 26.03.2010
Citation:
D. Yu. Vlasov, “Russell, the Language for Formal Mathematics”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 11:2 (2011), 27–50
Linking options:
https://www.mathnet.ru/eng/vngu77 https://www.mathnet.ru/eng/vngu/v11/i2/p27
|
Statistics & downloads: |
Abstract page: | 282 | Full-text PDF : | 151 | References: | 51 | First page: | 1 |
|