Colouring and non-productivity of \(\aleph_ 2\)-c.c (Q678760): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Some theorems of set theory and their topological consequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Less saturated ideals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A graph which embeds all small graphs on any large set of vertices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4326402 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: More Jonsson algebras / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4428699 / rank | |||
Normal rank |
Latest revision as of 11:19, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Colouring and non-productivity of \(\aleph_ 2\)-c.c |
scientific article |
Statements
Colouring and non-productivity of \(\aleph_ 2\)-c.c (English)
0 references
3 September 1997
0 references
For cardinals \(\lambda,\mu,\theta,\sigma\) the symbol \(\text{Pr}_1(\lambda,\mu,\theta,\sigma)\) means that there exists a symmetric function \(d\colon\lambda\times\lambda\to \theta\) such that for each sequence \((u_{\alpha})_{\alpha<\mu}\) of pairwise disjoint subsets of \(\lambda\) of size less than \(\sigma\) and for every \(\gamma<\theta\) there are \(\alpha<\beta\) such that \(d[u_{\alpha}\times u_{\beta}]=\{\gamma\}\). The main result of the paper is that \(\text{Pr}_1(\aleph_2,\aleph_2,\aleph_2,\aleph_0)\) holds. Moreover, the statement \(\text{Pr}_1(\lambda^{+2},\lambda^{+2},\lambda^{+2},\lambda)\) is proved for any regular cardinal \(\lambda\).
0 references
colouring
0 references
negative partition relation
0 references
non-productivity
0 references
club guessing
0 references