Universal graphs without instances of CH: Revisited (Q920985): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: Péter Komjáth / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Péter Komjáth / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the consistency of some partition theorems for continuous colorings, and the structure of \(\aleph _ 1\)-dense real order types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost-disjoint sets the dense set problem and the partition calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of regular cardinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On universal locally finite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal structures in power ℵ<sub>1</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification theory and the number of non-isomorphic models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On universal graphs without instances of CH / rank
 
Normal rank

Latest revision as of 10:21, 21 June 2024

scientific article
Language Label Description Also known as
English
Universal graphs without instances of CH: Revisited
scientific article

    Statements

    Universal graphs without instances of CH: Revisited (English)
    0 references
    0 references
    1990
    0 references
    In an earlier paper [Ann. Pure Appl. Logic 26, 75-87 (1984; Zbl 0551.03032)] the author has shown that it is consistent that CH does not hold and there is a universal graph of size \(\omega_ 1\). Here this is generalized to higher cardinals, namely that there may exist a universal graph of size \(\lambda\), where \(\lambda\) is regular and for some \(\kappa\), \(\kappa =\kappa^{<\kappa}<\lambda <2^{\kappa}\) holds.
    0 references
    ccc forcing
    0 references
    regular cardinal
    0 references
    universal graph
    0 references

    Identifiers