Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups

DOI10.2307/1970530MaRDI QIDQ2531870zbMATH OpenOpenAlexFDO

Authors William W. Boone

Publication date 1966

Published in Annals of Mathematics. Second Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/1970530

zbMATH Keywords

recursion theory, constructive mathematics

Recommendations

• Turing degrees and the word and conjugacy problems for finitely presented groups.
• Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. I
• scientific article; zbMATH DE number 3995984
• A finitely presented group with almost solvable conjugacy problem.
• Degrees of unsolvability of first order decision problems for finitely presented groups

Cited in

(25)

• Model-theoretic and algorithmic questions in group theory
• Recursive functions in group theory
• Unsolvable algorithmic problems for semigroups, groups and rings
• The complexity of Grigorchuk groups with application to cryptography
• Turing degrees and the word and conjugacy problems for finitely presented groups.
• Recursively enumerable degress and the conjugacy problem
• A new non-Hopf group
• On recognising properties of groups which have solvable word problem
• On the complexity of reduction algorithms in Novikov-Boone constructions
• On the complexity of the identity problem for finitely defined groups
• Embeddings into hopfian groups
• Degrees of unsolvability of the conjugacy problem for finitely-presented groups
• Representation of Turing reducibility by word and conjugacy problems in finitely presented groups
• The word problem for finitely presented quandles is undecidable
• Degrees of word problem for algebras without finitely presented expansions
• The word problem and the isomorphism problem for groups
• Markov-Type Properties
• An algebraic characterization of groups with soluble word problem
• Recursively enumerable sets and degrees
• scientific article; zbMATH DE number 3439107 (Why is no real title available?)
• Degrees of unsolvability of first order decision problems for finitely presented groups
• On Britton's Theorem A
• Computability Theory and Differential Geometry
• Word problems and ceers
• Two results on complexities of decision problems of groups

This page was built for publication: Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups

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