SearcharxivSearch

arXiv · 2112.01572

Stability results assuming tameness, monster model and continuity of nonsplitting

Abstract

Assuming the existence of a monster model, tameness and continuity of nonsplitting in an abstract elementary class (AEC), we extend known superstability results: let $\mu>LS({\bf K})$ be a regular stability cardinal and let $\chi$ be the local character of $\mu$-nonsplitting. The following holds: 1. When $\mu$-nonforking is restricted to $(\mu,\geq\chi)$-limit models ordered by universal extensions, it enjoys invariance, monotonicity, uniqueness, existence, extension and continuity. It also has local character $\chi$. This generalizes Vasey's result which assumed $\mu$-superstability to obtain same properties but with local character $\aleph_0$. 2. There is $\lambda\in[\mu,h(\mu))$ such that if ${\bf K}$ is stable in every cardinal between $\mu$ and $\lambda$, then ${\bf K}$ has $\mu$-symmetry while $\mu$-nonforking in (1) has symmetry. In this case (a) ${\bf K}$ has the uniqueness of $(\mu,\geq\chi)$-limit models: if $M_1,M_2$ are both $(\mu,\geq\chi)$-limit over some $M_0\in K_\mu$, then $M_1\cong_{M_0}M_2$; (b) any increasing chain of $\mu^+$-saturated models of length $\geq\chi$ has a $\mu^+$-saturated union. These generalize VanDieren-Vasey's result and remove the symmetry assumption in Boney-VanDieren and Vasey's result. Under $(<\mu)$-tameness, the conclusions of (1), (2)(a)(b) are equivalent to ${\bf K}$ having the $\chi$-local character of $\mu$-nonsplitting. Grossberg and Vasey gave eventual superstability criteria for tame AECs with a monster model. We remove the high cardinal threshold and reduce the cardinal jump between equivalent superstability criteria. We also add two new superstability criteria to the list: a weaker version of solvability and the boundedness of the $U$-rank.

Explore related subjects

Keep this discovery

BibTeXRIS

Samson Leung. 2021-12-02. Stability results assuming tameness, monster model and continuity of nonsplitting. https://arxiv.org/abs/2112.01572

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