Switch to: References

Add citations

You must login to add citations.
  1. 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  
  • A note on trivial nonmultidimensional superstable theories.Ambar Chowdhury - 1995 - Archive for Mathematical Logic 34 (1):21-31.
    Download  
     
    Export citation  
     
    Bookmark  
  • A definable continuous rank for nonmultidimensional superstable theories.Ambar Chowdhury, James Loveys & Predrag Tanović - 1996 - Journal of Symbolic Logic 61 (3):967-984.
    Download  
     
    Export citation  
     
    Bookmark  
  • The classification of small types of rank ω, Part I.Steven Buechler & Colleen Hoover - 2001 - Journal of Symbolic Logic 66 (4):1884-1898.
    Abstract.Certain basic concepts of geometrical stability theory are generalized to a class of closure operators containing algebraic closure. A specific case of a generalized closure operator is developed which is relevant to Vaught's conjecture. As an application of the methods, we proveTheorem A.Let G be a superstate group of U-rankωsuch that the generics of G are locally modular andTh(G)has few countable models. Let G−be the group of nongeneric elements of G.G+=Go+G−.LetΠ = {q∈S(∅):U(q)<ω}.For any countable model M ofTh(G)there is a finite (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Forcing isomorphism.J. T. Baldwin, M. C. Laskowski & S. Shelah - 1993 - Journal of Symbolic Logic 58 (4):1291-1301.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Classifiable theories without finitary invariants.E. Bouscaren & E. Hrushovski - 2006 - Annals of Pure and Applied Logic 142 (1-3):296-320.
    It follows directly from Shelah’s structure theory that if T is a classifiable theory, then the isomorphism type of any model of T is determined by the theory of that model in the language L∞,ω1. Leo Harrington asked if one could improve this to the logic L∞, In [S. Shelah, Characterizing an -saturated model of superstable NDOP theories by its L∞,-theory, Israel Journal of Mathematics 140 61–111] Shelah gives a partial positive answer, showing that for T a countable superstable NDOP (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Games and trees in infinitary logic: A survey.Jouko Väänänen - 1995 - In Michał Krynicki, Marcin Mostowski & Lesław W. Szczerba (eds.), Quantifiers: Logics, Models and Computation: Volume Two: Contributions. Dordrecht, Netherland: Kluwer Academic Publishers. pp. 105--138.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Some remarks on nonmultidimensional superstable theories.Anand Pillay - 1994 - Journal of Symbolic Logic 59 (1):151-165.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Unique decomposition in classifiable theories.Bradd Hart, Ehud Hrushovski & Michael C. Laskowski - 2002 - Journal of Symbolic Logic 67 (1):61-68.
    Download  
     
    Export citation  
     
    Bookmark