Journal of Automated Reasoning

, Volume 4, Issue 3, pp 331–352

Proving equivalence of different axiomatizations of free groups

  • Deepak Kapur
  • Hantao Zhang
Problem Corner

DOI: 10.1007/BF00244946

Cite this article as:
Kapur, D. & Zhang, H. J Autom Reasoning (1988) 4: 331. doi:10.1007/BF00244946

Abstract

The equivalence problem of different non-classical equational axiomatizations of free groups due to Higman and Neumann, Neumann, and others, is discussed. It is shown that such problems can be done easily using a rewrite rule based theorem prover such as RRL by generating complete rewriting systems for these axiomatizations. Some of these complete rewriting systems are obtained after introducing new function symbols which do not appear in the original non-classical axiomatizations. It is, however, suspected that these equivalence problems can be a considerable challenge for theorem provers based on other paradigms, such as natural deduction, resolution (clausal as well as non-clausal), and connection graphs.

Key words

Free groupsequivalence problemaxiomatizations

Copyright information

© Kluwer Academic Publishers 1988

Authors and Affiliations

  • Deepak Kapur
    • 1
  • Hantao Zhang
    • 2
  1. 1.Department of Computer ScienceUniversity at Albany, State University of New YorkAlbanyUSA
  2. 2.Department of Computer ScienceRensselaer Polytechnic InstituteTroyUSA