SearcharxivSearch

arXiv · 2509.05044

Subvarieties of pointed Abelian l-groups

Abstract

This paper provides a complete classification of all subvarieties of pointed Abelian lattice-ordered groups (l-groups), as well as all subquasivarieties that are generated by their totally ordered members. We present two complementary approaches to achieve this classification. First, using purely l-group-theoretic methods, we analyze the structure of lexicographic products and values to identify all join-irreducible members of the lattice of subvarieties of positively pointed Abelian l-groups. We provide a novel equational basis for each of these subvarieties, leading to a complete description of the entire subvariety lattice. As a direct application, our l-group-theoretic classification yields an alternative, self-contained proof of Komori's classification of subvarieties of MV-algebras. Second, we explore the connection to MV-algebras via an extended version of Mundici's functor. We prove that this functor preserves universal classes, a result of independent model-theoretic interest. This allows us to lift the classification of universal classes of totally ordered MV-algebras, due to Gispert, to a complete classification of universal classes of totally ordered pointed Abelian l-groups. As a direct consequence, we obtain a complete structural description of the lattice of subquasivarieties that are generated by their totally ordered members.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Filip Jankovec. 2025-09-05. Subvarieties of pointed Abelian l-groups. https://arxiv.org/abs/2509.05044

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO