Gruppen mit vorgeschriebenem Wortproblem
From MaRDI portal
Publication:1215495
DOI10.1007/BF01360857zbMath0302.02013OpenAlexW2003323474MaRDI QIDQ1215495
Publication date: 1975
Published in: Mathematische Annalen (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/182755
Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (4)
Unsolvable algorithmic problems for semigroups, groups and rings ⋮ Infinite groups ⋮ Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem ⋮ Model-theoretic and algorithmic questions in group theory
Cites Work
- Word problems and recursively enumerable degrees at unsolvability. A first paper on Thue systems
- Truth-table degrees and the Boone groups
- An algebraic characterization of groups with soluble word problem
- Ein Rekursiv Aufzählbarer btt‐Grad, der Nicht Zum Wortproblem Einer Gruppe Gehört
- Unnamed Item
- Unnamed Item
This page was built for publication: Gruppen mit vorgeschriebenem Wortproblem