The Word Problem in Polycyclic Groups Is Elementary.
Abstract
The word problem in a polycyclic group is shown to be solvable always by an algorithm at level 3 of the Grzegorczyk hierarchy, the so-called (Kalmar) elementary functions. The method of proof shows that an extension of an E sup n(A) group by a group in a large class G of groups results in an (E sup n)(A) group. In particular, the authors obtain a method for constructing new finitely presented (E sup n)(A) groups. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 30, 1972
- Accession Number
- AD0746318
Entities
People
- Frank B. Cannonito
- Ronald W. Gatterdam
Organizations
- University of California, Irvine