SearcharxivSearch

arXiv · 2510.03459

The spectrum of limit models in a first order setting

Abstract

Originally introduced by Kolmann and Shelah as a surrogate for saturated models, limit models have been established as natural and useful objects when studying abstract elementary classes. Shelah began the study of when (multiple notions of) limit models exist for first order theories. In this paper we look at their structure. In superstable theories it is known that all limit models are isomorphic, but in the strictly stable case the number of non-isomorphic limit models was not well understood. Here we characterise the full spectrum of limit models in the first order stable setting, by a short and simple argument using only the familiar machinery of stable first order theories: $\textbf{Theorem.}$ Let $T$ be a complete $\lambda$-stable theory where $\lambda \geq |\operatorname{L}(T)| + \aleph_0$. Let $\delta_1, \delta_2 < \lambda^+$ be limit ordinals where $\operatorname{cf}(\delta_1)< \operatorname{cf}(\delta_2)$. Let $N_l$ be a $(\lambda, \delta_l)$-limit model for $l = 1, 2$. Then $N_1$ and $N_2$ are isomorphic if and only if $\operatorname{cf}(\delta_1) \geq \kappa_r(T)$. Moreover, if $\kappa_r(T) = \aleph_\alpha$, there are exactly $|\alpha| + 1$ limit models up to isomorphism. In the context of first order stable theories, this reduces the proof of the main result of arXiv:2503.11605 from 19 pages to 2. We hope this will make limit models a more comprehensible and accessible tool in first order model theory.

Explore related subjects

Keep this discovery

BibTeXRIS

Jeremy Beard. 2025-10-03. The spectrum of limit models in a first order setting. https://arxiv.org/abs/2510.03459

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