The complexity of ascendant sequences in locally nilpotent groups
From MaRDI portal
Publication:5418658
DOI10.1142/S0218196714500118zbMath1350.03035MaRDI QIDQ5418658
Richard A. Shore, Chris J. Conidis
Publication date: 26 May 2014
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
nilpotent groupcomputabilitycomputably enumerablelocally nilpotent groupcomputable groupascendant subgroup
Applications of logic to group theory (20A15) Generalizations of solvable and nilpotent groups (20F19) Derived series, central series, and generalizations for groups (20F14) Applications of computability and recursion theory (03D80)
Related Items
Cites Work
- Unnamed Item
- The complexity of central series in nilpotent computable groups
- Computable structures and the hyperarithmetical hierarchy
- Subspaces of computable vector spaces
- Turing Computability
- Effective procedures in field theory
- Recursively enumerable vector spaces
- Ordered Groups: A Case Study in Reverse Mathematics
This page was built for publication: The complexity of ascendant sequences in locally nilpotent groups