来源：Bulletin of Symbolic Logic, 2011, 17(2): 252-264.
摘要
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.
科研之友
微信
新浪微博
Facebook
分享链接
