加载中…
We give a uniform construction that, on input of a recursive presentation of a group, outputs a recursive presentation of a torsion-free group, isomorphic to whenever is itself torsion-free. We use this to re-obtain a known result, the existence of a universal finitely presented torsion-free group; one into which all finitely presented torsion-free groups embed. We apply our techniques to show that recognising embeddability of finitely presented groups is -hard, -hard, and lies in . We also show that the sets of orders of torsion elements of finitely presented groups are precisely the sets which are closed under taking factors.

生成讲解博客的中文版本

生成AI智能校验的中文版本