SearcharxivSearch

arXiv · 1105.3774

On Spectrum of kappa-Resplendent Models

Abstract

We prove that some natural "outside" property is equivalent (for a first order class) to being stable. For a model, being resplendent is a strengthening of being kappa-saturated. Restricting ourselves to the case kappa > |T| for transparency, a model M is kappa-resplendent means: when we expand M by <kappa individual constants (c_i:i < alpha), if (M, c_i)_ {i<alpha} has an elementary extension expandable to be a model of T' where Th((M,c_i)_{i<alpha}) subseteq T', |T'| < kappa then already (M,c_i)_{i<\alpha} can be expanded to a model of T'. Trivially any saturated model of cardinality lambda is lambda-resplendent. We ask: how may kappa-resplendent models of a (first order complete) theory T of cardinality lambda are there? Naturally we restrict ourselves to cardinals lambda=lambda^ kappa + 2^ {|T|}. Then we get a complete and satisfying answer: this depends just on T being stable or unstable. In this case proving that for stable T we get few, is not hard; in fact every resplendent model of T is saturated hence determined by its cardinality up to isomorphism. The inverse is more problematic because naturally we have to use Skolem functions with any alpha<kappa places. Normally we use relevant partition theorems (Ramsey theorem or Erd\H{o}s-Rado theorem), but in our case the relevant partitions theorems fails so we have to be careful.

Explore related subjects

Keep this discovery

BibTeXRIS

Saharon Shelah. 2011-05-19. On Spectrum of kappa-Resplendent Models. https://arxiv.org/abs/1105.3774

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