Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-18T10:17:36.040Z Has data issue: false hasContentIssue false

Hierarchies of Computable groups and the word problem1

Published online by Cambridge University Press:  12 March 2014

Frank B. Cannonito*
Affiliation:
Hughes Aircraft Company, Fullerton, California

Extract

The word problem for groups was first formulated by M. Dehn [1], who gave a solution for the fundamental groups of a closed orientable surface of genus g ≧ 2. In the following years solutions were given, for example, for groups with one defining relator [2], free groups, free products of groups with a solvable word problem and, in certain cases, free products of groups with amalgamated subgroups [3], [4], [5]. During the period 1953–1957, it was shown independently by Novikov and Boone that the word problem for groups is recursively undecidable [6], [7]; granting Church's Thesis [8], their work implies that the word problem for groups is effectively undecidable.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable