A Finitely Generated Residually Finite Group with an Unsolvable Word Problem

DOI10.2307/2039314MaRDI QIDQ5676392zbMATH OpenOpenAlexFDO

Authors S. Meskin

Publication date 1974

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

Mathematics Subject Classification ID

Word problems, etc. in computability and recursion theory (03D40) Chains and lattices of subgroups, subnormal subgroups (20E15) Local properties of groups (20E25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites work

• Finiteness Conditions for Soluble Groups
• On the decidability of some problems in special classes of groups
• On the Finiteness of Certain Soluble Groups
• Residually finite groups
• Subgroups of finitely presented groups

Cited in

(13)

• Model-theoretic and algorithmic questions in group theory
• Infinite groups
• Not residually finite groups of intermediate growth, commensurability and non-geometricity.
• Finitely determined members of varieties of groups and rings
• Algorithmically complex residually finite groups
• An uncountable family of finitely generated residually finite groups
• Computability of finite quotients of finitely generated groups
• On the virtual and residual properties of a generalization of Bestvina-Brady groups
• Reflections on some groups of B. H. Neumann
• Word problems
• Amenable groups without finitely presented amenable covers
• Virtual retractions in free constructions
• Obstruction to a Higman embedding theorem for residually finite groups with solvable word problem

This page was built for publication: A Finitely Generated Residually Finite Group with an Unsolvable Word Problem

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