Dehn's algorithm for the word problem

DOI10.1002/cpa.3160130108zbMath0156.01601OpenAlexW2072798760WikidataQ56068238 ScholiaQ56068238MaRDI QIDQ5537379

Seymour Lipschutz

Publication date: 1960

Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cpa.3160130108

zbMATH Keywords

mathematical logic

Related Items

A class of groups all of whose elements have trivial centralizers ⋮ On conjugacy in Greendlinger eight-groups ⋮ A generalization of a power-conjugacy problem in torsion-free negatively curved groups ⋮ Structure of subgroups with an identity in groups with a small degree of overlap of defining words ⋮ On Dehn's algorithm ⋮ On Dehn's algorithm and the conjugacy problem ⋮ Centralisateurs des éléments d'ordre fini dans les groupes de Greendlinger ⋮ Model-theoretic and algorithmic questions in group theory