Automated Deduction in Ring Theory

被引:1
|
作者
Padmanabhan, Ranganathan [1 ]
Zhang, Yang [1 ]
机构
[1] Univ Manitoba, Dept Math, Winnipeg, MB R3T 2N2, Canada
来源
关键词
Prover9; Otter; Commutativity; Associative rings;
D O I
10.1007/978-3-319-42432-3_9
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Pover9/Mace4 or its predecessor Otter is one of the powerful automated theorem provers for first-order and equational logic. In this paper we explore various possibilities of using Prover9 in ring theory and semiring theory, in particular, associative rings, rings with involutions, semirings with cancellation laws and near-rings. We code the corresponding axioms in Prover9, check some well-known theorems, for example, Jacobson's commutativity theorem, give some new proofs, and also present some new results.
引用
收藏
页码:67 / 74
页数:8
相关论文
共 50 条