Increasing the groupwise density number by c.c.c. forcing (Q2461187): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.apal.2007.07.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2103980848 / rank
 
Normal rank

Revision as of 02:11, 20 March 2024

scientific article
Language Label Description Also known as
English
Increasing the groupwise density number by c.c.c. forcing
scientific article

    Statements

    Increasing the groupwise density number by c.c.c. forcing (English)
    0 references
    0 references
    0 references
    27 November 2007
    0 references
    For the bounding number~\(\mathfrak b\) and the groupwise density number~\(\mathfrak g\) both inequalities \(\mathfrak g<\mathfrak b\) and \(\mathfrak b<\mathfrak g\) are consistent. However \(\mathfrak b=\omega_1\) in all so far known models for the inequality \(\mathfrak b<\mathfrak g\). In the paper the authors prove that for every regular cardinal~\(\kappa\) definable without parameters, the statement \(\kappa=\mathfrak b<\mathfrak b^+=\mathfrak g\) is consisent. This answers a~question of Andreas Blass. The presented construction does not allow one to push~\(\mathfrak g\) strictly above~\(\mathfrak b^+\), and the authors give an explanation for some obstacles in getting \(\mathfrak g>\mathfrak b^+\).
    0 references
    cardinal characteristics of the continuum
    0 references
    bounding number
    0 references
    groupwise density number
    0 references
    character of an ultrafilter
    0 references
    forcing
    0 references

    Identifiers