- 등식체계에서의 자동증명
- ; ;
- Journal for History of Mathematics, volume 11, issue 2, 1998, Pages 35~42
Abstract
It is an undecidable problem to determine whether a given equation logically follows from a given set of equations. However, it is possible to give the answer to many instances of the problem, even though impossible to answer all the instances, by using rewrite systems and completion procedures. Rewrite systems and completion procedures can be implemented as computer programs. The new equations such a computer program generates are theorems that hold in the given equational theory. For example, a completion procedure applied on the group axioms generates simple theorems about groups. Mathematics students' teaming to know the existence and mechanisms of computer programs that prove simple theorems can be a significant help to promote the interests in abstract algebra and logic, and the motivation for studying.