Switch to: Citations

Add references

You must login to add references.
  1. On ◁∗-maximality.Mirna Džamonja & Saharon Shelah - 2004 - Annals of Pure and Applied Logic 125 (1-3):119-158.
    This paper investigates a connection between the semantic notion provided by the ordering * among theories in model theory and the syntactic SOPn hierarchy of Shelah. It introduces two properties which are natural extensions of this hierarchy, called SOP2 and SOP1. It is shown here that SOP3 implies SOP2 implies SOP1. In Shelah's article 229) it was shown that SOP3 implies *-maximality and we prove here that *-maximality in a model of GCH implies a property called SOP2″. It has been (...)
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • (1 other version)Lascar strong types in some simple theories.Steven Buechler - 1999 - Journal of Symbolic Logic 64 (2):817-824.
    In this paper a class of simple theories, called the low theories is developed, and the following is proved. Theorem. Let T be a low theory. A set and a, b elements realizing the same strong type over A. Then, a and b realized the same Lascar strong type over A.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Classification Theory and the Number of Nonisomorphic Models.S. Shelah - 1982 - Journal of Symbolic Logic 47 (3):694-696.
    Download  
     
    Export citation  
     
    Bookmark   204 citations  
  • Realization of φ -types and Keisler’s order.M. E. Malliaris - 2009 - Annals of Pure and Applied Logic 157 (2-3):220-224.
    We show that the analysis of Keisler’s order can be localized to the study of φ-types. Specifically, if is a regular ultrafilter on λ such that and M is a model whose theory is countable, then is λ+-saturated iff it realizes all φ-types of size λ.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • (1 other version)Ultraproducts which are not saturated.H. Jerome Keisler - 1967 - Journal of Symbolic Logic 32 (1):23-46.
    In this paper we continue our study, begun in [5], of the connection between ultraproducts and saturated structures. IfDis an ultrafilter over a setI, andis a structure, the ultrapower ofmoduloDis denoted byD-prod. The ultrapower is important because it is a method of constructing structures which are elementarily equivalent to a given structure. Our ultimate aim is to find out what kinds of structure are ultrapowers of. We made a beginning in [5] by proving that, assuming the generalized continuum hypothesis, for (...)
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • On generically stable types in dependent theories.Alexander Usvyatsov - 2009 - Journal of Symbolic Logic 74 (1):216-250.
    We develop the theory of generically stable types, independence relation based on nonforking and stable weight in the context of dependent theories.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • From stability to simplicity.Byunghan Kim & Anand Pillay - 1998 - Bulletin of Symbolic Logic 4 (1):17-36.
    §1. Introduction. In this report we wish to describe recent work on a class of first order theories first introduced by Shelah in [32], the simple theories. Major progress was made in the first author's doctoral thesis [17]. We will give a survey of this, as well as further works by the authors and others.The class of simple theories includes stable theories, but also many more, such as the theory of the random graph. Moreover, many of the theories of particular (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • (1 other version)Ultraproducts Which are Not Saturated.H. Jerome Keisler - 1970 - Journal of Symbolic Logic 35 (4):585-585.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • (1 other version)More on SOP1 and SOP2.Saharon Shelah & Alexander Usvyatsov - 2008 - Annals of Pure and Applied Logic 155 (1):16-31.
    This paper continues the work in [S. Shelah, Towards classifying unstable theories, Annals of Pure and Applied Logic 80 229–255] and [M. Džamonja, S. Shelah, On left triangle, open*-maximality, Annals of Pure and Applied Logic 125 119–158]. We present a rank function for NSOP1 theories and give an example of a theory which is NSOP1 but not simple. We also investigate the connection between maximality in the ordering left triangle, open* among complete first order theories and the SOP2 property. We (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • (1 other version)More on SOP 1 and SOP 2.Saharon Shelah & Alexander Usvyatsov - 2008 - Annals of Pure and Applied Logic 155 (1):16-31.
    This paper continues the work in [S. Shelah, Towards classifying unstable theories, Annals of Pure and Applied Logic 80 229–255] and [M. Džamonja, S. Shelah, On left triangle, open*-maximality, Annals of Pure and Applied Logic 125 119–158]. We present a rank function for NSOP1 theories and give an example of a theory which is NSOP1 but not simple. We also investigate the connection between maximality in the ordering left triangle, open* among complete first order theories and the SOP2 property. We (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Toward classifying unstable theories.Saharon Shelah - 1996 - Annals of Pure and Applied Logic 80 (3):229-255.
    Download  
     
    Export citation  
     
    Bookmark   43 citations  
  • (1 other version)Lascar Strong Types in Some Simple Theories.Steven Buechler - 1999 - Journal of Symbolic Logic 64 (2):817-824.
    In this paper a class of simple theories, called the low theories is developed, and the following is proved. Theorem. Let T be a low theory. A set and a, b elements realizing the same strong type over A. Then, a and b realized the same Lascar strong type over A.
    Download  
     
    Export citation  
     
    Bookmark   3 citations