arXiv math/99081581999-08-29math.LO

Rigid aleph_epsilon-saturated models of superstable theories

Ziv Shami, Saharon Shelah

发表信息：: Fund. Math. 162 No. 1 (1999) 37--46

英文摘要：

In a countable superstable NDOP theory, the existence of a rigid aleph_epsilon-saturated model implies the existence of 2^lambda rigid aleph_epsilon-saturated models of power lambda for every lambda>2^{aleph_0}.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

P-NDOP and P-decompositions of aleph_epsilon-saturated models of superstable theories

Assume a complete superstable theory is superstable, and let P be a class of regular types, typically closed under automorphisms of the monster and non-orthogonality. We define the notion of P-NDOP and prove the existence of P-decompositions and derive an analog of Sh401 for superstable theories with P-NDOP. In this context, we also find a sufficient condition on P-decompositions that imply non-isomorphic models. For this, we investigate natural structures on the types in P\intersect S(M) modulo non-orthogonality.

2014-06-04math.LO

Characterizing aleph_epsilon-saturated models of superstable ndop theories by L_{infty, aleph_epsilon}-theory

After the main gap theorem was proved (see [Sh:c]), in discussion, Harrington expressed a desire for a finer structure - of finitary character (when we have a structure theorem at all). I point out that the logic L_{infty,aleph_0}(d.q.) (d.q. stands for dimension quantifier) does not suffice: e.g., for T=Th(lambda x 2^ω,E_n)_{n<omega} where (alpha,eta)E_n(beta,nu) =: eta|n=nu|n and for a subset S of 2^omega we define M_S = M | {(alpha,eta): [eta in S -> alpha<omega_1] and [eta in 2^ωbackslash S -> alpha<omega]}. Hence, it seems to me we should try L_{infty,aleph_epsilon}(d.q.) (essentially, in…

1996-09-15math.LO

Superstable theories and representation

In this paper we give characterizations of the super-stable theories, in terms of an external property called representation. In the sense of the representation property, the mentioned class of first-order theories can be regarded as "not very complicated". This was done for "stable" and for "aleph_0-stable". Here we give a complete answer for "superstable".

2019-04-17math.LO

Historic iteration with aleph_epsilon-support

One aim of this work is to get a universe in which weak versions of Martin axioms holds for some forcing notions of cardinality aleph_0, aleph_1 and aleph_2 while on aleph_2 club, the ``small'' brother of diamond, holds. As a consequence we get the consistency of ``there is no Gross space''. Another aim is to present a case of ``Historic iteration''.

1996-07-15math.LO

Simple groups and the number of countable models

Let $T$ be a complete, superstable theory with fewer than $2^{\aleph_{0}}$ countable models. Assuming that generic types of infinite, simple groups definable in $T^{eq}$ are sufficiently non-isolated we prove that $ω^ω$ is the strict upper bound for the Lascar rank of $T$.

2013-04-26math.LO

Infinite Stable Graphs With Large Chromatic Number

We prove that if $G=(V,E)$ is an $ω$-stable (respectively, superstable) graph with $χ(G)>\aleph_0$ (respectively, $2^{\aleph_0}$) then $G$ contains all the finite subgraphs of the shift graph $\text{Sh}_n(ω)$ for some $n$. We prove a variant of this theorem for graphs interpretable in stationary stable theories. Furthermore, if $G$ is $ω$-stable with $\mathrm{U}(G)\leq 2$ we prove that $n\leq 2$ suffices.

2021-03-20math.COmath.LO

更多相关论文收起更多论文

Borel sets without perfectly many overlapping translations, II

For a countable ordinal epsilon we construct a Sigma^0_2 subset of the Cantor space for which one may force aleph_epsilon translations with intersections of size 2i, but such that it has no perfect set of such translations in any ccc extension. These sets have uncountably many translations with intersections of size 2i in ZFC, so this answers Problem 3.4 of arxiv:1711.04058 .

2022-04-20math.LO

Transferring saturation, the finite cover property, and stability

Saturation is (mu,kappa)-transferable in T if and only if there is an expansion T_1 of T with |T_1| = |T| such that if M is a mu-saturated model of T_1 and |M| \geq kappa then the reduct M|L(T) is kappa-saturated. We characterize theories which are superstable without the finite cover property (f.c.p.), or without f.c.p. as, respectively those where saturation is (aleph_0,lambda)-transferable or (kappa(T),lambda)-transferable for all lambda. Further if for some mu \geq |T|, 2^mu > mu^+, stability is equivalent to: or all mu \geq |T|, saturation is (μ,2^mu)-transferable.

1998-07-09math.LO

Dependent dreams: recounting types

We investigate the class of models of a general dependent theory. We continue math.LO/0702292 in particular investigating so called "decomposition of types"; thesis is that what holds for stable theory and for Th(Q,<) hold for dependent theories. Another way to say this is: we have to look at small enough neighborhood and use reasonably definable types to analyze a type. We note the results understable without reading. First, a parallel to the "stability spectrum", the "recounting of types", that is assume lambda = lambda^{< lambda} is large enough, M a saturated model of T of cardinality lamb…

2012-02-26math.LO