Decidable Properties of Polycyclic Groups
DOI10.1112/plms/s3-61.3.497zbMath0674.20020MaRDI QIDQ3828191
Publication date: 1990
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/plms/s3-61.3.497
algorithm; undecidability; polycyclic-by-finite groups; automorphism; Hilbert's 10th problem; isomorphism problem; arithmetic group; conjugacy problem; finite presentations; conjugacy of subgroups; finitely generated torsion-free nilpotent group
20F16: Solvable groups, supersolvable groups
20E36: Automorphisms of infinite groups
20G30: Linear algebraic groups over global fields and their integers
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
Related Items