SearcharxivSearch

arXiv · 1412.3313

Infinitary stability theory

Abstract

We introduce a new device in the study of abstract elementary classes (AECs): Galois Morleyization, which consists in expanding the models of the class with a relation for every Galois type of length less than a fixed cardinal $κ$. We show: $\mathbf{Theorem}$ (The semantic-syntactic correspondence) An AEC $K$ is fully $(<κ)$-tame and type short if and only if Galois types are syntactic in the Galois Morleyization. This exhibits a correspondence between AECs and the syntactic framework of stability theory inside a model. We use the correspondence to make progress on the stability theory of tame and type short AECs. The main theorems are: $\mathbf{Theorem}$ Let $K$ be a $\text{LS}(K)$-tame AEC with amalgamation. The following are equivalent: * $K$ is Galois stable in some $λ\ge \text{LS}(K)$. * $K$ does not have the order property (defined in terms of Galois types). * There exist cardinals $μ$ and $λ_0$ with $μ\le λ_0 < \beth_{(2^{\text{LS}(K)})^+}$ such that $K$ is Galois stable in any $λ\ge λ_0$ with $λ= λ^{<μ}$. $\mathbf{Theorem}$ Let $K$ be a fully $(<κ)$-tame and type short AEC with amalgamation, $κ= \beth_κ > \text{LS} (K)$. If $K$ is Galois stable, then the class of $κ$-Galois saturated models of $K$ admits an independence notion ($(<κ)$-coheir) which, except perhaps for extension, has the properties of forking in a first-order stable theory.

Explore related subjects

Keep this discovery

BibTeXRIS

Sebastien Vasey. 2016-02-24. Infinitary stability theory. https://doi.org/10.1007/s00153-016-0481-z

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