Decision problems in classes of group presentations with uniformly solvable word problem

DOI10.1007/BF01234319zbMath0443.20031MaRDI QIDQ1144138

Jody M. Lockhart

Publication date: 1981

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

zbMATH Keywords

finitely presented groupsrecursive presentationspower problemorder problemgroup presentations with uniformly solvable word problem

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Decidability of theories and sets of sentences (03B25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40) Metamathematical considerations in group theory (20A10)

Related Items (3)

Unsolvable algorithmic problems for semigroups, groups and rings ⋮ Detecting properties from descriptions of groups ⋮ Model-theoretic and algorithmic questions in group theory

Cites Work

• Recursive unsolvability of group theoretic problems
• On recognising properties of groups which have solvable word problem
• The near-rings hosted by a class of groups
• Subgroups of finitely presented groups
• An Embedding Theorem for Finitely Generated Groups
• Finitely Presented Groups with Word Problems of Arbitrary Degrees of Insolubility
• Embedding Theorems for Groups
• Unnamed Item
• Unnamed Item

This page was built for publication: Decision problems in classes of group presentations with uniformly solvable word problem