SearcharxivSearch

arXiv · 2602.01819

Model theory of term algebras revisited

Abstract

Building on work of Maltsev on locally free algebras in finite purely functional languages, we revisit the model theory of (absolutely free) term algebras and their completions. Maltsev's analysis yields a natural axiomatization together with quantifier elimination to positive Boolean combinations of special formulas, and shows that the complete extensions are parametrized exactly by the number $k\in\{0,1,\dots,\omega\}$ of indecomposable elements; for $1\le k\le\omega$ the standard model is the free term algebra on $k$ generators. We give a new, quantifier-elimination--free proof of completeness using Ehrenfeucht--Fra\"iss\'e games, and we establish several further structural properties of the standard models and theories. In particular, for $1\le k\le\omega$ we prove first-order rigidity and atomicity of the standard model. For every $0\le k\le\omega$ we show that the corresponding theory does not have the finite cover property and weakly eliminates imaginaries. We also provide new proofs of stability-theoretic features previously obtained by Belegradek: the theories are stable but not superstable, normal (hence $1$-based), and have trivial forking; consequently, no infinite group is interpretable in any model. Finally, we analyze model completeness and show that $T_0$ is the model companion of the theory of locally free algebras, while the theories with $k\ge 1$ are not model complete.

Explore related subjects

Keep this discovery

BibTeXRIS

Davide Carolillo, Yifan Jia, Bakh Khoussainov, Rizos Sklinos. 2026-02-02. Model theory of term algebras revisited. https://arxiv.org/abs/2602.01819

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