An Embedding Theorem for Finitely Generated Groups

Journal of Symbolic Logic 35 (2):340-341 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270559

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,423

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

C. R. J. Clapham. An embedding theorem for finitely generated groups. Proceedings of the London Mathematical Society, ser. 3 vol. 17 , pp. 419–430. [REVIEW]J. C. Shepherdson - 1970 - Journal of Symbolic Logic 35 (2):340-341.
A descriptive view of combinatorial group theory.Simon Thomas - 2011 - Bulletin of Symbolic Logic 17 (2):252-264.
Higman's Embedding Theorem in a General Setting and Its Application to Existentially Closed Algebras.Oleg V. Belegradek - 1996 - Notre Dame Journal of Formal Logic 37 (4):613-624.
Finitely generated groups are universal among finitely generated structures.Matthew Harrison-Trainor & Meng-Che “Turbo” Ho - 2021 - Annals of Pure and Applied Logic 172 (1):102855.
The model theory of finitely generated finite-by-Abelian groups.Francis Oger - 1984 - Journal of Symbolic Logic 49 (4):1115-1124.
Model theoretic connected components of finitely generated nilpotent groups.Nathan Bowler, Cong Chen & Jakub Gismatullin - 2013 - Journal of Symbolic Logic 78 (1):245-259.
Finitely approximable groups and actions Part I: The Ribes—Zaluesskiĭ property.Christian Rosendal - 2011 - Journal of Symbolic Logic 76 (4):1297-1306.
A. A. Fridman. Stépéni nérazréšimosti problémy toždéstva v konéčno oprédélénnyh gruppah. Doklady Akadémii Nauk SSSR, vol. 147 , pp. 805–808. - A. A. Fridman. Degrees of insolvability of the word problem in finitely defined groups. English translation of the preceding by Sue Ann Walker. Soviet mathematics, vol. 3 no. 6 , pp. 1733–1737. - C. R. J. Clapham. Finitely presented groups with word problems of arbitrary degrees of insolubility. Proceedings of the London Mathematical Society, ser. 3 vol. 14 , pp. 633–676. - William W. Boone. Finitely presented group whose word problem has the same degree as that of an arbitrarily given Thue system . Proceedings of the National Academy of Sciences, vol. 53 , pp. 265–269. - William W. Boone. Word problems and recursively enumerable degrees of unsolvability. A first paper on Thue systems. Annals of mathematics, ser. 2 vol. 83 , pp. 520–571. - William W. Boone. Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely p. [REVIEW]J. C. Shepherdson - 1968 - Journal of Symbolic Logic 33 (2):296-297.
The Hahn Embedding Theorem for a Class of Residuated Semigroups.Sándor Jenei - 2020 - Studia Logica 108 (6):1161-1206.

Analytics

Added to PP
2015-02-05

Downloads
11 (#1,427,285)

6 months
5 (#1,067,832)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On decidability of amenability in computable groups.Karol Duda & Aleksander Ivanov - 2022 - Archive for Mathematical Logic 61 (7):891-902.

Add more citations

References found in this work

No references found.

Add more references