FOR REWRITING SYSTEMS THE TOPOLOGICAL FINITENESS CONDITIONS FDT AND FHT ARE NOT EQUIVALENT
From MaRDI portal
Publication:4819185
DOI10.1112/S0024610703004903zbMath1072.20066MaRDI QIDQ4819185
Friedrich Otto, Stephen J. Pride
Publication date: 24 September 2004
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Free semigroups, generators and relations, word problems (20M05) Topological methods in group theory (57M07) Homological methods in group theory (20J05) Grammars and rewriting systems (68Q42) Connections of semigroups with homological algebra and category theory (20M50)
Related Items (9)
A Lyndon's identity theorem for one-relator monoids ⋮ Homotopy bases and finite derivation type for subgroups of monoids. ⋮ For finitely presented monoids the homological finiteness conditions FHT and \(\text{bi-FP}_3\) coincide ⋮ Topological finiteness properties of monoids. I: Foundations ⋮ Homological finiteness properties of monoids, their ideals and maximal subgroups. ⋮ The submonoid and rational subset membership problems for graph groups. ⋮ On higher order homological finiteness of rewriting systems. ⋮ FINITENESS CONDITIONS FOR REWRITING SYSTEMS ⋮ Semigroups with finitely generated universal left congruence
This page was built for publication: FOR REWRITING SYSTEMS THE TOPOLOGICAL FINITENESS CONDITIONS FDT AND FHT ARE NOT EQUIVALENT
