SearcharxivSearch

arXiv · 1804.10952

Density of uniqueness triples from the diamond axiom

Abstract

We work with a pre-$\lambda$-frame, which is an abstract elementary class (AEC) endowed with a collection of basic types and a non-forking relation satisfying certain natural properties with respect to models of cardinality $\lambda$. We investigate the density of uniqueness triples in a given pre-$\lambda$-frame $\mathfrak s$, that is, under what circumstances every basic triple admits a non-forking extension that is a uniqueness triple. Prior results in this direction required strong hypotheses on $\mathfrak s$. Our main result is an improvement, in that we assume far fewer hypotheses on $\mathfrak s$. In particular, we do not require $\mathfrak s$ to satisfy the extension, uniqueness, stability, or symmetry properties, or any form of local character, though we do impose the amalgamation and stability properties in $\lambda^+$, and we do assume $\diamondsuit(\lambda^+)$. As a corollary, by applying our main result to the trivial $\lambda$-frame, it follows that in any AEC $\mathbf K$ satisfying modest hypotheses on $\mathbf K_\lambda$ and $\mathbf K_{\lambda^+}$, the set of $*$-domination triples in $\mathbf K_\lambda$ is dense among the non-algebraic triples. We also apply our main result to the non-splitting relation, obtaining the density of uniqueness triples from very few hypotheses.

Explore related subjects

Keep this discovery

BibTeXRIS

Ari Meir Brodsky, Adi Jarden. 2018-04-29. Density of uniqueness triples from the diamond axiom. https://arxiv.org/abs/1804.10952

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