Hostname: page-component-7bb8b95d7b-pwrkn Total loading time: 0 Render date: 2024-09-18T14:35:01.536Z Has data issue: false hasContentIssue false
  • English
  • Français

Solution of the Word Problem for Certain Types of Groups I

Published online by Cambridge University Press:  18 May 2009

J. L. Britton
J. L. Britton
Affiliation:
The University Glasgow
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The main result of this series of papers is a theorem on the free product of groups (Theorem 1) which formed part of a doctoral thesis. This theorem has an immediate application to the word problem (Theorem 2). Usually the word problem refers to a finite system of generators and a finite number of defining relations, but in this context it is more natural to allow an infinite number of generators and defining relations. This (infinite) word problem is not solvable in general (Example 2).

Type
Research Article
Information
Glasgow Mathematical Journal , Volume 3 , Issue 1 , December 1956 , pp. 45 - 54
Copyright
Copyright © Glasgow Mathematical Journal Trust 1956

References

REFERENCES

1.Church, A., A note on the Enuscheidungsproblem, J. Symbolic Logic, 1 (1936), 40–41.CrossRefGoogle Scholar
2.Church, A., An unsolvable problem of elementary number theory, Amw. J. Math., 58 (1936), 345–363.CrossRefGoogle Scholar
3.Kleene, S. C, Introduction to Metamathematics (Amsterdam, 1952).Google Scholar
4.Markov, A., On an unsolvable problem concerning matrices, Doklady Akad. Nauk, SSSR, N.S. 78 (1951), 1089–1092.Google Scholar
5.Post, E. L., Finite combinatory processes—formulation 1, J. Symbolic Logic, 1 (1936), 103–105.CrossRefGoogle Scholar
6.Stender, P. V., On the application of the sieve method to the solution of the word problem for certain groups with a denumerable set of generating elements and a denumerable set of defining relations, Mat. Sbornik, N.S. 32 (74) (1953), 97–108.Google Scholar
7.Tartakovskiĭi, V. A., The sieve method in group theory, Mat. Sbornik, N.S. 25 (67) (1949), 3–50.Google Scholar
8.Tartakovskiĭi, V. A., Application of the sieve method to the solution of the word problem for certain types of groups, Mat. Sbornik, N.S. 25 (67) (1949), 251–274.Google Scholar
9.Tartakovskiĭi, V. A., Solution of the word problem for groups with a A; reduced basis for k;>6, Isvestiya Akad. Nauk, SSSR, Ser. Mat., 13 (1949), 483–494.Google Scholar
10.Soc, Amer. Math.. Translation No. 60 (1952), (Translation of Tartakovskiĭi [7], [8] and [9]).Google Scholar
11.Turing, A. M., On computable numbers, with an application to the Entscheidungsproblem, Proc. London Math. Soc. (2), 42 (1937), 230–265.CrossRefGoogle Scholar
12.Schiek, H., ÄAhnlichkeitsanalyse von Gruppenrelationen—to appear in Acta Mathematica. ‘Google Scholar