Switch to: References

Add citations

You must login to add citations.
  1. Small universal families of graphs on ℵω+ 1.James Cummings, Mirna Džamonja & Charles Morgan - 2016 - Journal of Symbolic Logic 81 (2):541-569.
    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  
  • Nonexistence of universal orders in many cardinals.Menachem Kojman & Saharon Shelah - 1992 - Journal of Symbolic Logic 57 (3):875-891.
    Our theme is that not every interesting question in set theory is independent of ZFC. We give an example of a first order theory T with countable D(T) which cannot have a universal model at ℵ1 without CH; we prove in ZFC a covering theorem from the hypothesis of the existence of a universal model for some theory; and we prove--again in ZFC--that for a large class of cardinals there is no universal linear order (e.g. in every regular $\aleph_1 < (...)
    Download  
     
    Export citation  
     
    Bookmark   14 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  
  • Universal structures in power ℵ1.Alan H. Mekler - 1990 - Journal of Symbolic Logic 55 (2):466-477.
    It is consistent with ¬CH that every universal theory of relational structures with the joint embedding property and amalgamation for P --diagrams has a universal model of cardinality ℵ 1. For classes with amalgamation for P --diagrams it is consistent that $2^{\aleph_0} > \aleph_2$ and there is a universal model of cardinality ℵ 2.
    Download  
     
    Export citation  
     
    Bookmark   7 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  
  • The number of pairwise non-elementarily-embeddable models.Saharon Shelah - 1989 - Journal of Symbolic Logic 54 (4):1431-1455.
    We get consistency results on I(λ, T 1 , T) under the assumption that D(T) has cardinality $>|T|$ . We get positive results and consistency results on IE(λ, T 1 , T). The interest is model-theoretic, but the content is mostly set-theoretic: in Theorems 1-3, combinatorial; in Theorems 4-7 and 11(2), to prove consistency of counterexamples we concentrate on forcing arguments; and in Theorems 8-10 and 11(1), combinatorics for counterexamples; the rest are discussion and problems. In particular: (A) By Theorems (...)
    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  
  • 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