Abstract
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).
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,General Mathematics
Reference12 articles.
1. 12. Schiek H. , ÄAhnlichkeitsanalyse von Gruppenrelationen—to appear in Acta Mathematica. ‘
2. On Computable Numbers, with an Application to the Entscheidungsproblem
3. Finite combinatory processes—formulation
4. On an unsolvable problem concerning matrices;Markov;Doklady Akad. Nauk, SSSR,1951
5. An Unsolvable Problem of Elementary Number Theory
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献