The computational complexity of torsion-freeness of finitely presented groups

DOI10.1017/S0004972700031014zbMath0889.03033MaRDI QIDQ4374809

Steffen Lempp

Publication date: 29 May 1998

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

arithmetical hierarchytorsion-free finitely presented group

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40)

Related Items

The computational complexity of module socles, ENDOMORPHISMS OF RELATIVELY HYPERBOLIC GROUPS, The complexity of decomposability of computable rings, The isomorphism problem for torsion-free abelian groups is analytic complete, COMPUTABLE ABELIAN GROUPS, The uniform Martin’s conjecture for many-one degrees, Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories, Detecting properties from descriptions of groups

Cites Work

• Recursive unsolvability of group theoretic problems
• Some Unsolvable Problems about Elements and Subgroups of Groups.
• On a Problem of J.H.C. Whitehead and a Problem of Alonzo Church.
• Unnamed Item
• Unnamed Item