Switch to: Citations

Add references

You must login to add references.
  1. (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  
  • (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  
  • 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  
  • 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  
  • The characteristic sequence of a first-order formula.M. E. Malliaris - 2010 - Journal of Symbolic Logic 75 (4):1415-1440.
    For a first-order formula φ(x; y) we introduce and study the characteristic sequence ⟨P n : n < ω⟩ of hypergraphs defined by P n (y₁…., y n ):= $(\exists x)\bigwedge _{i\leq n}\varphi (x;y_{i})$ . We show that combinatorial and classification theoretic properties of the characteristic sequence reflect classification theoretic properties of φ and vice versa. The main results are a characterization of NIP and of simplicity in terms of persistence of configurations in the characteristic sequence. Specifically, we show that (...)
    Download  
     
    Export citation  
     
    Bookmark   4 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