SearcharxivSearch

arXiv · 1507.02118

Uniqueness of Limit Models in Classes with Amalgamation

Abstract

We prove: Main Theorem: Let $\mathcal{K}$ be an abstract elementary class satisfying the joint embedding and the amalgamation properties with no maximal models of cardinality $\mu$. Let $\mu$ be a cardinal above the the L\"owenheim-Skolem number of the class. If $\mathcal{K}$ is $\mu$-Galois-stable, has no $\mu$-Vaughtian Pairs, does not have long splitting chains, and satisfies locality of splitting, then any two $(\mu,\sigma_\ell)$-limits over $M$, for $\ell\in\{1,2\}$, are isomorphic over $M$. This theorem extends results of Shelah from \cite{Sh394}, \cite{Sh576}, \cite{Sh600}, Kolman and Shelah in \cite{KoSh} and Shelah and Villaveces from \cite{ShVi}. A preliminary version of our uniqueness theorem, which was circulated in 2006, was used by Grossberg and VanDieren to prove a case of Shelah's categoricity conjecture for tame abstract elementary classes in \cite{GrVa2}. Preprints of this paper have also influenced the Ph.D. theses of Drueck \cite{Dr} and Zambrano \cite{Za}. This paper also serves the expository role of presenting together the arguments in \cite{Va1} and \cite{Va2} in a more natural context in which the amalgamation property holds and this work provides an approach to the uniqueness of limit models that does not rely on Ehrenfeucht-Mostowski constructions.

Explore related subjects

Keep this discovery

BibTeXRIS

Rami Grossberg, Monica VanDieren, Andres Villaveces. 2015-07-08. Uniqueness of Limit Models in Classes with Amalgamation. https://arxiv.org/abs/1507.02118

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