Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)Countable models of trivial theories which admit finite coding.James Loveys & Predrag Tanović - 1996 - Journal of Symbolic Logic 61 (4):1279-1286.
    We prove: Theorem. A complete first order theory in a countable language which is strictly stable, trivial and which admits finite coding has 2 ℵ 0 nonisomorphic countable models. Combined with the corresponding result or superstable theories from [4] our result confirms the Vaught conjecture for trivial theories which admit finite coding.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A new strongly minimal set.Ehud Hrushovski - 1993 - Annals of Pure and Applied Logic 62 (2):147-166.
    We construct a new class of 1 categorical structures, disproving Zilber's conjecture, and study some of their properties.
    Download  
     
    Export citation  
     
    Bookmark   89 citations  
  • Almost orthogonal regular types.Ehud Hrushovski - 1989 - Annals of Pure and Applied Logic 45 (2):139-155.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • On the number of models of uncountable theories.Ambar Chowdhury & Anand Pillay - 1994 - Journal of Symbolic Logic 59 (4):1285-1300.
    In this paper we establish the following theorems. THEOREM A. Let T be a complete first-order theory which is uncountable. Then: (i) I(|T|, T) ≥ ℵ 0 . (ii) If T is not unidimensional, then for any λ ≥ |T|, I (λ, T) ≥ ℵ 0 . THEOREM B. Let T be superstable, not totally transcendental and nonmultidimensional. Let θ(x) be a formula of least R ∞ rank which does not have Morley rank, and let p be any stationary completion (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On the number of nonisomorphic models of size |t|.Ambar Chowdhury - 1994 - Journal of Symbolic Logic 59 (1):41 - 59.
    Let T be an uncountable, superstable theory. In this paper we prove Theorem A. If T has finite rank, then I(|T|, T) ≥ ℵ0. Theorem B. If T is trivial, then I(|T|, T) ≥ ℵ0.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)ℵ0-Categorical, ℵ0-stable structures.G. Cherlin, L. Harrington & A. H. Lachlan - 1985 - Annals of Pure and Applied Logic 28 (2):103-135.
    Download  
     
    Export citation  
     
    Bookmark   59 citations  
  • Meager forking.Ludomir Newelski - 1994 - Annals of Pure and Applied Logic 70 (2):141-175.
    T is stable. We define the notion of meager regular type and prove that a meager regular type is locally modular. Assuming I < 2o and G is a definable abelian group with locally modular regular generics, we prove a counterpart of Saffe's conjecture. Using these results, for superstable T we prove the conjecture of vanishing multiplicities. Also, as a further application, in some additional cases we prove a conjecture regarding topological stability of pseudo-types over Q.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • A model and its subset.Ludomir Newelski - 1992 - Journal of Symbolic Logic 57 (2):644-658.
    We try to count the number of countable models M of T with a fixed set Q = φ (M) of realizations of a type φ. Also, for stable T, we define an ordinal rank M measuring multiplicity of types, with additivity properties similar to those of U-rank.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On atomic or saturated sets.Ludomir Newelski - 1996 - Journal of Symbolic Logic 61 (1):318-333.
    Assume T is stable, small and Φ(x) is a formula of L(T). We study the impact on $T\lceil\Phi$ of naming finitely many elements of a model of T. We consider the cases of $T\lceil\Phi$ which is ω-stable or superstable of finite rank. In these cases we prove that if T has $ countable models and Q = Φ(M) is countable and atomic or saturated, then any good type in S(Q) is τ-stable. If $T\lceil\Phi$ is ω-stable and (bounded, 1-based or of (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation