In this paper, we will prove the inevitable non-uniformity of two constructions from combinatorial group theory related to the word problem for finitely generated groups and the Higman-Neumann-Neumann Embedding Theorem.
|Original language||English (US)|
|Number of pages||13|
|Journal||Bulletin of Symbolic Logic|
|State||Published - Jun 2011|
All Science Journal Classification (ASJC) codes