The complexity of central series in nilpotent computable groups
From MaRDI portal
Publication:639669
DOI10.1016/j.apal.2011.01.011zbMath1247.03091OpenAlexW2055767407MaRDI QIDQ639669
Barbara F. Csima, D. Reed Solomon
Publication date: 22 September 2011
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2011.01.011
Nilpotent groups (20F18) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Ordered groups (06F15) Word problems, etc. in computability and recursion theory (03D40) Theory of numerations, effectively presented structures (03D45)
Related Items (3)
On Constructive Nilpotent Groups ⋮ The complexity of ascendant sequences in locally nilpotent groups ⋮ COMPUTABLE ABELIAN GROUPS
Cites Work
- Algorithmic complexity of the problem of occurrence in commutants and members of the lower central series
- The algorithmic theory of polycyclic-by-finite groups
- Degree spectra and computable dimensions in algebraic structures
- Relatively convex subgroups of orderable groups
- Varieties of groups
- Some Word-Problems
- A Basis for Free Lie Rings and Higher Commutators in Free Groups
- Reverse mathematics and fully ordered groups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The complexity of central series in nilpotent computable groups