Degrees of unsolvability of the conjugacy problem for finitely-presented groups

DOI10.1007/BF02219285MaRDI QIDQ2546501zbMATH OpenFDO

Authors Leonid A. Bokut'

Publication date 1969

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02219285

Mathematics Subject Classification ID

Thue and Post systems, etc. (03D03) Recursively (computably) enumerable sets and degrees (03D25)

Cites work

• FINITELY PRESENTED GROUP WHOSE WORD PROBLEM HAS THE SAME DEGREE AS THAT OF AN ARBITRARILY GIVEN THUE SYSTEM (AN APPLICATION OF METHODS OF BRITTON)
• Finitely Presented Groups with Word Problems of Arbitrary Degrees of Insolubility
• scientific article; zbMATH DE number 3289444 (Why is no real title available?)
• scientific article; zbMATH DE number 3301428 (Why is no real title available?)
• scientific article; zbMATH DE number 3322090 (Why is no real title available?)
• scientific article; zbMATH DE number 3090995 (Why is no real title available?)
• The word problem
• Word problems and recursively enumerable degrees at unsolvability. A first paper on Thue systems
• Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups

This page was built for publication: Degrees of unsolvability of the conjugacy problem for finitely-presented groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2546501)