Geodesic
Solution of the Word Problem for Certain Types of Groups I
Glasgow mathematical journal, Tome 2 (1956) no. 1, pp. 45-54

Voir la notice de l'article provenant de la source Cambridge University Press

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). 
Britton, J. L. Solution of the Word Problem for Certain Types of Groups I. Glasgow mathematical journal, Tome 2 (1956) no. 1, pp. 45-54. doi: 10.1017/S2040618500033426
@article{10_1017_S2040618500033426,
     author = {Britton, J. L.},
     title = {Solution of the {Word} {Problem} for {Certain} {Types} of {Groups} {I}},
     journal = {Glasgow mathematical journal},
     pages = {45--54},
     year = {1956},
     volume = {2},
     number = {1},
     doi = {10.1017/S2040618500033426},
     url = {http://geodesic.mathdoc.fr/articles/10.1017/S2040618500033426/}
}
TY  - JOUR
AU  - Britton, J. L.
TI  - Solution of the Word Problem for Certain Types of Groups I
JO  - Glasgow mathematical journal
PY  - 1956
SP  - 45
EP  - 54
VL  - 2
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.1017/S2040618500033426/
DO  - 10.1017/S2040618500033426
ID  - 10_1017_S2040618500033426
ER  - 
%0 Journal Article
%A Britton, J. L.
%T Solution of the Word Problem for Certain Types of Groups I
%J Glasgow mathematical journal
%D 1956
%P 45-54
%V 2
%N 1
%U http://geodesic.mathdoc.fr/articles/10.1017/S2040618500033426/
%R 10.1017/S2040618500033426
%F 10_1017_S2040618500033426

[1] 1.Church, A., A note on the Enuscheidungsproblem, J. Symbolic Logic, 1 (1936), 40–41. Google Scholar | DOI

[2] 2.Church, A., An unsolvable problem of elementary number theory, Amw. J. Math., 58 (1936), 345–363. Google Scholar | DOI

[3] 3.Kleene, S. C, Introduction to Metamathematics (Amsterdam, 1952). Google Scholar

[4] 4.Markov, A., On an unsolvable problem concerning matrices, Doklady Akad. Nauk, SSSR, N.S. 78 (1951), 1089–1092. Google Scholar

[5] 5.Post, E. L., Finite combinatory processes—formulation 1, J. Symbolic Logic, 1 (1936), 103–105. Google Scholar | DOI

[6] 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] 7.Tartakovskiĭi, V. A., The sieve method in group theory, Mat. Sbornik, N.S. 25 (67) (1949), 3–50. Google Scholar

[8] 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] 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] 10.Soc, Amer. Math.. Translation No. 60 (1952), (Translation of Tartakovskiĭi [7], [8] and [9]). Google Scholar

[11] 11.Turing, A. M., On computable numbers, with an application to the Entscheidungsproblem, Proc. London Math. Soc. (2), 42 (1937), 230–265. Google Scholar | DOI

[12] 12.Schiek, H., ÄAhnlichkeitsanalyse von Gruppenrelationen—to appear in Acta Mathematica. ‘ Google Scholar

Cité par Sources :