scientific article

zbMath0494.20020MaRDI QIDQ3957134

Jürgen Avenhaus, Klaus Madlener

Publication date: 1981

Full work available at URL: https://eudml.org/doc/92148

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexityword problemfinitely presented grouprecursively presented groupsHNN extensionGrzegorczyk hierarchy

Mathematics Subject Classification ID

Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Finite nilpotent groups, (p)-groups (20D15) Recursive functions and relations, subrecursive hierarchies (03D20) Theory of numerations, effectively presented structures (03D45)

Related Items (1)

Model-theoretic and algorithmic questions in group theory

Cites Work

• The word problem and power problem in 1-relator groups are primitive recursive
• Subrekursive Komplexität bei Gruppen. I: Gruppen mit vorgeschriebener Komplexität
• Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: