Z-module reasoning and proving the commutativity of rings of exponent n/spl ges/2

Abstract

We address a well-known problem in the field of automated reasoning that has been used to test the effectiveness of reasoning systems. The problem is the following: for a given integer e greater than two, if a ring R has exponent e, then must R be commutative?.