A complicated family of trees with omega + 1 levels

Saharon Shelah

Home/Archive/arXiv

arXiv · 1404.2414

A complicated family of trees with omega + 1 levels

Saharon Shelah

View original source ↗Read source document ↗Export metadata ↓

Abstract

Our aim is to prove that if T is a complete first order theory, which is not superstable (no knowledge on this notion is required), included in a theory T_1 then for any lambda > |T_1| there are 2^lambda models of T_1 such that for any two of them the tau(T)-reducts of one is not elementarily embeddable into the tau(T)-reduct of the other, thus completing the investigation of [Sh:a, Ch. VIII]. Note the difference with the case of unstable T: there lambda > |T_1| + aleph_0 suffices. By [Sh:E59] it suffices for every such lambda to find a complicated enough family of trees with omega + 1 levels of cardinality lambda. If lambda is regular this is done already in [Sh:c, Ch. VIII]. The proof here (in sections 1,2) go by dividing to cases, each with its own combinatorics. In particular we have to use guessing clubs which was discovered for this aim. In S.3 we consider strongly aleph_varepsilon-saturated models of stable T (so if you do not know stability better just ignore this). We also deal with separable reduced Abelian p-groups. We then deal with various improvements of the earlier combinatorial results.

Explore related subjects

math.LO

Keep this discovery

BibTeX RIS

Saharon Shelah. 2014-04-09. A complicated family of trees with omega + 1 levels. https://arxiv.org/abs/1404.2414

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗