Displaying similar documents to “On the number of countable models of stable theories”

Decompositions of saturated models of stable theories

M. C. Laskowski, S. Shelah (2006)

Fundamenta Mathematicae

Similarity:

We characterize the stable theories T for which the saturated models of T admit decompositions. In particular, we show that countable, shallow, stable theories with NDOP have this property.

Definability of small puncture sets

Andrés Eduardo Caicedo, John Daniel Clemens, Clinton Taylor Conley, Benjamin David Miller (2011)

Fundamenta Mathematicae

Similarity:

We characterize the class of definable families of countable sets for which there is a single countable definable set intersecting every element of the family.

The enriched stable core and the relative rigidity of HOD

Sy-David Friedman (2016)

Fundamenta Mathematicae

Similarity:

In the author's 2012 paper, the V-definable Stable Core 𝕊 = (L[S],S) was introduced. It was shown that V is generic over 𝕊 (for 𝕊-definable dense classes), each V-definable club contains an 𝕊-definable club, and the same holds with 𝕊 replaced by (HOD,S), where HOD denotes Gödel's inner model of hereditarily ordinal-definable sets. In the present article we extend this to models of class theory by introducing the V-definable Enriched Stable Core 𝕊* = (L[S*],S*). As an application...

First countable spaces without point-countable π-bases

István Juhász, Lajos Soukup, Zoltán Szentmiklóssy (2007)

Fundamenta Mathematicae

Similarity:

We answer several questions of V. Tkachuk [Fund. Math. 186 (2005)] by showing that ∙ there is a ZFC example of a first countable, 0-dimensional Hausdorff space with no point-countable π-base (in fact, the minimum order of a π-base of the space can be made arbitrarily large); ∙ if there is a κ-Suslin line then there is a first countable GO-space of cardinality κ⁺ in which the order of any π-base is at least κ; ∙ it is consistent to have a...

Around stable forking

Byunghan Kim, A. Pillay (2001)

Fundamenta Mathematicae

Similarity:

We discuss various conjectures and problems around the issue of when and whether stable formulas are responsible for forking in simple theories. We prove that if the simple theory T has strong stable forking then any complete type is a nonforking extension of a complete type which is axiomatized by instances of stable formulas. We also give another treatment of the first author's result which identifies canonical bases in supersimple theories.