Another Characterization of Finitely Generated Groups with a Solvable Word Problem

DOI10.1112/BLMS/14.1.43MaRDI QIDQ3937569zbMATH OpenOpenAlexFDO

Authors Eliyahu Rips

Publication date 1982

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

Full work available at URL https://doi.org/10.1112/blms/14.1.43

zbMATH Keywords

finitely generated groupsfinitely presented groupfirst order languagesolvable word problem

Mathematics Subject Classification ID

Applications of logic to group theory (20A15) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cited in

(4)

• Model-theoretic and algorithmic questions in group theory
• Unsolvable algorithmic problems for semigroups, groups and rings
• Generalized small cancellation conditions, non-positive curvature and diagrammatic reducibility
• On the isolated points in the space of groups.

This page was built for publication: Another Characterization of Finitely Generated Groups with a Solvable Word Problem

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