Search arXivSearch

arXiv · 1503.01366

Building independence relations in abstract elementary classes

Abstract

We study general methods to build forking-like notions in the framework of tame abstract elementary classes (AECs) with amalgamation. We show that whenever such classes are categorical in a high-enough cardinal, they admit a good frame: a forking-like notion for types of singleton elements. $\mathbf{Theorem}$ (Superstability from categoricity) Let $K$ be a $(<\kappa)$-tame AEC with amalgamation. If $\kappa = \beth_\kappa > \text{LS} (K)$ and $K$ is categorical in a $\lambda > \kappa$, then: * $K$ is stable in all cardinals $\ge \kappa$. * $K$ is categorical in $\kappa$. * There is a type-full good $\lambda$-frame with underlying class $K_\lambda$. Under more locality conditions, we prove that the frame extends to a global independence notion (for types of arbitrary length). $\mathbf{Theorem}$ (A global independence notion from categoricity) Let $K$ be a densely type-local, fully tame and type short AEC with amalgamation. If $K$ is categorical in unboundedly many cardinals, then there exists $\lambda \ge \text{LS} (K)$ such that $K_{\ge \lambda}$ admits a global independence relation with the properties of forking in a superstable first-order theory. As an application, we deduce (modulo an unproven claim of Shelah) that Shelah's eventual categoricity conjecture for AECs (without assuming categoricity in a successor cardinal) follows from the weak generalized continuum hypothesis and a large cardinal axiom. $\textbf{Corollary}$ Assume $2^{\lambda} < 2^{\lambda^+}$ for all cardinals $\lambda$, as well as an unpublished claim of Shelah. If there exists a proper class of strongly compact cardinals, then any AEC categorical in some high-enough cardinal is categorical in all high-enough cardinals.

Explore related subjects

Keep this discovery

BibTeXRIS

Sebastien Vasey. 2015-03-04. Building independence relations in abstract elementary classes. https://doi.org/10.1016/j.apal.2016.04.005

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