Switch to: References

Add citations

You must login to add citations.
  1. Morasses, square and forcing axioms.Charles Morgan - 1996 - Annals of Pure and Applied Logic 80 (2):139-163.
    The paper discusses various relationships between the concepts mentioned in the title. In Section 1 Todorcevic functions are shown to arise from both morasses and square. In Section 2 the theme is of supplements to morasses which have some of the flavour of square. Distinctions are drawn between differing concepts. In Section 3 forcing axioms related to the ideas in Section 2 are discussed.
    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  
  • 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 graphs and functions on ω1.Saharon Shelah & Juris Steprāns - 2021 - Annals of Pure and Applied Logic 172 (8):102986.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Small universal families for graphs omitting cliques without GCH.Katherine Thompson - 2010 - Archive for Mathematical Logic 49 (7-8):799-811.
    When no single universal model for a set of structures exists at a given cardinal, then one may ask in which models of set theory does there exist a small family which embeds the rest. We show that for λ+-graphs (λ regular) omitting cliques of some finite or uncountable cardinality, it is consistent that there are small universal families and 2λ > λ+. In particular, we get such a result for triangle-free graphs.
    Download  
     
    Export citation  
     
    Bookmark  
  • 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  
  • 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