SearcharxivSearch

arXiv · 1507.04223

Equivalent definitions of superstability in tame abstract elementary classes

Abstract

In the context of abstract elementary classes (AECs) with a monster model, several possible definitions of superstability have appeared in the literature. Among them are no long splitting chains, uniqueness of limit models, and solvability. Under the assumption that the class is tame and stable, we show that (asymptotically) no long splitting chains implies solvability and uniqueness of limit models implies no long splitting chains. Using known implications, we can then conclude that all the previously-mentioned definitions (and more) are equivalent: $\mathbf{Corollary}$ Let $K$ be a tame AEC with a monster model. Assume that $K$ is stable in a proper class of cardinals. The following are equivalent: 1) For all high-enough $\lambda$, $K$ has no long splitting chains. 2) For all high-enough $\lambda$, there exists a good $\lambda$-frame on a skeleton of $K_\lambda$. 3) For all high-enough $\lambda$, $K$ has a unique limit model of cardinality $\lambda$. 4) For all high-enough $\lambda$, $K$ has a superlimit model of cardinality $\lambda$. 5) For all high-enough $\lambda$, the union of any increasing chain of $\lambda$-saturated models is $\lambda$-saturated. 6) There exists $\mu$ such that for all high-enough $\lambda$, $K$ is $(\lambda, \mu)$-solvable. This gives evidence that there is a clear notion of superstability in the framework of tame AECs with a monster model.

Explore related subjects

Keep this discovery

BibTeXRIS

Rami Grossberg, Sebastien Vasey. 2015-07-15. Equivalent definitions of superstability in tame abstract elementary classes. https://arxiv.org/abs/1507.04223

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