RUS  ENG
Full version
JOURNALS // Siberian Journal of Pure and Applied Mathematics // Archive

Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 2011 Volume 11, Issue 2, Pages 27–50 (Mi vngu77)

This article is cited 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.

UDC: 510.23+811.93

Received: 26.03.2010



© Steklov Math. Inst. of RAS, 2025