Switch to: References

Add citations

You must login to add citations.
  1. A model and its subset: the uncountable case.Ludomir Newelski - 1995 - Annals of Pure and Applied Logic 71 (2):107-129.
    Assume Q is a definable subset of a model of T. We define a notion of Q-isolated type, generalizing an earlier definition for countable Q. This notion is absolute. For superstable T, we give some sufficient conditions for the existence of Q-atomic models. We apply this to prove some results on weak categoricity over a predicate.
    Download  
     
    Export citation  
     
    Bookmark  
  • Stable theories, pseudoplanes and the number of countable models.Anand Pillay - 1989 - Annals of Pure and Applied Logic 43 (2):147-160.
    We prove that if T is a stable theory with only a finite number of countable models, then T contains a type-definable pseudoplane. We also show that for any stable theory T either T contains a type-definable pseudoplane or T is weakly normal.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • A Generalization of Forking.Siu-Ah Ng - 1991 - Journal of Symbolic Logic 56 (3):813.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Scott analysis of pseudotypes.Ludomir Newelski - 1993 - Journal of Symbolic Logic 58 (2):648-663.
    This is a continuation of [N2]. We find a Borel definition of Q-isolation. We pursue a topological and Scott analysis of pseudotypes on S(Q).
    Download  
     
    Export citation  
     
    Bookmark   3 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  
  • Measures and forking.H. Jerome Keisler - 1987 - Annals of Pure and Applied Logic 34 (2):119-169.
    Shelah's theory of forking is generalized in a way which deals with measures instead of complete types. This allows us to extend the method of forking from the class of stable theories to the larger class of theories which do not have the independence property. When restricted to the special case of stable theories, this paper reduces to a reformulation of the classical approach. However, it goes beyond the classical approach in the case of unstable theories. Methods from ordinary forking (...)
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Stable types in rosy theories.Assaf Hasson & Alf Onshuus - 2010 - Journal of Symbolic Logic 75 (4):1211-1230.
    We study the behaviour of stable types in rosy theories. The main technical result is that a non-þ-forking extension of an unstable type is unstable. We apply this to show that a rosy group with a þ-generic stable type is stable. In the context of super-rosy theories of finite rank we conclude that non-trivial stable types of U þ -rank 1 must arise from definable stable sets.
    Download  
     
    Export citation  
     
    Bookmark   2 citations