Switch to: Citations

Add references

You must login to add references.
  1. 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.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  • Stability in Model Theory.Daniel Lascar & J. E. Wallington - 1990 - Journal of Symbolic Logic 55 (2):881-883.
  • Finitely based theories.Ehud Hrushovski - 1989 - Journal of Symbolic Logic 54 (1):221-225.
    A stable theory is finitely based if every set of indiscernibles is based on a finite subset. This is a common generalization of superstability and 1-basedness. We show that if such theories have more than one model they must have infinitely many, and prove some other conjectures.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   4 citations