Decidability of distributive l-pregroups
Logic
2023-10-23 v1
Abstract
We show that every distributive lattice-ordered pregroup can be embedded into a functional algebra over an integral chain, thus improving the existing Cayley/Holland-style embedding theorem. We use this to show that the variety of all distributive lattice-ordered pregroups is generated by the single functional algebra on the integers. Finally, we show that the equational theory of the variety is decidable.
Keywords
Cite
@article{arxiv.2310.13175,
title = {Decidability of distributive l-pregroups},
author = {Nikolaos Galatos and Isis A. Gallardo},
journal= {arXiv preprint arXiv:2310.13175},
year = {2023}
}
Comments
30 pages, 4 figures