A question of Higman

DOI10.1007/BF01980217MaRDI QIDQ1814620zbMATH OpenOpenAlexFDO

Authors Andrei 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

coenumerablefinitely generated groupgroup of recursive permutationsnonrecursive permutationword problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1534357
• scientific article; zbMATH DE number 166021
• scientific article; zbMATH DE number 1038640
• A question of Kühnau
• A question of Kaplansky
• scientific article; zbMATH DE number 3853969
• On a Question of Quillen
• On a question of Quillen
• On a question of Roitman
• A question of L. A. Shemetkov

Cited in

(5)

• A question of Kühnau
• scientific article; zbMATH DE number 1534357 (Why is no real title available?)
• The co-word problem for the Higman-Thompson group is context-free
• The Higman operations and embeddings of recursive groups
• WEISS'S QUESTION

This page was built for publication: A question of Higman

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1814620)