Finitely generated lattice-ordered groups with soluble word problem

Simple item page
dc.creatorGlass, A. M. W.
dc.date2007-10-09
dc.date.accessioned2026-07-07T08:34:59Z
dc.date.available2026-07-07T08:34:59Z
dc.descriptionWilliam W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for lattice-ordered groups: Theorem: A finitely generated lattice-ordered group has soluble word problem if and only if it can be embedded in an simple lattice-ordered group that can be embedded in a finitely presented lattice-ordered group. The proof uses permutation groups and the ideas used to prove the lattice-ordered group analogue of Higman's Embedding Theorem.
dc.identifierhttps://arxiv.org/abs/0710.1699
dc.identifierhttp://arxiv.org/abs/0710.1699
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/139626
dc.subjectGroup Theory
dc.subjectLogic
dc.titleFinitely generated lattice-ordered groups with soluble word problem
dc.typetext

Files

Collections

arXiv