C.c.c. forcing without combinatorics (Q3698792)

From MaRDI portal
Revision as of 01:28, 18 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
C.c.c. forcing without combinatorics
scientific article

    Statements

    title
    C.c.c. forcing without combinatorics (English)
    0 references
    DOI
    10.2307/2274136
    0 references
    author
    Alan H. Mekler
    0 references
    publication date
    1984
    0 references
    zbMATH DE Number
    3922639
    0 references
    zbMATH Keywords
    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
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3698792&oldid=8127842"
      Powered by MediaWiki