Obstruction to a Higman embedding theorem for residually finite groups with solvable word problem
From MaRDI portal
Publication:831193
DOI10.1515/jgth-2020-0030zbMath1483.20061arXiv2002.02540OpenAlexW3091051234MaRDI QIDQ831193
Publication date: 11 May 2021
Published in: Journal of Group Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.02540
Related Items (max. 100)
An uncountable family of finitely generated residually finite groups ⋮ Computability of finite quotients of finitely generated groups
Cites Work
- Arbitrarily large residual finiteness growth
- Algorithmically complex residually finite groups
- Quantifying residual finiteness.
- On the Infinitude of Primes
- A family of groups with nice word problems
- On the decidability of some problems in special classes of groups
- A Finitely Generated Residually Finite Group with an Unsolvable Word Problem
- The decision problem for some classes of sentences without quantifiers
- A topology for free groups and related groups
This page was built for publication: Obstruction to a Higman embedding theorem for residually finite groups with solvable word problem