A Finitely Generated Residually Finite Group with an Unsolvable Word Problem

DOI10.2307/2039314zbMath0261.20020OpenAlexW4235557251MaRDI QIDQ5676392

S. Meskin

Publication date: 1974

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

Mathematics Subject Classification ID

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

Related Items (12)

Obstruction to a Higman embedding theorem for residually finite groups with solvable word problem ⋮ Reflections on some groups of B. H. Neumann ⋮ Algorithmically complex residually finite groups ⋮ Infinite groups ⋮ Not residually finite groups of intermediate growth, commensurability and non-geometricity. ⋮ Amenable groups without finitely presented amenable covers ⋮ Word problems ⋮ Finitely determined members of varieties of groups and rings ⋮ 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 ⋮ Model-theoretic and algorithmic questions in group theory

Cites Work

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

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