C.c.c. forcing without combinatorics (Q3698792): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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
1984
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
