Isomorphism Types in Wreath Products and Effective Embeddings of Periodic Groups
DOI10.2307/1999235zbMath0516.20015OpenAlexW4243869449MaRDI QIDQ3663516
Richard E. Phillips, Kenneth Keller Hickin
Publication date: 1983
Full work available at URL: https://doi.org/10.2307/1999235
word problemwreath productTuring degrees2- generator subgroups2-generator pi-groupk-generator subgroups
Subgroup theorems; subgroup growth (20E07) Periodic groups; locally finite groups (20F50) Generators, relations, and presentations of groups (20F05) Undecidability and degrees of sets of sentences (03D35) Extensions, wreath products, and other compositions of groups (20E22) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Cites Work
- Unnamed Item
- Embedding theorems for residually finite groups
- Counting the Periodic Groups Generated by Two Finite Groups
- Embedding Theorems for Groups
- Non-Isomorphic Burnside Groups of Exponent p 2
- Embedding Methods for Periodic Groups
- Degrees of Unsolvability. (AM-55)
- Finiteness Conditions for Soluble Groups
This page was built for publication: Isomorphism Types in Wreath Products and Effective Embeddings of Periodic Groups