Automated proof of ring commutativity problems by algebraic methods

DOI10.1016/S0747-7171(08)80020-XzbMath0698.68037MaRDI QIDQ912612

Han-Tao Zhang

Publication date: 1990

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

Euclid's gcd algorithmNewton's binomial theoremring commutativity

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Center, normalizer (invariant elements) (associative rings and algebras) (16U70)

Related Items

Automated Deduction in Ring Theory

Cites Work

• History and basic features of the critical-pair/completion procedure
• Non-resolution theorem proving
• Problem corner: Reasoning about equality
• Structure theory for algebraic algebras of bounded degree
• Unnamed Item
• Unnamed Item