On recognising properties of groups which have solvable word problem

DOI10.1007/BF01220872MaRDI QIDQ2539043zbMATH OpenFDO

Authors Donald J. Collins

Publication date 1970

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

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

zbMATH Keywords

recursion theory, constructive mathematics

Cites work

• A basis for subgroups of free 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
• On recognising Hopf groups
• Recursive unsolvability of group theoretic problems
• Recursively enumerable degress and the conjugacy problem
• The word problem
• Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups

Cited in

(6)

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

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

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