Finitely generated lattice-ordered groups with soluble word problem

DOI10.1515/JGT.2008.001zbMath1153.06011arXiv0710.1699OpenAlexW2963589163MaRDI QIDQ5444866

A. M. W. Glass

Publication date: 26 February 2008

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

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

Subgroup theorems; subgroup growth (20E07) 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

Conjugacy in lattice-ordered groups and right 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

Cites Work

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