Accession Number : AD0746318

Title :   The Word Problem in Polycyclic Groups Is Elementary.

Descriptive Note : Final rept.,

Corporate Author : CALIFORNIA UNIV IRVINE DEPT OF MATHEMATICS

Personal Author(s) : Cannonito,Frank B. ; Gatterdam,Ronald W.

Report Date : 30 JUN 1972

Pagination or Media Count : 13

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)

Descriptors :   (*MATHEMATICAL LOGIC, GROUPS(MATHEMATICS)), RECURSIVE FUNCTIONS, ALGEBRA, SET THEORY, THEOREMS

Subject Categories : Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE