The shortest single axioms for groups of exponent 4

Abstract We study equations of the form ( α = x ), which are single axioms for groups of exponent 4, where α is a term in product only. Every such α must have at least nine variable occurrences, and there are exactly three such α of this size, up to variable renaming and mirroring. These terms were found by an exhaustive search through all terms of this form. Automated techniques were used in two ways: to eliminate many α by verifying that ( α = x ) is ture in some nongroup, and to verify that the group axioms do indeed follow from the successful ( α = x ). We also present an improvement on Neumann's scheme for single axioms for varieties of groups.

[1]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[2]  Frank Pfenning,et al.  Logic Programming and Automated Reasoning , 1994, Lecture Notes in Computer Science.

[3]  Larry Wos,et al.  Application of Automated Deduction to the Search for Single Axioms for Exponent Groups , 1992, LPAR.

[4]  William McCune,et al.  OTTER 1.0 Users' Guide , 1990 .

[5]  W. Taylor Equational logic , 1979 .

[6]  A. N. Prior,et al.  Equational logic , 1968, Notre Dame J. Formal Log..

[7]  B. H. Neumann Another single law for groups , 1981, Bulletin of the Australian Mathematical Society.

[8]  H. Brown,et al.  Computational Problems in Abstract Algebra , 1971 .