The Word Problem for Lattice-Order Groups

DOI10.2307/1999605zbMath0527.06009OpenAlexW4249655693MaRDI QIDQ3043204

A. M. W. Glass, Yuri Gurevich

Publication date: 1983

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

Full work available at URL: https://doi.org/10.2307/1999605

zbMATH Keywords

insoluble word problemfinitely presented lattice-ordered groupone relator finitely generated lattice group

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Ordered groups (06F15) Ordered groups (group-theoretic aspects) (20F60)

Related Items (8)

Integrally closed residuated lattices ⋮ Computing on Lattice-Ordered Abelian Groups ⋮ Sublattice subgroups of finitely presented lattice-ordered groups. ⋮ Groups of Automorphisms of Totally Ordered Sets: Techniques, Model Theory and Applications to Decision Problems ⋮ Automorphism groups of totally ordered sets: A retrospective survey ⋮ Finitely generated lattice-ordered groups with soluble word problem ⋮ Varieties of lattice-ordered algebras ⋮ Free products of \(\ell\)-groups

This page was built for publication: The Word Problem for Lattice-Order Groups