Finitely generated lattice-ordered groups with soluble word problem

DOI10.1515/JGT.2008.001zbMATH Open1153.06011arXiv0710.1699OpenAlexW2963589163MaRDI QIDQ5444866FDOQ5444866

A. M. W. Glass

Publication date: 26 February 2008

Published in: Journal of Group Theory (Search for Journal in Brave)

Abstract: William 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.

Full work available at URL: https://arxiv.org/abs/0710.1699

zbMATH Keywords

wreath productslattice-ordered groupsoluble word problemfinitely presented lattice-ordered groupfinitely generated lattice-ordered group, free lattice-ordered group

Mathematics Subject Classification ID

Ordered groups (06F15) Subgroup theorems; subgroup growth (20E07) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Ordered groups (group-theoretic aspects) (20F60)

Cites Work

• Free Lattice-Ordered Groups Represented as o-2 Transitive l-Permutation Groups
• Subgroups of finitely presented groups
• The lattice-ordered group of automorphisms of an ordered set
• Amalgamations of Lattice Ordered Groups
• Embedding in a Divisible Lattice-Ordered Group
• An algebraic characterization of groups with soluble word problem
• The Word Problem for Lattice-Order Groups
• Beiträge zur Theorie der Ordnungstypen, insbesondere der \(\eta_{\alpha}\)-Mengen
• Results in partially ordered groups
• Sublattice subgroups of finitely presented lattice-ordered groups.
• Free lattice-ordered groups

Cited In (4)

• Groups of Automorphisms of Totally Ordered Sets: Techniques, Model Theory and Applications to Decision Problems
• Automorphism groups of totally ordered sets: A retrospective survey
• Conjugacy in lattice-ordered groups and right ordered groups
• SUBGROUPS OF FINITELY PRESENTED GROUPS WITH SOLVABLE CONJUGACY PROBLEM

This page was built for publication: Finitely generated lattice-ordered groups with soluble word problem

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