Generation and decidability for periodic l-pregroups
Abstract
In [11] it is shown that the variety of distributive l-pregroups is generated by a single algebra, the functional algebra over the integers. Here, we show that is equal to the join of its subvarieties , for , consisting of n-periodic l-pregroups. We also prove that every algebra in embeds into the subalgebra of n-periodic elements of , for some integral chain ; we use this representation to show that for every n, the variety is generated by the single algebra , noting that the chain is independent of n. We further establish a second representation theorem: every algebra in embeds into the wreath product of an l-group and , showcasing the prominent role of the simple n-periodic l-pregroup . Moreover, we prove that the join of the varieties is also equal to , hence equal to the join of the varieties , even though is not equal to \mathsf{LPn} for every single n. In this sense, has two different well-behaved approximations. We further prove that, for every n, the equational theory of is decidable and, using the wreath product decomposition, we show that the equational theory of is decidable, as well.
Cite
@article{arxiv.2403.05099,
title = {Generation and decidability for periodic l-pregroups},
author = {Nikolaos Galatos and Isis A. Gallardo},
journal= {arXiv preprint arXiv:2403.05099},
year = {2024}
}