Another Characterization of Finitely Generated Groups with a Solvable Word Problem
From MaRDI portal
Cited in
(5)- Model-theoretic and algorithmic questions in group theory
- Unsolvable algorithmic problems for semigroups, groups and rings
- Generalized small cancellation conditions, non-positive curvature and diagrammatic reducibility
- Comparing the effective content of subshifts
- On the isolated points in the space of groups.
This page was built for publication: Another Characterization of Finitely Generated Groups with a Solvable Word Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3937569)