Algebraic equivalents of the solvability of group-theoretic algorithmic problems

DOI10.1007/BF00971829MaRDI QIDQ1144654zbMATH OpenOpenAlexFDO

Authors Oleg Belegradek

Publication date 1980

Published in Siberian Mathematical Journal (Search for Journal in Brave)

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

zbMATH Keywords

finitely generated groupsfinitely presented groupssolvable triviality problemsolvable word problem

Mathematics Subject Classification ID

Word problems, etc. in computability and recursion theory (03D40) Applications of logic to group theory (20A15) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites work

• An algebraic characterization of groups with soluble word problem
• An Embedding Theorem for Finitely Generated Groups
• scientific article; zbMATH DE number 3485772 (Why is no real title available?)
• scientific article; zbMATH DE number 3316081 (Why is no real title available?)
• Omitting quantifier-free types in generic structures
• On algebraically closed groups
• Recursive unsolvability of group theoretic problems
• Subgroups of finitely presented groups
• The Boone-Higman theorem and the conjugacy problem

This page was built for publication: Algebraic equivalents of the solvability of group-theoretic algorithmic problems

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