C.c.c. forcing without combinatorics (Q3698792): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Alan H. Mekler / rank
Normal rank
 
Property / author
 
Property / author: Alan H. Mekler / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2307/2274136 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2119265237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated Cohen extensions and Souslin's problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weak version of \(\lozenge\) which follows from \(2^{\aleph_0}<2^{\aleph_1}\) / rank
 
Normal rank

Latest revision as of 19:17, 14 June 2024

scientific article
Language Label Description Also known as
English
C.c.c. forcing without combinatorics
scientific article

    Statements

    C.c.c. forcing without combinatorics (English)
    0 references
    0 references
    1984
    0 references
    0 references
    countable chain condition
    0 references
    Cohen reals
    0 references
    Martin's axiom
    0 references
    negation of the Continuum Hypothesis
    0 references
    ZFC
    0 references
    colouring
    0 references
    ladder system
    0 references
    N-generic condition
    0 references
    0 references
    0 references