Problem Corner

Journal of Automated Reasoning

, Volume 4, Issue 3, pp 331-352

First online:

Proving equivalence of different axiomatizations of free groups

  • Deepak KapurAffiliated withDepartment of Computer Science, University at Albany, State University of New York
  • , Hantao ZhangAffiliated withDepartment of Computer Science, Rensselaer Polytechnic Institute

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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 groups equivalence problem axiomatizations