Switch to: References

Add citations

You must login to add citations.
  1. The Dividing Line Methodology: Model Theory Motivating Set Theory.John T. Baldwin - 2021 - Theoria 87 (2):361-393.
    We explore Shelah's model‐theoretic dividing line methodology. In particular, we discuss how problems in model theory motivated new techniques in model theory, for example classifying theories by their potential (consistently with Zermelo–Fraenkel set theory with the axiom of choice (ZFC)) spectrum of cardinals in which there is a universal model. Two other examples are the study (with Malliaris) of the Keisler order leading to a new ZFC result on cardinal invariants and attempts to clarify the “main gap” by reducing the (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • 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  
  • The descriptive set-theoretical complexity of the embeddability relation on models of large size.Luca Motto Ros - 2013 - Annals of Pure and Applied Logic 164 (12):1454-1492.
    We show that if κ is a weakly compact cardinal then the embeddability relation on trees of size κ is invariantly universal. This means that for every analytic quasi-order R on the generalized Cantor space View the MathML source there is an Lκ+κ-sentence φ such that the embeddability relation on its models of size κ, which are all trees, is Borel bi-reducible to R. In particular, this implies that the relation of embeddability on trees of size κ is complete for (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Divide and Conquer: Dividing Lines and Universality.Saharon Shelah - 2021 - Theoria 87 (2):259-348.
    We discuss dividing lines (in model theory) and some test questions, mainly the universality spectrum. So there is much on conjectures, problems and old results, mainly of the author and also on some recent results.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Universal Structures.Saharon Shelah - 2017 - Notre Dame Journal of Formal Logic 58 (2):159-177.
    We deal with the existence of universal members in a given cardinality for several classes. First, we deal with classes of abelian groups, specifically with the existence of universal members in cardinalities which are strong limit singular of countable cofinality or λ=λℵ0. We use versions of being reduced—replacing Q by a subring —and get quite accurate results for the existence of universals in a cardinal, for embeddings and for pure embeddings. Second, we deal with the oak property, a property of (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Toward classifying unstable theories.Saharon Shelah - 1996 - Annals of Pure and Applied Logic 80 (3):229-255.
    Download  
     
    Export citation  
     
    Bookmark   44 citations  
  • On properties of theories which preclude the existence of universal models.Mirna Džamonja & Saharon Shelah - 2006 - Annals of Pure and Applied Logic 139 (1):280-302.
    We introduce the oak property of first order theories, which is a syntactical condition that we show to be sufficient for a theory not to have universal models in cardinality λ when certain cardinal arithmetic assumptions about λ implying the failure of GCH hold. We give two examples of theories that have the oak property and show that none of these examples satisfy SOP4, not even SOP3. This is related to the question of the connection of the property SOP4 to (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The descriptive set-theoretical complexity of the embeddability relation on models of large size.Luca Ros - 2013 - Annals of Pure and Applied Logic 164 (12):1454-1492.
    We show that if κ is a weakly compact cardinal then the embeddability relation on trees of size κ is invariantly universal. This means that for every analytic quasi-order R on the generalized Cantor space View the MathML source there is an Lκ+κ-sentence φ such that the embeddability relation on its models of size κ, which are all trees, is Borel bi-reducible to R. In particular, this implies that the relation of embeddability on trees of size κ is complete for (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Universality for Orders and Graphs Which Omit Large Substructures.Katherine Thompson - 2006 - Notre Dame Journal of Formal Logic 47 (2):233-248.
    This paper will examine universality spectra for relational theories which cannot be described in first-order logic. We will give a method using functors to show that two types of structures have the same universality spectrum. A combination of methods will be used to show universality results for certain ordered structures and graphs. In some cases, a universal spectrum under GCH will be obtained. Since the theories are not first-order, the classic model theory result under GCH does not hold.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • On the existence of universal models.Mirna Džamonja & Saharon Shelah - 2004 - Archive for Mathematical Logic 43 (7):901-936.
    Suppose that λ=λ <λ ≥ℵ0, and we are considering a theory T. We give a criterion on T which is sufficient for the consistent existence of λ++ universal models of T of size λ+ for models of T of size ≤λ+, and is meaningful when 2λ +>λ++. In fact, we work more generally with abstract elementary classes. The criterion for the consistent existence of universals applies to various well known theories, such as triangle-free graphs and simple theories. Having in mind (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Club Guessing and the Universal Models.Mirna Džamonja - 2005 - Notre Dame Journal of Formal Logic 46 (3):283-300.
    We survey the use of club guessing and other PCF constructs in the context of showing that a given partially ordered class of objects does not have a largest, or a universal, element.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Fallen cardinals.Menachem Kojman & Saharon Shelah - 2001 - Annals of Pure and Applied Logic 109 (1-2):117-129.
    We prove that for every singular cardinal μ of cofinality ω, the complete Boolean algebra contains a complete subalgebra which is isomorphic to the collapse algebra CompCol. Consequently, adding a generic filter to the quotient algebra collapses μ0 to 1. Another corollary is that the Baire number of the space U of all uniform ultrafilters over μ is equal to ω2. The corollaries affirm two conjectures of Balcar and Simon. The proof uses pcf theory.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Ramsey Theory for Countable Binary Homogeneous Structures.Jean A. Larson - 2005 - Notre Dame Journal of Formal Logic 46 (3):335-352.
    Countable homogeneous relational structures have been studied by many people. One area of focus is the Ramsey theory of such structures. After a review of background material, a partition theorem of Laflamme, Sauer, and Vuksanovic for countable homogeneous binary relational structures is discussed with a focus on the size of the set of unavoidable colors.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The saturation of club guessing ideals.Tetsuya Ishiu - 2006 - Annals of Pure and Applied Logic 142 (1):398-424.
    We prove that it is consistent that there exists a saturated tail club guessing ideal on ω1 which is not a restriction of the non-stationary ideal. Two proofs are presented. The first one uses a new forcing axiom whose consistency can be proved from a supercompact cardinal. The resulting model can satisfy either CH or 20=2. The second one is a direct proof from a Woodin cardinal, which gives a witnessing model with CH.
    Download  
     
    Export citation  
     
    Bookmark