Journal for History of Mathematics (한국수학사학회지)

The Korean Society for History of Mathematics (한국수학사학회)
권호 표지

등식체계에서의 자동증명

  • 위규범 (아주대학교 정보 및 컴퓨터공학부)
  • Published : 1998.12.01
Download PDF
⟨ Previous Next ⟩

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.

Keywords

References

  1. Trans. Amer. Math. Soc. v.39 Some properties of conversion Church, A.;Rosser, J.B.
  2. J. of Symbolic Comput. v.3 Thrmintion of rewriting Dershowitz, N.
  3. Technical Report Memo MTP-3. Mathematics Department, Louisiana Tech. University On proving term rewriting systems are Noetherian Lankford, D.S.
  4. Theoretical Computer Science v.17 Ordering for term rewriting systems Dershowitz, N.
  5. Thechnical Report R-78-943, Dept. of Computer Science Recursively defined ordering for proving termination of term rewriting systems Plaisted, D.A.
  6. Journal of Automated Reasoning v.6 On the recursive decomposition ordering with lexicographic status and other related ordering Lescanne, P.
  7. Proc. 10th Colloq. Trees in Algebra and Programming A path ordering for priving termination of term rewriting systems Kapur, D.;Narendren, P.;Sivakumar, G.
  8. Computational Problems in Abstract Algebra Simple word problems in universal algebra Knuth, D.E.;Bendix, P.B.;J. Leech(ed.)
  9. Ann. Math. v.43 On theories with a combinatorial definition of equivalence Newman, M.H.A.
  10. Journal of ACM v.27 Confluent reductions: Abstract properties and applications to term rewriting systems Huet, G.
  11. Proc. of the 13th Colloq. on Automata On non-termination of Knuth-Bendix algorithm Hermann, M.;Privara
  12. Proc. Combridge Philos. Soc. v.47 On multiplicative systems defined by generators and relations Evans, T.
  13. Universal algebra Equational Logic Taylor, W.;G. Gratzer(ed.)
  14. Dokl. Akad. Nauk SSSR 55 The impossibility of some algorithms in the theory of associative systems Markov, A.A.
  15. J. Symbolic Logic v.13 Recursive unsolvability of a problem of Thue Post, E.L.
  16. Combinatory Logic Curry, H.B.;Feys, R.
  17. Solvable Cases of the Decision Problem Ackermann, W.