On the Relation between the Word Problem and the Conjugacy Problem in Finitely Defined Groups

Journal of Symbolic Logic 34 (3):507-508 (1969)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270935

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,070

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

Review: A. A. Fridman, On the Relation between the Word Problem and the Conjugacy Problem in Finitely Defined Groups. [REVIEW]J. L. Britton - 1969 - Journal of Symbolic Logic 34 (3):507-508.
Review: A. A. Fridman, Degrees of Unsolvability of the Word Problem for Finitely Defined Groups. [REVIEW]D. J. Collins - 1969 - Journal of Symbolic Logic 34 (1):114-115.
Degrees of Unsolvability of the Word Problem for Finitely Defined Groups.A. A. Fridman - 1969 - Journal of Symbolic Logic 34 (1):114-115.
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.
On Group-theoretic Decision Problems and Their Classification.Charles F. Miller - 1971 - Princeton University Press.
A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups.Armin Weiss - 2016 - In Delaram Kahrobaei, Bren Cavallo & David Garber (eds.), Algebra and computer science. Providence, Rhode Island: American Mathematical Society.
Recursively Enumerable Degrees and the Conjugacy Problem.Donald J. Collins - 1970 - Journal of Symbolic Logic 35 (3):477-477.
Unsolvability of the Conjugacy Problem in Group Theory.P. S. Novikov - 1958 - Journal of Symbolic Logic 23 (1):52-54.
Recursively Enumerable Degrees and the Conjugacy Problem.Donald J. Collins - 1971 - Journal of Symbolic Logic 36 (3):540-540.
Satisfaction of existential theories in finitely presented groups and some embedding theorems.Abderezak Ould Houcine - 2006 - Annals of Pure and Applied Logic 142 (1):351-365.

Analytics

Added to PP
2015-02-05

Downloads
10 (#1,208,623)

6 months
4 (#1,007,071)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references