@article{CM_1973__27_1_39_0, author = {Cannonito, F. B. and Gatterdam, R. W.}, title = {The word problem in polycyclic groups is elementary}, journal = {Compositio Mathematica}, publisher = {Noordhoff International Publishing}, volume = {27}, number = {1}, year = {1973}, pages = {39-45}, zbl = {0279.20028}, mrnumber = {347990}, language = {en}, url = {http://www.numdam.org/item/CM_1973__27_1_39_0} }

Cannonito, F. B.; Gatterdam, R. W. The word problem in polycyclic groups is elementary. Compositio Mathematica, Volume 27 (1973) no. 1, pp. 39-45. http://www.numdam.org/item/CM_1973__27_1_39_0/

[1] On a problem of Phillip Hall. Annals of Math., 86 (1967), 112-116. | MR 218454 | Zbl 0149.26904

:[2] Word problems and recursively enumerable degrees of unsolvability. Annals of Math., 83 (1966), 520-591. | MR 201499 | Zbl 0173.01204

:[3] Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups. Annals of Math., 84 (1966), 49-84. | MR 201500 | Zbl 0173.01301

:[4] Hierarchies of computable groups and the word problem. J. Symbolic Logic, 31 (1966), 376-392. | MR 224471 | Zbl 0178.32502

:[5] The computability of group constructions, Part I. Word Problems, Boone, Cannonito, Lyndon eds., North-Holland Publishing Company, Amsterdam (1973). | MR 346063

and :[6] The word problem and power problem in 1-relator groups is primitive recursive (submitted for publication). | Zbl 0335.02029

and :[7] Finitely presented groups with word problem of arbitrary degree of insolubility. Proc. London Math. Soc., 14 (1964), 633-676. | MR 179238 | Zbl 0232.20063

:[8] Embeddings of primitive recursive computable groups (submitted for publication).

:[9] The computability of group constructions, Part II Bull. Australian Math. Soc., 8 (1973) 27-60. | MR 446939 | Zbl 0243.02036

:[10] | MR 51790 | Zbl 0047.00703

: Introduction to Metamathematics. Van Nostrand, Princeton, New Jersey (1952).[11] Homology. Springer-Verlag, Berlin (1963). | MR 349792 | Zbl 0133.26502

: