A question of Higman

DOI10.1007/BF01980217zbMath0742.20032OpenAlexW2016949729MaRDI QIDQ1814620

Andrey S. Morozov

Publication date: 25 June 1992

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01980217

zbMATH Keywords

word problemfinitely generated groupcoenumerablegroup of recursive permutationsnonrecursive permutation

Mathematics Subject Classification ID

General theory for infinite permutation groups (20B07) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Recursive functions and relations, subrecursive hierarchies (03D20) Word problems, etc. in computability and recursion theory (03D40) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Infinite automorphism groups (20B27)

This page was built for publication: A question of Higman