On recognising properties of groups which have solvable word problem

DOI10.1007/BF01220872zbMath0195.02001MaRDI QIDQ2539043

Donald J. Collins

Publication date: 1970

Published in: Archiv der Mathematik (Search for Journal in Brave)

zbMATH Keywords

recursion theory, constructive mathematics

Related Items (6)

Unsolvable algorithmic problems for semigroups, groups and rings ⋮ Decision problems in classes of group presentations with uniformly solvable word problem ⋮ Markov-Type Properties ⋮ Detecting properties from descriptions of groups ⋮ General theory of groups ⋮ Model-theoretic and algorithmic questions in group theory

Cites Work

• Recursive unsolvability of group theoretic problems
• Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups
• Recursively enumerable degress and the conjugacy problem
• On recognising Hopf groups
• Machine Configuration and Word Problems of Given Degree of Unsolvability
• On a Problem of J.H.C. Whitehead and a Problem of Alonzo Church.
• On Britton's Theorem A
• A basis for subgroups of free groups
• The word problem

This page was built for publication: On recognising properties of groups which have solvable word problem