The word problem and the isomorphism problem for groups

DOI10.1090/S0273-0979-1982-14963-1MaRDI QIDQ3941599zbMATH OpenFDO

Authors John Stillwell

Publication date 1982

Published in Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/S0273-0979-1982-14963-1

zbMATH Keywords

surveyisomorphism problemTuring machinesHNN extensionfinitely presented groupunsolvability of the word problem

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Turing machines and related notions (03D10)

Recommendations

• scientific article; zbMATH DE number 5560346
• Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups
• Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. I
• scientific article; zbMATH DE number 1535398
• An Introduction to Combinatorial Group Theory and the Word Problem

Cites work

• scientific article; zbMATH DE number 3149985 (Why is no real title available?)
• scientific article; zbMATH DE number 3709228 (Why is no real title available?)
• scientific article; zbMATH DE number 3595166 (Why is no real title available?)
• scientific article; zbMATH DE number 3607194 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• scientific article; zbMATH DE number 3045417 (Why is no real title available?)
• A variant of a recursively unsolvable problem
• An essay on free products of groups with amalgamations
• Embedding Theorems for Groups
• Free Products of Groups
• On the classification of homeomorphisms of 2-manifolds and the classification of 3-manifolds
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Recursive unsolvability of a problem of Thue
• Recursive unsolvability of group theoretic problems
• Subgroups of finitely presented groups
• The Word Problem for Groups
• The word problem
• The word problem
• The word problem in fundamental groups of sufficiently large irreducible 3-manifolds
• The word problem in semi-groups with cancellation
• Über einige algorithmische Probleme der Gruppentheorie

Cited in

(23)

• The Word Problem and Related Results for Graph Product Groups
• On the expressivity of feature logics with negation, functional uncertainty, and sort equations
• Complexity classes as mathematical axioms
• Unsolvable algorithmic problems for semigroups, groups and rings
• The Bounded and Precise Word Problems for Presentations of Groups
• On the word problem and the conjugacy problem for groups of the form \(F/V(R)\)
• An Algorithmically Unsolvable Problem in Analysis
• Poincaré's works leading to the Poincaré conjecture
• scientific article; zbMATH DE number 2010461 (Why is no real title available?)
• Efficient Computation in Groups and Simplicial Complexes
• Model-theoretic and algorithmic questions in group theory
• scientific article; zbMATH DE number 4116803 (Why is no real title available?)
• Friends and relatives of \(\mathrm{BS}(1,2)\).
• A discreteness algorithm for 4-punctured sphere groups
• HARMONIC ANALYSIS ON THE POSITIVE RATIONALS. DETERMINATION OF THE GROUP GENERATED BY THE RATIOS
• The complete \(1/N\) expansion of colored tensor models in arbitrary dimension
• The B B Newman spelling theorem
• Groups with a Recursively Enumerable Irreducible Word Problem
• On Britton's Theorem A
• On computing the first higher-order Alexander modules of knots
• The word problem for geometrically finite groups
• Characterizing word problems of groups
• On the word problem for groups defined by periodic relations

This page was built for publication: The word problem and the isomorphism problem for groups

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