Crowded and Selective Ultrafilters under the Covering Property Axiom (Q4434602): 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 / author
 
Property / author: Krzysztof Chris Ciesielski / rank
Normal rank
 
Property / author
 
Property / author: Krzysztof Chris Ciesielski / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated perfect-set forcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of Connectivity Functions on R<sup> <i>n</i> </sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crowded rational ultrafilters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better closed ultrafilters on \(\mathbb{Q}{}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO MEASURE PROPERTIES OF CARTESIAN PRODUCT SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semiselective coideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics on ideals and forcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ultrafilters of character <i>ω</i><sub>1</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some points in β<i>N</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Products of Infinitely Many Perfect Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mapping a set of reals onto the reals / rank
 
Normal rank

Latest revision as of 11:19, 6 June 2024

scientific article; zbMATH DE number 2002223
Language Label Description Also known as
English
Crowded and Selective Ultrafilters under the Covering Property Axiom
scientific article; zbMATH DE number 2002223

    Statements

    Crowded and Selective Ultrafilters under the Covering Property Axiom (English)
    0 references
    10 November 2003
    0 references
    ultrafilter
    0 references
    selective
    0 references
    crowded
    0 references
    P-points
    0 references
    rational numbers
    0 references
    independence
    0 references
    reaping
    0 references
    almost disjoint
    0 references
    covering.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references