SearcharxivSearch

arXiv · 2511.18665

Long limit models are isomorphic assuming a splitting-like relation

Abstract

We prove the uniqueness of high cofinality limit models in stable abstract elementary classes (AECs) with amalgamation, assuming the existence of a rather weak independence relation. $\textbf{Theorem.}$ Suppose $\mathbf{K}$ is a $\lambda$-stable AEC, where $\operatorname{LS}(\mathbf{K}) \leq \lambda$, $\kappa < \lambda^+$ is regular, and $\mathbf{K}_\lambda$ satisfies the amalgamation property. Let $\mathbf{K}'$ is the class of all $(\lambda, \delta)$-limit models where $\operatorname{cf}(\delta) \geq \kappa$ (or any AC where $\mathbf{K}' \subseteq \mathbf{K}_\lambda$ contains all such $(\lambda, \delta)$-limit models when $\operatorname{cf}(\delta) \geq \kappa$). Suppose also that there is an independence relation on $\mathbf{K}'$ satisfying weak uniqueness, weak existence, universal continuity* in $\mathbf{K}_\lambda$, $(\geq \kappa)$-local character, and $(\lambda, \theta)$-weak non-forking amalgamation in some regular $\theta \in [\kappa, \lambda^+)$. Let $\delta_1, \delta_2 < \lambda^+$ be limit with $\operatorname{cf}(\delta_l) \geq \kappa$ for $l = 1, 2$. Then for all $M, N_1, N_2 \in \mathbf{K}_\lambda$, if $N_l$ is $(\lambda, \delta_l)$-limit over $M$ for $l = 1, 2$, then $N_1 \underset{M}{\cong} N_2$. Moreover, if $K_\lambda$ also satisfies the joint embedding property, then for all $N_1, N_2 \in \mathbf{K}_\lambda$, if $N_l$ is $(\lambda, \delta_l)$-limit for $l = 1, 2$, then $N_1 {\cong} N_2$. This generalises both Theorem 3.1 of arXiv:2503.11605 and Theorem 1.2 of arXiv:1508.04717 - the former to apply to independence relations that satisfy much weaker forms of uniqueness, extension, and non-forking amalagamation, and the latter to independence relations other than $\lambda$-non-splitting. As such, this generalises all other positive isomorphism results of limit models known to the author.

Explore related subjects

Keep this discovery

BibTeXRIS

Jeremy Beard. 2025-11-24. Long limit models are isomorphic assuming a splitting-like relation. https://arxiv.org/abs/2511.18665

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